ROOT » TMVA » TMVA » TMVA::BinarySearchTreeNode

class TMVA::BinarySearchTreeNode: public TMVA::Node

 Node for the BinarySearch or Decision Trees

 for the binary search tree, it basically consists of the EVENT, and
 pointers to the parent and daughters

 in case of the Decision Tree, it specifies parent and daughters, as
 well as "which variable is used" in the selection of this node, including
 the respective cut value.

Function Members (Methods)

virtual voidAddAttributesToNode(void* node) const
virtual voidAddContentToNode(stringstream& s) const
void*TMVA::Node::AddXMLTo(void* parent) const
TMVA::BinarySearchTreeNodeBinarySearchTreeNode(const TMVA::Event* e = __null, UInt_t signalClass = 0)
TMVA::BinarySearchTreeNodeBinarySearchTreeNode(TMVA::BinarySearchTreeNode* parent, char pos)
TMVA::BinarySearchTreeNodeBinarySearchTreeNode(const TMVA::BinarySearchTreeNode& n, TMVA::BinarySearchTreeNode* parent = __null)
static TClass*Class()
Int_tTMVA::Node::CountMeAndAllDaughters() const
virtual TMVA::Node*CreateNode() const
virtual Bool_tEqualsMe(const TMVA::Event&) const
UInt_tGetClass() const
UInt_tTMVA::Node::GetDepth() const
const vector<Float_t>&GetEventV() const
virtual TMVA::Node*TMVA::Node::GetLeft() const
virtual TMVA::Node*TMVA::Node::GetParent() const
virtual TMVA::BinaryTree*TMVA::Node::GetParentTree() const
charTMVA::Node::GetPos() const
virtual TMVA::Node*TMVA::Node::GetRight() const
Short_tGetSelector() const
const vector<Float_t>&GetTargets() const
Float_tGetWeight() const
virtual Bool_tGoesLeft(const TMVA::Event&) const
virtual Bool_tGoesRight(const TMVA::Event&) const
virtual TClass*IsA() const
TMVA::NodeTMVA::Node::Node(const TMVA::Node& n)
TMVA::NodeTMVA::Node::Node(TMVA::Node* p, char pos)
TMVA::BinarySearchTreeNode&operator=(const TMVA::BinarySearchTreeNode&)
virtual voidPrint(ostream& os) const
virtual voidPrintRec(ostream& os) const
voidTMVA::Node::ReadXML(void* node, UInt_t tmva_Version_Code = 262657)
voidTMVA::Node::SetDepth(UInt_t d)
virtual voidTMVA::Node::SetLeft(TMVA::Node* l)
virtual voidTMVA::Node::SetParent(TMVA::Node* p)
virtual voidTMVA::Node::SetParentTree(TMVA::BinaryTree* t)
voidTMVA::Node::SetPos(char s)
virtual voidTMVA::Node::SetRight(TMVA::Node* r)
voidSetSelector(Short_t i)
virtual voidShowMembers(TMemberInspector& insp) const
virtual voidStreamer(TBuffer&)
voidStreamerNVirtual(TBuffer& ClassDef_StreamerNVirtual_b)
virtual voidReadAttributes(void* node, UInt_t tmva_Version_Code = 262657)
virtual voidReadContent(stringstream& s)
virtual Bool_tReadDataRecord(istream& is, UInt_t tmva_Version_Code = 262657)

Data Members

UInt_tTMVA::Node::fDepthdepth of the node within the tree (seen from root node)
TMVA::Node*TMVA::Node::fLeftpointers to the two "daughter" nodes
TMVA::Node*TMVA::Node::fParentthe previous (parent) node
TMVA::BinaryTree*TMVA::Node::fParentTreepointer to the parent tree to which the Node belongs
charTMVA::Node::fPosposition, i.e. it is a left (l) or right (r) daughter
TMVA::Node*TMVA::Node::fRightpointers to the two "daughter" nodes
Short_tfSelectorindex of variable used in node selection (decision tree)

Class Charts

Inheritance Inherited Members Includes Libraries
Class Charts

Function documentation

BinarySearchTreeNode(const TMVA::Event* e = __null, UInt_t signalClass = 0)
 constructor of a node for the search tree
BinarySearchTreeNode(TMVA::BinarySearchTreeNode* parent, char pos)
 constructor of a daughter node as a daughter of 'p'
BinarySearchTreeNode(const TMVA::BinarySearchTreeNode& n, TMVA::BinarySearchTreeNode* parent = __null)
 copy constructor of a node. It will result in an explicit copy of
 the node and recursively all it's daughters
 node destructor
Bool_t GoesRight(const TMVA::Event& ) const
 check if the event fed into the node goes/decends to the right daughter
Bool_t GoesLeft(const TMVA::Event& ) const
 check if the event fed into the node goes/decends to the left daughter
Bool_t EqualsMe(const TMVA::Event& ) const
 check if the event fed into the node actually equals the event
 that forms the node (in case of a search tree)
void Print(ostream& os) const
 print the node
void PrintRec(ostream& os) const
 recursively print the node and its daughters (--> print the 'tree')
Bool_t ReadDataRecord(istream& is, UInt_t tmva_Version_Code = 262657)
 Read the data block
void ReadAttributes(void* node, UInt_t tmva_Version_Code = 262657)
 read attributes from XML
void AddAttributesToNode(void* node) const
 adding attributes to tree node
void AddContentToNode(stringstream& s) const
 adding attributes to tree node
void ReadContent(stringstream& s)
 read events from node
Node* CreateNode() const
{ return new BinarySearchTreeNode(); }
void SetSelector(Short_t i)
 set index of variable used for discrimination at this node
{ fSelector = i; }
Short_t GetSelector() const
 return index of variable used for discrimination at this node
{ return fSelector; }
const std::vector<Float_t> & GetEventV() const
{ return fEventV; }
Float_t GetWeight() const
{ return fWeight; }
UInt_t GetClass() const
      Bool_t                       IsSignal()  const { return (fClass == fSignalClass); }
{ return fClass; }
const std::vector<Float_t> & GetTargets() const
{ return fTargets; }