Quick Links: ROOT Homepage Class Index Class Hierarchy

Source: header file inheritance tree (.pdf)

Sections: class description function members data members class charts

class TMVA::BinarySearchTreeNode: public TMVA::Node


BinarySearchTreeNode

Node for the BinarySearch  Tree

Function Members (Methods)

public:

virtual	~BinarySearchTreeNode()
virtual void	AddAttributesToNode(void* node) const
virtual void	AddContentToNode(stringstream& s) const
void*	TMVA::Node::AddXMLTo(void* parent) const
TMVA::BinarySearchTreeNode	BinarySearchTreeNode(const TMVA::Event* e = __null, UInt_t signalClass = 0)
TMVA::BinarySearchTreeNode	BinarySearchTreeNode(TMVA::BinarySearchTreeNode* parent, char pos)
TMVA::BinarySearchTreeNode	BinarySearchTreeNode(const TMVA::BinarySearchTreeNode& n, TMVA::BinarySearchTreeNode* parent = __null)
static TClass*	Class()
Int_t	TMVA::Node::CountMeAndAllDaughters() const
virtual TMVA::Node*	CreateNode() const
virtual Bool_t	EqualsMe(const TMVA::Event&) const
UInt_t	GetClass() const
int	TMVA::Node::GetCount()
UInt_t	TMVA::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
char	TMVA::Node::GetPos() const
virtual TMVA::Node*	TMVA::Node::GetRight() const
Short_t	GetSelector() const
const vector<Float_t>&	GetTargets() const
Float_t	GetWeight() const
virtual Bool_t	GoesLeft(const TMVA::Event&) const
virtual Bool_t	GoesRight(const TMVA::Event&) const
virtual TClass*	IsA() const
TMVA::Node	TMVA::Node::Node()
TMVA::Node	TMVA::Node::Node(const TMVA::Node& n)
TMVA::Node	TMVA::Node::Node(TMVA::Node* p, char pos)
TMVA::BinarySearchTreeNode&	operator=(const TMVA::BinarySearchTreeNode&)
virtual void	Print(ostream& os) const
virtual void	PrintRec(ostream& os) const
void	TMVA::Node::ReadXML(void* node, UInt_t tmva_Version_Code = 262657)
void	TMVA::Node::SetDepth(UInt_t d)
virtual void	TMVA::Node::SetLeft(TMVA::Node* l)
virtual void	TMVA::Node::SetParent(TMVA::Node* p)
virtual void	TMVA::Node::SetParentTree(TMVA::BinaryTree* t)
void	TMVA::Node::SetPos(char s)
virtual void	TMVA::Node::SetRight(TMVA::Node* r)
void	SetSelector(Short_t i)
virtual void	ShowMembers(TMemberInspector& insp) const
virtual void	Streamer(TBuffer&)
void	StreamerNVirtual(TBuffer& ClassDef_StreamerNVirtual_b)

private:

virtual void	ReadAttributes(void* node, UInt_t tmva_Version_Code = 262657)
virtual void	ReadContent(stringstream& s)
virtual Bool_t	ReadDataRecord(istream& is, UInt_t tmva_Version_Code = 262657)

Data Members

protected:

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

private:

UInt_t	fClass
vector<Float_t>	fEventV
Short_t	fSelector	index of variable used in node selection (decision tree)
vector<Float_t>	fTargets
Float_t	fWeight

Class Charts

Inheritance Chart:

TMVA::Node

←

TMVA::BinarySearchTreeNode

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

Node* CreateNode() const

 destructor

{ return new BinarySearchTreeNode(); }

Bool_t GoesRight(const TMVA::Event& ) const

 test event if it decends the tree at this node to the right

Bool_t GoesLeft(const TMVA::Event& ) const

 test event if it decends the tree at this node to the left

Bool_t EqualsMe(const TMVA::Event& ) const

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

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

void Print(ostream& os) const

 printout of the node

void PrintRec(ostream& os) const

 recursive printout of the node and it daughters

void AddAttributesToNode(void* node) const

void AddContentToNode(stringstream& s) const

void ReadAttributes(void* node, UInt_t tmva_Version_Code = 262657)

 Read the data block

Bool_t ReadDataRecord(istream& is, UInt_t tmva_Version_Code = 262657)

void ReadContent(stringstream& s)