| virtual | ~Node() |
| virtual void | AddAttributesToNode(void* node) const |
| virtual void | AddContentToNode(stringstream& s) const |
| void* | AddXMLTo(void* parent) const |
| static TClass* | Class() |
| Int_t | CountMeAndAllDaughters() const |
| virtual TMVA::Node* | CreateNode() const |
| int | GetCount() |
| UInt_t | GetDepth() const |
| virtual TMVA::Node* | GetLeft() const |
| virtual TMVA::Node* | GetParent() const |
| virtual TMVA::BinaryTree* | GetParentTree() const |
| char | GetPos() const |
| virtual TMVA::Node* | GetRight() const |
| virtual Bool_t | GoesLeft(const TMVA::Event&) const |
| virtual Bool_t | GoesRight(const TMVA::Event&) const |
| virtual TClass* | IsA() const |
| TMVA::Node | Node() |
| TMVA::Node | Node(const TMVA::Node& n) |
| TMVA::Node | Node(TMVA::Node* p, char pos) |
| TMVA::Node& | operator=(const TMVA::Node&) |
| virtual void | Print(ostream& os) const |
| virtual void | PrintRec(ostream& os) const |
| virtual void | ReadAttributes(void* node, UInt_t tmva_Version_Code = 262657) |
| virtual void | ReadContent(stringstream& s) |
| virtual Bool_t | ReadDataRecord(istream&, UInt_t tmva_Version_Code = 262657) |
| void | ReadXML(void* node, UInt_t tmva_Version_Code = 262657) |
| void | SetDepth(UInt_t d) |
| virtual void | SetLeft(TMVA::Node* l) |
| virtual void | SetParent(TMVA::Node* p) |
| virtual void | SetParentTree(TMVA::BinaryTree* t) |
| void | SetPos(char s) |
| virtual void | SetRight(TMVA::Node* r) |
| virtual void | ShowMembers(TMemberInspector& insp) const |
| virtual void | Streamer(TBuffer&) |
| void | StreamerNVirtual(TBuffer& ClassDef_StreamerNVirtual_b) |
| UInt_t | fDepth | depth of the node within the tree (seen from root node) |
| TMVA::Node* | fLeft | pointers to the two "daughter" nodes |
| TMVA::Node* | fParent | the previous (parent) node |
| TMVA::BinaryTree* | fParentTree | pointer to the parent tree to which the Node belongs |
| char | fPos | position, i.e. it is a left (l) or right (r) daughter |
| TMVA::Node* | fRight | pointers to the two "daughter" nodes |
| static Int_t | fgCount | counter of all nodes present.. for debug.. to spot memory leaks... |
| Inheritance Chart: | ||||||||||||
|
test event if i{ decends the tree at this node to the right
test event if it decends the tree at this node to the left
test event if it is equal to the event that "makes the node" (just for the "search tree" return pointer to the left/right daughter or parent node
{ return fLeft; }recursively go through the part of the tree below this node and count all daughters
Set depth, layer of the where the node is within the tree, seen from the top (root)
{fDepth=d;}Return depth, layer of the where the node is within the tree, seen from the top (root)
{return fDepth;}Return the node position, i.e, the node is a left (l) or right (r) daugther
{return fPos;}Return the pointer to the Parent tree to which the Node belongs
{return fParentTree;}set the pointer to the Parent Tree to which the Node belongs
{fParentTree = t;}