TMVA::Node

Function Members (Methods)

Display options:

This is an abstract class, constructors will not be documented.
Look at the header to check for available constructors.

public:

virtual	~Node()
static TClass*	Class()
Int_t	CountMeAndAllDaughters() const
int	GetCount()
UInt_t	GetDepth() const
TMVA::Node*	GetLeft() const
TMVA::Node*	GetParent() const
TMVA::BinaryTree*	GetParentTree() const
char	GetPos() const
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&	operator=(const TMVA::Node&)
virtual void	Print(ostream& os) const
virtual void	PrintRec(ostream& os) const
virtual void	ReadRec(istream& is, char& pos, UInt_t& depth, TMVA::Node* parent = NULL)
void	SetDepth(const UInt_t d)
void	SetLeft(TMVA::Node* l)
void	SetParent(TMVA::Node* p)
void	SetParentTree(TMVA::BinaryTree* t)
void	SetPos(const char s)
void	SetRight(TMVA::Node* r)
virtual void	ShowMembers(TMemberInspector& insp, char* parent)
virtual void	Streamer(TBuffer& b)
void	StreamerNVirtual(TBuffer& b)

Data Members

private:

TMVA::Node*	fParent	the previous (parent) node
TMVA::Node*	fLeft	pointers to the two "daughter" nodes
TMVA::Node*	fRight	pointers to the two "daughter" nodes
char	fPos	position, i.e. it is a left (l) or right (r) daughter
UInt_t	fDepth	depth of the node within the tree (seen from root node)
TMVA::BinaryTree*	fParentTree	pointer to the parent tree to which the Node belongs
static int	fgCount	counter of all nodes present.. for debug.. to spot memory leaks...

Class Description

                                                                      
 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.
______________________________________________________________________

Bool_t GoesRight( const Event& )

 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

Node* GetParent()

 return pointer to the parent node

{ return fParent; }

void SetParent(Node* p)

 set pointer to the parent node

{ fParent = p;}

void ReadRec( istream& is, char &pos, UInt_t &depth, Node* parent=NULL )

 recursive reading of the node (essectially the whole tree) from a text file 
 Set depth, layer of the where the node is within the tree, seen from the top (root)

{fDepth=d;}

UInt_t GetDepth()

 Return depth, layer of the where the node is within the tree, seen from the top (root)

{return fDepth;}

void SetPos(const char s)

 set node position, i.e, the node is a left (l) or right (r) daugther

{fPos=s;}

char GetPos()

 Return the node position, i.e, the node is a left (l) or right (r) daugther

{return fPos;}

TMVA::BinaryTree* GetParentTree()

 Return the pointer to the Parent tree to which the Node belongs

{return fParentTree;}

void SetParentTree(TMVA::BinaryTree* t)

 set the pointer to the Parent Tree to which the Node belongs

{fParentTree = t;}

TMVA::Node

class TMVA::Node

Function Members (Methods)

Data Members

Class Description