class 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)

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
virtual Int_t	GetMemSize() 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(UInt_t d)
void	SetLeft(TMVA::Node* l)
void	SetParent(TMVA::Node* p)
void	SetParentTree(TMVA::BinaryTree* t)
void	SetPos(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:

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

Class Charts

Function documentation

Bool_t GoesRight(const TMVA::Event& ) const

 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

Bool_t GoesLeft(const TMVA::Event& ) const

 test event if it is equal to the event that "makes the node" (just for the "search tree"

Node* GetLeft()

 return pointer to the left daughter node
 return pointer to the right daughter node

{ return fLeft; }

Node* GetRight()

 return pointer to the parent node

{ return fRight; }

void SetLeft(TMVA::Node* l)

 set pointer to the left daughter node
 set pointer to the right daughter node

{ fLeft = l;}

void SetRight(TMVA::Node* r)

 set pointer to the parent node

{ fRight = r;}

void PrintRec(ostream& os) const

 recursive printout of the node and it daughters
 recursive reading of the node (essectially the whole tree) from a text file

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

 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(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;}