63 fWeight ( e==0?0:e->GetWeight() ),
69 for (std::vector<Float_t>::const_iterator it = e->
GetTargets().begin(); it < e->
GetTargets().end(); ++it ) {
153 os <<
"< *** " << std::endl <<
" node.Data: ";
154 std::vector<Float_t>::const_iterator it=
fEventV.begin();
155 os <<
fEventV.size() <<
" vars: ";
156 for (;it!=
fEventV.end(); ++it) os <<
" " << std::setw(10) << *it;
157 os <<
" EvtWeight " << std::setw(10) <<
fWeight;
158 os << std::setw(10) <<
"Class: " <<
GetClass() << std::endl;
160 os <<
"Selector: " << this->
GetSelector() <<std::endl;
161 os <<
"My address is " << long(
this) <<
", ";
163 if (this->
GetLeft() != NULL) os <<
" left daughter at addr: " << long(this->
GetLeft());
164 if (this->
GetRight() != NULL) os <<
" right daughter at addr: " << long(this->
GetRight()) ;
166 os <<
" **** > "<< std::endl;
175 <<
" data: " << std::endl;
176 std::vector<Float_t>::const_iterator it=
fEventV.begin();
177 os <<
fEventV.size() <<
" vars: ";
178 for (;it!=
fEventV.end(); ++it) os <<
" " << std::setw(10) << *it;
179 os <<
" EvtWeight " << std::setw(10) <<
fWeight;
180 os << std::setw(10) <<
"Class: " <<
GetClass() << std::endl;
193 UInt_t depth, selIdx, nvar;
200 if ( itmp==-1 ) {
return kFALSE; }
212 for (
UInt_t ivar=0; ivar<nvar; ivar++) {
213 is >> evtValFloat;
fEventV.push_back(evtValFloat);
217 fClass = (sigbkgd==
"S" || sigbkgd==
"Signal")?0:1;
231 if (sb==
"Signal" || sb==
"0")
259 std::ios_base::fmtflags ff = s.flags();
275 while (s >> temp)
fTargets.push_back(temp);
virtual void PrintRec(std::ostream &os) const
recursively print the node and its daughters (–> print the 'tree')
virtual Bool_t GoesRight(const Event &) const
check if the event fed into the node goes/descends to the right daughter
virtual void PrintRec(std::ostream &os) const =0
virtual Bool_t GoesLeft(const Event &) const
check if the event fed into the node goes/descends to the left daughter
std::vector< Float_t > fTargets
virtual void SetRight(Node *r)
Node for the BinarySearch or Decision Trees.
virtual void SetLeft(Node *l)
virtual Bool_t ReadDataRecord(std::istream &is, UInt_t tmva_Version_Code=TMVA_VERSION_CODE)
Read the data block.
virtual Node * GetRight() const
std::vector< Float_t > fEventV
virtual Node * GetLeft() const
void SetSelector(Short_t i)
virtual void AddContentToNode(std::stringstream &s) const
adding attributes to tree node
std::vector< Float_t > & GetTargets()
virtual ~BinarySearchTreeNode()
node destructor
virtual Node * GetParent() const
virtual void ReadAttributes(void *node, UInt_t tmva_Version_Code=TMVA_VERSION_CODE)
read attributes from XML
virtual void SetParent(Node *p)
UInt_t GetNVariables() const
accessor to the number of variables
Float_t GetValue(UInt_t ivar) const
return value of i'th variable
virtual void AddAttributesToNode(void *node) const
adding attributes to tree node
virtual Bool_t EqualsMe(const Event &) const
check if the event fed into the node actually equals the event that forms the node (in case of a sear...
static constexpr double s
you should not use this method at all Int_t Int_t Double_t Double_t Double_t e
BinarySearchTreeNode(const Event *e=NULL, UInt_t signalClass=0)
constructor of a node for the search tree
const std::vector< Float_t > & GetEventV() const
Abstract ClassifierFactory template that handles arbitrary types.
Node for the BinarySearch or Decision Trees.
virtual void Print(std::ostream &os) const
print the node
Short_t GetSelector() const
virtual void ReadContent(std::stringstream &s)
read events from node