library: libTMVA
#include "BinarySearchTree.h"

TMVA::BinarySearchTree


class description - header file - source file - inheritance tree (.pdf)

class TMVA::BinarySearchTree : public TMVA::BinaryTree

Inheritance Chart:
TMVA::BinaryTree
<-
TMVA::BinarySearchTree
    private:
void DestroyNode(TMVA::Node*) Bool_t InVolume(TMVA::Event*, TMVA::Volume*) const Double_t SearchVolume(TMVA::Node*, TMVA::Volume*, Int_t, vector<TMVA::Event*,allocator<TMVA::Event*> >* events) public:
BinarySearchTree() BinarySearchTree(const TMVA::BinarySearchTree&) virtual ~BinarySearchTree() static TClass* Class() Int_t Fill(TTree* theTree, vector<TString>* theVars, Int_t theType = -1) Int_t Fill(vector<TMVA::Event*>, vector<Int_t> theVars, Int_t theType = -1) Int_t Fill(vector<TMVA::Event*> theTree, Int_t theType = -1) virtual TClass* IsA() const TMVA::BinarySearchTree& operator=(const TMVA::BinarySearchTree&) Double_t SearchVolume(TMVA::Volume*, vector<TMVA::Event*>* events = 0) virtual void ShowMembers(TMemberInspector& insp, char* parent) virtual void Streamer(TBuffer& b) void StreamerNVirtual(TBuffer& b)

Data Members

    private:
Int_t fPeriode the number of variables defining the periode of ordering

Class Description

_______________________________________________________________________

 a simple Binary search tree including volume search method

_______________________________________________________________________
BinarySearchTree( void )
 default constructor
~BinarySearchTree( void )
 destructor
Int_t Fill( TTree* theTree, vector<TString>* theVars, Int_t theType )
 create the search tree from the events in a TTree
 using the variables specified in "theVars"
Int_t Fill( vector<TMVA::Event*> theTree, vector<Int_t> theVars, Int_t theType )
 create the search tree from the event collection
 using ONLY the variables specified in "theVars"
Int_t Fill( vector<TMVA::Event*> theTree, Int_t theType )
 create the search tree from the events in a TTree
 using ALL the variables specified included in the Event
Double_t SearchVolume( TMVA::Volume* volume, std::vector<TMVA::Event*>* events )
search the whole tree and add up all weigths of events that
 lie within the given voluem
Double_t SearchVolume( TMVA::Node* t, TMVA::Volume* volume, Int_t depth, std::vector<TMVA::Event*>* events )
 recursively walk through the daughter nodes and add up all weigths of events that
 lie within the given voluem
Bool_t InVolume( TMVA::Event* event, TMVA::Volume* volume )
 test if the data points are in the given volume
BinarySearchTree( void )
 constructor

Author: Andreas Hoecker, Joerg Stelzer, Helge Voss, Kai Voss
Last update: root/tmva $Id: BinarySearchTree.cxx,v 1.3 2006/05/23 19:35:06 brun Exp $
Copyright (c) 2005: *


ROOT page - Class index - Class Hierarchy - Top of the page

This page has been automatically generated. If you have any comments or suggestions about the page layout send a mail to ROOT support, or contact the developers with any questions or problems regarding ROOT.