66 UInt_t nnodes = nodes.size();
79 typedef std::pair<Double_t,Int_t> CutDir_t;
80 typedef std::pair<Int_t,CutDir_t> SelCut_t;
91 std::list<SelCut_t> allsel;
96 for (
UInt_t i=0; i<nnodes-1; i++) {
97 nextNode = nodes[i+1];
102 if (nodes[i]->GetRight() == nextNode) {
105 else if (nodes[i]->GetLeft() == nextNode) {
109 Log() <<
kFATAL <<
"<MakeTheRule> BUG! Should not be here - an end-node before the end!" <<
Endl;
112 allsel.push_back(SelCut_t(sel,CutDir_t(val,dir)));
120 for ( std::list<SelCut_t>::const_iterator it = allsel.begin(); it!=allsel.end(); it++ ) {
122 val = (*it).second.first;
123 dir = (*it).second.second;
136 if ((val<
fCutMin[nsel-1]) || firstMin) {
143 if ((val>
fCutMax[nsel-1]) || firstMax) {
180 done = (foundIt || (ind==
fSelector.size()));
182 if (!foundIt)
return kFALSE;
MsgLogger & Endl(MsgLogger &ml)
std::vector< Double_t > fCutMax
std::vector< Char_t > fCutDoMin
Float_t GetPurity(void) const
RuleCut()
empty constructor
std::vector< Char_t > fCutDoMax
std::vector< UInt_t > fSelector
UInt_t GetNcuts() const
get number of cuts
Float_t GetNEvents(void) const
Bool_t GetCutRange(Int_t sel, Double_t &rmin, Double_t &rmax, Bool_t &dormin, Bool_t &dormax) const
get cut range for a given selector
void MakeCuts(const std::vector< const TMVA::Node * > &nodes)
Construct the cuts from the given array of nodes.
Short_t GetSelector() const
std::vector< Double_t > fCutMin
virtual ~RuleCut()
destructor
Float_t GetCutValue(void) const