BinarySearchTree A simple Binary search tree including volume search method
| virtual | ~BinarySearchTree() |
| virtual void* | TMVA::BinaryTree::AddXMLTo(void* parent) const |
| TMVA::BinarySearchTree | BinarySearchTree() |
| TMVA::BinarySearchTree | BinarySearchTree(const TMVA::BinarySearchTree& b) |
| TMVA::BinaryTree | TMVA::BinaryTree::BinaryTree() |
| TMVA::BinaryTree | TMVA::BinaryTree::BinaryTree(const TMVA::BinaryTree&) |
| void | CalcStatistics(TMVA::Node* n = 0) |
| static TClass* | Class() |
| virtual const char* | ClassName() const |
| void | Clear(TMVA::Node* n = 0) |
| UInt_t | TMVA::BinaryTree::CountNodes(TMVA::Node* n = __null) |
| static TMVA::BinarySearchTree* | CreateFromXML(void* node, UInt_t tmva_Version_Code = 262657) |
| virtual TMVA::Node* | CreateNode(UInt_t) const |
| virtual TMVA::BinaryTree* | CreateTree() const |
| Double_t | Fill(const vector<TMVA::Event*>& events, Int_t theType = -1) |
| Double_t | Fill(const vector<TMVA::Event*>& events, const vector<Int_t>& theVars, Int_t theType = -1) |
| TMVA::Node* | TMVA::BinaryTree::GetLeftDaughter(TMVA::Node* n) |
| UInt_t | TMVA::BinaryTree::GetNNodes() const |
| UInt_t | GetPeriode() const |
| TMVA::Node* | TMVA::BinaryTree::GetRightDaughter(TMVA::Node* n) |
| virtual TMVA::Node* | TMVA::BinaryTree::GetRoot() const |
| Double_t | GetSumOfWeights() const |
| Double_t | GetSumOfWeights(Int_t theType) const |
| UInt_t | TMVA::BinaryTree::GetTotalTreeDepth() const |
| void | Insert(const TMVA::Event*) |
| virtual TClass* | IsA() const |
| Float_t | Max(TMVA::Types::ESBType sb, UInt_t var) |
| Float_t | Mean(TMVA::Types::ESBType sb, UInt_t var) |
| Float_t | Min(TMVA::Types::ESBType sb, UInt_t var) |
| void | NormalizeTree() |
| TMVA::BinarySearchTree& | operator=(const TMVA::BinarySearchTree&) |
| virtual void | TMVA::BinaryTree::Print(ostream& os) const |
| virtual void | TMVA::BinaryTree::Read(istream& istr, UInt_t tmva_Version_Code = 262657) |
| virtual void | TMVA::BinaryTree::ReadXML(void* node, UInt_t tmva_Version_Code = 262657) |
| Float_t | RMS(UInt_t var) |
| Float_t | RMS(TMVA::Types::ESBType sb, UInt_t var) |
| TMVA::BinarySearchTreeNode* | Search(TMVA::Event* event) const |
| Double_t | SearchVolume(TMVA::Volume*, vector<const TMVA::BinarySearchTreeNode*>* events = 0) |
| Int_t | SearchVolumeWithMaxLimit(TMVA::Volume*, vector<const TMVA::BinarySearchTreeNode*>* events = 0, Int_t = -1) |
| void | SetNormalize(Bool_t norm) |
| void | SetPeriode(Int_t p) |
| void | TMVA::BinaryTree::SetRoot(TMVA::Node* r) |
| void | TMVA::BinaryTree::SetTotalTreeDepth(Int_t depth) |
| void | TMVA::BinaryTree::SetTotalTreeDepth(TMVA::Node* n = __null) |
| virtual void | ShowMembers(TMemberInspector& insp) const |
| virtual void | Streamer(TBuffer&) |
| void | StreamerNVirtual(TBuffer& ClassDef_StreamerNVirtual_b) |
| void | TMVA::BinaryTree::DeleteNode(TMVA::Node*) |
| TMVA::MsgLogger& | TMVA::BinaryTree::Log() const |
| void | DestroyNode(TMVA::BinarySearchTreeNode*) |
| void | Insert(const TMVA::Event*, TMVA::Node*) |
| Bool_t | InVolume(const vector<Float_t>&, TMVA::Volume*) const |
| void | NormalizeTree(vector<pair<double,const TMVA::Event*> >::iterator, vector<pair<double,const TMVA::Event*> >::iterator, UInt_t) |
| TMVA::BinarySearchTreeNode* | Search(TMVA::Event*, TMVA::Node*) const |
| Double_t | SearchVolume(TMVA::Node*, TMVA::Volume*, Int_t, vector<const TMVA::BinarySearchTreeNode*>* events) |
| UInt_t | TMVA::BinaryTree::fDepth | maximal depth in tree reached |
| UInt_t | TMVA::BinaryTree::fNNodes | total number of nodes in the tree (counted) |
| TMVA::Node* | TMVA::BinaryTree::fRoot | the root node of the tree |
| Bool_t | fCanNormalize | the tree can be normalised |
| UInt_t | fCurrentDepth | internal variable, counting the depth of the tree during insertion |
| vector<Float_t> | fMax[2] | RMS for signal and background for each variable |
| vector<Float_t> | fMeans[2] | mean for signal and background for each variable |
| vector<Float_t> | fMin[2] | RMS for signal and background for each variable |
| Double_t | fNEventsW[2] | Number of events per class, taking into account event weights |
| vector<pair<Double_t,const TMVA::Event*> > | fNormalizeTreeTable | |
| UInt_t | fPeriod | periode (number of event variables) |
| vector<Float_t> | fRMS[2] | RMS for signal and background for each variable |
| Bool_t | fStatisticsIsValid | flag if last stat calculation is still valid, set to false if new node is insert |
| vector<Double_t> | fSum[2] | Sum for signal and background for each variable |
| Double_t | fSumOfWeights | Total number of events (weigthed) counted during filling |
| vector<Double_t> | fSumSq[2] | Squared Sum for signal and background for each variable |
| Inheritance Chart: | |||||||||
|
counts events (weights) within a given volume
Create the search tree from the event collection
using ONLY the variables specified in "theVars"
create the search tree from the events in a TTree using ALL the variables specified included in the Event
access to mean for signal and background for each variable
{ return fMeans[sb==Types::kSignal?0:1][var]; }access to RMS for signal and background for each variable
{ return fRMS[sb==Types::kSignal?0:1][var]; }access to Minimum for signal and background for each variable
{ return fMin[sb==Types::kSignal?0:1][var]; }access to Maximum for signal and background for each variable
{ return fMax[sb==Types::kSignal?0:1][var]; }check of Event variables lie with the volumde
recursive search through daughter nodes in weight counting