cutfinder_fullev.C File Reference

#include <algorithm>
#include "TFile.h"
#include "TTree.h"
#include "TString.h"
#include "TH1F.h"
#include "TCanvas.h"
#include "TROOT.h"
#include "TEventList.h"
#include "TDirectory.h"
#include <iostream>
#include "TLine.h"
#include "TLatex.h"
#include "TStyle.h"
#include "TObjArray.h"
#include "TPRegexp.h"
#include <map>
#include <utility>

Go to the source code of this file.

Macros
#define	MAX   1000
#define	BINS   500
#define	NCAN   3

Functions
bool	mycompare (int i, int j)
double	bestSignificance (TH1 *h1, TH1 *h2, double &bestcut, double fac2=1.)
int	countEvents (TTree *t, TString ccut)
int	countEvents (TTree *t, TEventList &el)
double	diffQA (TH1F &ht1, TH1F &ht2)
double	bestEff (TH1 *h1, TH1 *h2, double &bestcut, double supr2=0.8, double fac2=1.)
double	bestSuppression (TH1 *h1, TH1 *h2, double &bestcut, double eff=0.9)
double	bestSuppressionEvt (TTree *t, TString precut, TString varname, TString sigcut, TString bgcut, double &bestcut, double eff, int idx)
double	bestSeparation (TTree *t, TString varname, TEventList &els, TEventList &elb, double &bestcut, double eff, int idx)
double	bestSuppressionEvt (TTree *t, TString varname, TEventList &els, TEventList &elb, double &bestcut, double eff, int idx)
void	findLimits (TTree *t, TString var, TString ccut, double &low, double &high, double frac=0.98)
int	cutfinder_fullev (TString pre, TString ntp, TString sigcut, TString precut="", double n0s=50., double n0b=500., double supr=0.9)

Variables
std::map< int, int >	evcnt
double	signi [MAX]
int	idx [MAX]
TString	vars [MAX]
double	cut [MAX]
double	minh [MAX]
double	maxh [MAX]
double	N0_sig
double	N0_bg
double	Nsigev
double	Nbgev

Macro Definition Documentation

#define BINS   500

Definition at line 21 of file cutfinder_fullev.C.

#define MAX   1000

Definition at line 20 of file cutfinder_fullev.C.

Referenced by cutfinder_fullev().

#define NCAN   3

Definition at line 22 of file cutfinder_fullev.C.

Function Documentation

double bestEff	(	TH1 *	h1,
		TH1 *	h2,
		double &	bestcut,
		double	supr2 = 0.8,
		double	fac2 = 1.
	)

Definition at line 147 of file cutfinder_fullev.C.

References i, and n.

{
        int n=h1->GetNbinsX();
        double sum1=0, sum2=0;
        double bestr=0, bestl=0;
        double int1 = h1->Integral();
        double int2 = h2->Integral();
        double bestcutl=-999.;
        double bestcutr=999.;
        
        bestcut=-999.;
        int i=1;
        
        while (sum2<supr2)
        {
                sum1 += h1->GetBinContent(i)/int1;
                sum2 += h2->GetBinContent(i++)/int2;    
        }
        bestr=(1.0-sum1);
        bestcutr = h1->GetBinCenter(i-1);
        
        sum1=0;
        sum2=0;
        i=n;
        
        while (sum2<supr2)
        {
                sum1 += h1->GetBinContent(i)/int1;
                sum2 += h2->GetBinContent(i--)/int2;    
        }
        
        bestl=(1.0-sum1);
        bestcutl = h1->GetBinCenter(i-1);
                
        if (bestr>bestl) 
        {
                bestcut = bestcutr;
                return bestr;
        }
        
        bestcut = bestcutl;
        return bestl;
}

double bestSeparation	(	TTree *	t,
		TString	varname,
		TEventList &	els,
		TEventList &	elb,
		double &	bestcut,
		double	eff,
		int	idx
	)

Definition at line 326 of file cutfinder_fullev.C.

References ev, i, idx, max(), maxh, min(), minh, Nbgev, Nsigev, and run.

{
        int i;
        t->SetBranchStatus("*",0);
        t->SetBranchStatus("ev",1);
        t->SetBranchStatus("run",1);
        t->SetBranchStatus(varname,1);
        
        Float_t ev, var, run;
        t->SetBranchAddress("ev",&ev);
        t->SetBranchAddress("run",&run);
        t->SetBranchAddress(varname,&var);
        
        std::map<int, int> sigcnt;
        std::map<int, int> bgcnt;
        std::map<int, int> bgcnt2;
        
        std::vector<pair<double, int> > sigvals;
        std::vector<pair<double, int> > bgvals;
        
        int Nsigval = els.GetN(), Nbgval = elb.GetN();
        double min = 1e9, max=-1e9;
        
        // prepare the pairs of variable value, eventnumber for signal and count signals
        for (i=0;i<els.GetN();++i)
        {
                t->GetEntry(els.GetEntry(i));
                sigvals.push_back(std::make_pair(var, ev+run*2000));
                if (var>max) max = var;
                if (var<min) min = var;
        }
                
        // prepare the pairs of variable value, eventnumber for background and count background
        for (i=0;i<elb.GetN();++i)
        {
                t->GetEntry(elb.GetEntry(i));
                bgvals.push_back(std::make_pair(var, ev+run*2000));
        }
        
        // sort signals by first element = variable value
        sort(sigvals.begin(), sigvals.end());

        i=0;
        sigcnt.clear();
        // find cut for current efficiency requirement left cut
        while ( (sigcnt.size()/(double)Nsigev)<eff && i<Nsigval ) sigcnt[sigvals[i++].second]+=1;
        double leftcut = sigvals[i].first;
        
        sigcnt.clear();
        i=sigvals.size()-1;
        // find cut for current efficiency requirement right cut
        while ( (sigcnt.size()/(double)Nsigev)<eff && i>=0) sigcnt[sigvals[i--].second]+=1; 
        double rightcut = sigvals[i].first;
        
        bgcnt.clear();
        bgcnt2.clear();
        
        for (i=0;i<bgvals.size();++i)
        {
                if (bgvals[i].first<=leftcut)  bgcnt[bgvals[i].second];
                if (bgvals[i].first>=rightcut) bgcnt2[bgvals[i].second];
                if (bgvals[i].first>max) max = bgvals[i].first;
                if (bgvals[i].first<min) min = bgvals[i].first;
        }
        
        minh[idx]=min; maxh[idx]=max;

        t->SetBranchStatus("*",1);
        
        
        double leftsupr = (Nbgev-bgcnt.size())/Nbgev;
        double rightsupr = (Nbgev-bgcnt2.size())/Nbgev;

        cout <<varname<<" l:"<<leftcut<<"("<<leftsupr<<")  r:"<<rightcut<<"("<<rightsupr<<")"<<endl;
        
        if (leftcut!=leftcut || rightcut!=rightcut) return 0;
        
        bestcut = rightcut;
        if (leftsupr>rightsupr) 
        {
                bestcut = leftcut;
                return leftsupr;
        }
        return rightsupr;
        
        
}

double bestSignificance	(	TH1 *	h1,
		TH1 *	h2,
		double &	bestcut,
		double	fac2 = 1.
	)

Definition at line 41 of file cutfinder_fullev.C.

References i, n, and sqrt().

{
        int n=h1->GetNbinsX();
        double sum1=0, sum2=0;
        double bestr=0, bestl=0;
        double int1 = h1->Integral();
        double int2 = h2->Integral();
        double bestcutl=-999.;
        double bestcutr=999.;
        
        bestcut=-999.;
        
        for (int i=1;i<n;++i)
        {
                double cur1 = h1->GetBinContent(i)/int1;
                double cur2 = h2->GetBinContent(i)/int2;
                sum1 += cur1;
                sum2 += cur2;
                
                double vall = 0, valr=0;
                
                if ((sum1+fac2*sum2)>0) vall=sum1/sqrt(fac2*sum2+sum1);
                if ((1.-sum1+fac2*(1.-sum2))>0) valr=(1.-sum1)/sqrt(1.-sum1+fac2*(1.-sum2));
                
                if (valr>bestr) { bestr=valr; bestcutr = h1->GetBinCenter(i);}
                if (vall>bestl) { bestl=vall; bestcutl = h1->GetBinCenter(i);}
        }
        
        if (bestr>bestl) 
        {
                bestcut = bestcutr;
                return bestr;
        }
        
        bestcut = bestcutl;
        return bestl;
}

double bestSuppression	(	TH1 *	h1,
		TH1 *	h2,
		double &	bestcut,
		double	eff = 0.9
	)

Definition at line 191 of file cutfinder_fullev.C.

References i, and n.

Referenced by cutfinder().

{
        int n=h1->GetNbinsX();
        double sum1=0, sum2=0;
        double bestr=0, bestl=0;
        double int1 = h1->Integral();
        double int2 = h2->Integral();
        double bestcutl=-999.;
        double bestcutr=999.;
        
        bestcut=-999.;
        int i=1;
        
        while (sum1<eff)
        {
                sum1 += h1->GetBinContent(i)/int1;
                sum2 += h2->GetBinContent(i++)/int2;    
        }
        bestr=(1.0-sum2);
        bestcutr = h1->GetBinCenter(i-1);
        
        sum1=0;
        sum2=0;
        i=n;
        
        while (sum1<eff)
        {
                sum1 += h1->GetBinContent(i)/int1;
                sum2 += h2->GetBinContent(i--)/int2;    
        }
        
        bestl=(1.0-sum2);
        bestcutl = h1->GetBinCenter(i-1);
                
        if (bestr>bestl) 
        {
                bestcut = bestcutr;
                return bestr;
        }
        
        bestcut = bestcutl;
        return bestl;
}

double bestSuppressionEvt	(	TTree *	t,
		TString	precut,
		TString	varname,
		TString	sigcut,
		TString	bgcut,
		double &	bestcut,
		double	eff,
		int	idx
	)

Definition at line 235 of file cutfinder_fullev.C.

References elb, els, ev, i, idx, max(), maxh, min(), minh, Nbgev, Nsigev, and run.

{       
        int i;
        t->SetEventList(0);
        t->SetBranchStatus("*",1);
        
        TEventList els("els"), elb("elb");
        t->Draw(">>els",precut+"&&"+sigcut);
        t->Draw(">>elb",precut+"&&"+bgcut);
        
        t->SetBranchStatus("*",0);
        t->SetBranchStatus("ev",1);
        t->SetBranchStatus("run",1);
        t->SetBranchStatus(varname,1);
        
        Float_t ev, var, run;
        t->SetBranchAddress("ev",&ev);
        t->SetBranchAddress("run",&run);
        t->SetBranchAddress(varname,&var);
        
        std::map<int, int> sigcnt;
        std::map<int, int> bgcnt;
        std::map<int, int> bgcnt2;
        
        std::vector<pair<double, int> > sigvals;
        std::vector<pair<double, int> > bgvals;
        
        int Nsigval = els.GetN(), Nbgval = elb.GetN();
        double min = 1e9, max=-1e9;
        
        // prepare the pairs of variable value, eventnumber for signal and count signals
        for (i=0;i<els.GetN();++i)
        {
                t->GetEntry(els.GetEntry(i));
                sigvals.push_back(std::make_pair(var, ev+run*2000));
                if (var>max) max = var;
                if (var<min) min = var;
        }
                
        // prepare the pairs of variable value, eventnumber for background and count background
        for (i=0;i<elb.GetN();++i)
        {
                t->GetEntry(elb.GetEntry(i));
                bgvals.push_back(std::make_pair(var, ev+run*2000));
        }
        
        // sort signals by first element = variable value
        sort(sigvals.begin(), sigvals.end());

        i=0;
        sigcnt.clear();
        // find cut for current efficiency requirement left cut
        while ( (sigcnt.size()/(double)Nsigev)<eff && i<Nsigval ) sigcnt[sigvals[i++].second]+=1;
        double leftcut = sigvals[i].first;
        
        sigcnt.clear();
        i=sigvals.size()-1;
        // find cut for current efficiency requirement right cut
        while ( (sigcnt.size()/(double)Nsigev)<eff && i>=0) sigcnt[sigvals[i--].second]+=1; 
        double rightcut = sigvals[i].first;
        
        bgcnt.clear();
        bgcnt2.clear();
        
        for (i=0;i<bgvals.size();++i)
        {
                if (bgvals[i].first<=leftcut)  bgcnt[bgvals[i].second];
                if (bgvals[i].first>=rightcut) bgcnt2[bgvals[i].second];
                if (bgvals[i].first>max) max = bgvals[i].first;
                if (bgvals[i].first<min) min = bgvals[i].first;
        }
        
        minh[idx]=min; maxh[idx]=max;

        t->SetBranchStatus("*",1);
        
        
        double leftsupr = (Nbgev-bgcnt.size())/Nbgev;
        double rightsupr = (Nbgev-bgcnt2.size())/Nbgev;

        cout <<varname<<" l:"<<leftcut<<"("<<leftsupr<<")  r:"<<rightcut<<"("<<rightsupr<<")"<<endl;
        
        bestcut = rightcut;
        if (leftsupr>rightsupr) 
        {
                bestcut = leftcut;
                return leftsupr;
        }
        return rightsupr;
}

double bestSuppressionEvt	(	TTree *	t,
		TString	varname,
		TEventList &	els,
		TEventList &	elb,
		double &	bestcut,
		double	eff,
		int	idx
	)

Definition at line 414 of file cutfinder_fullev.C.

References ev, i, idx, max(), maxh, min(), minh, Nbgev, Nsigev, and run.

{       
        int i;
        t->SetBranchStatus("*",0);
        t->SetBranchStatus("ev",1);
        t->SetBranchStatus("run",1);
        t->SetBranchStatus(varname,1);
        
        Float_t ev, var, run;
        t->SetBranchAddress("ev",&ev);
        t->SetBranchAddress("run",&run);
        t->SetBranchAddress(varname,&var);
        
        std::map<int, int> sigcnt;
        std::map<int, int> bgcnt;
        std::map<int, int> bgcnt2;
        
        std::vector<pair<double, int> > sigvals;
        std::vector<pair<double, int> > bgvals;
        
        int Nsigval = els.GetN(), Nbgval = elb.GetN();
        double min = 1e9, max=-1e9;
        
        // prepare the pairs of variable value, eventnumber for signal and count signals
        for (i=0;i<els.GetN();++i)
        {
                t->GetEntry(els.GetEntry(i));
                sigvals.push_back(std::make_pair(var, ev+run*2000));
                if (var>max) max = var;
                if (var<min) min = var;
        }
                
        // prepare the pairs of variable value, eventnumber for background and count background
        for (i=0;i<elb.GetN();++i)
        {
                t->GetEntry(elb.GetEntry(i));
                bgvals.push_back(std::make_pair(var, ev+run*2000));
        }
        
        // sort signals by first element = variable value
        sort(sigvals.begin(), sigvals.end());

        i=0;
        sigcnt.clear();
        // find cut for current efficiency requirement left cut
        while ( (sigcnt.size()/(double)Nsigev)<eff && i<Nsigval ) sigcnt[sigvals[i++].second]+=1;
        double leftcut = sigvals[i].first;
        
        sigcnt.clear();
        i=sigvals.size()-1;
        // find cut for current efficiency requirement right cut
        while ( (sigcnt.size()/(double)Nsigev)<eff && i>=0) sigcnt[sigvals[i--].second]+=1; 
        double rightcut = sigvals[i].first;
        
        bgcnt.clear();
        bgcnt2.clear();
        
        for (i=0;i<bgvals.size();++i)
        {
                if (bgvals[i].first<=leftcut)  bgcnt[bgvals[i].second];
                if (bgvals[i].first>=rightcut) bgcnt2[bgvals[i].second];
                if (bgvals[i].first>max) max = bgvals[i].first;
                if (bgvals[i].first<min) min = bgvals[i].first;
        }
        
        minh[idx]=min; maxh[idx]=max;

        t->SetBranchStatus("*",1);
        
        
        double leftsupr = (Nbgev-bgcnt.size())/Nbgev;
        double rightsupr = (Nbgev-bgcnt2.size())/Nbgev;

        cout <<varname<<" l:"<<leftcut<<"("<<leftsupr<<")  r:"<<rightcut<<"("<<rightsupr<<")"<<endl;
        
        if (leftcut!=leftcut || rightcut!=rightcut) return 0;
        
        bestcut = rightcut;
        if (leftsupr>rightsupr) 
        {
                bestcut = leftcut;
                return leftsupr;
        }
        return rightsupr;
}

int countEvents	(	TTree *	t,
		TString	ccut
	)

Definition at line 79 of file cutfinder_fullev.C.

References ev, evcnt, i, and run.

{
        t->SetEventList(0);
        t->SetBranchStatus("*",1);
        t->Draw(">>el",ccut);
        t->SetBranchStatus("*",0);
        t->SetBranchStatus("evt",1);
        t->SetBranchStatus("run",1);
        
        TEventList *el=(TEventList*)gDirectory->Get("el");
        
        Float_t ev,run;
        t->SetBranchAddress("ev",&ev);
        t->SetBranchAddress("run",&run);
        
        evcnt.clear();
        
        for (int i=0;i<el->GetN();++i)
        {
                t->GetEntry(el->GetEntry(i));
                evcnt[ev+run*2000]+=1;
        }
        t->SetBranchStatus("*",1);

        return evcnt.size();
}

int countEvents	(	TTree *	t,
		TEventList &	el
	)

Definition at line 105 of file cutfinder_fullev.C.

References ev, evcnt, i, and run.

{
        t->SetEventList(&el);
        t->SetBranchStatus("*",0);
        t->SetBranchStatus("ev",1);
        t->SetBranchStatus("run",1);
        
        Float_t ev, run;
        t->SetBranchAddress("ev",&ev);
        t->SetBranchAddress("run",&run);
        
        evcnt.clear();
        
        for (int i=0;i<el.GetN();++i)
        {
                t->GetEntry(el.GetEntry(i));
                evcnt[ev+2000*run]+=1;
        }
        t->SetBranchStatus("*",1);

        return evcnt.size();
}

int cutfinder_fullev	(	TString	pre,
		TString	ntp,
		TString	sigcut,
		TString	precut = "",
		double	n0s = 50.,
		double	n0b = 500.,
		double	supr = 0.9
	)

Definition at line 534 of file cutfinder_fullev.C.

References bestSuppressionEvt(), c1, cnt, countEvents(), cut, elb, els, f, h1, h2, i, idx, MAX, maxh, minh, mycompare(), N0_bg, N0_sig, Nbgev, nsig, Nsigev, signi, t, TString, and vars.

{
        gStyle->SetTitleY(0.993);
        gStyle->SetTitleH(0.07);
        gStyle->SetPadTopMargin(0.08);
        gStyle->SetTitleBorderSize(0);
        gStyle->SetOptStat(0);
        
        N0_sig = n0s*1000.;
        N0_bg = n0b*1000.;


        int i,j;
        double sigl, sigh, bgl, bgh;
        
        TFile *f=new TFile("datafull/M"+pre+"_"+ntp+".root","READ");
        //TFile *f=new TFile(fname,"READ");
        TTree *t=(TTree*)f->Get(ntp);
        
        TEventList els("els");
        TEventList elb("elb");
        
        TCanvas *c1=new TCanvas("c1","c1",10,10,1800,600);
        c1->Divide(6,2);
        
        TObjArray* branches = t->GetListOfBranches();
        
        TString bgcut = "!("+sigcut+")";
        //sigcut+="&&mct";
        TString bstring = precut+" "+sigcut;
        if (precut!="") 
        {
                sigcut+="&&"+precut;
                bgcut +="&&"+precut;
        }
        cout <<sigcut <<" "<<bgcut<<endl;
        t->Draw(">>els",sigcut);
        t->Draw(">>elb",bgcut);
        
        Nsigev = countEvents(t, els);
        Nbgev = countEvents(t, elb);
        
        cout <<"SIG:"<<Nsigev<<" ev  "<<els.GetN()<<" cn   BG:"<<Nbgev<<" ev  "<<elb.GetN()<<" cn"<<endl;

        int cnt=1;
        
        for (i=0;i<MAX;++i) { idx[i]=i; signi[i]=0.;}
        
        for(i=0; i<=branches->GetLast(); ++i)
        {
        
                TBranch* branch = (TBranch*)branches->UncheckedAt(i);
                vars[i]=branch->GetName(); 
                //t->SetBranchStatus(vars[i],1);
                
                if (vars[i]=="ev") continue;
                if (vars[i]=="mode") continue;
                if (vars[i]=="run") continue;
                if (vars[i].Contains("pdg")) continue;
                if (vars[i].Contains("beam")) continue;
                if (vars[i].Contains("mct")) continue;
                if (vars[i].BeginsWith("t") && vars[i]!="thr") continue;
        
                signi[i] = bestSuppressionEvt(t, vars[i], els, elb, cut[i], supr, i);
                
        }
         
        //t->SetBranchStatus("*",1);
        
        cout <<"\n\nBEST 12 vars:"<<endl<<endl;
        
        std::vector<int> myidx (idx, idx+MAX);  
        
        std::sort(myidx.begin(), myidx.end(), mycompare);

        TLine l;
        l.SetLineColor(6);
        l.SetLineStyle(2);
        l.SetLineWidth(2);
        TLatex lt;
        lt.SetTextSize(0.06);
        
        for (j=0;j<12;++j)
        {               
                i=myidx[j];
                cout << vars[i]<<" : qa = "<<signi[i]<<"  cut = "<<cut[i]<<endl;
                if (j<12)
                {
/*                      findLimits(t,vars[i],sigcut, sigl, sigh);
                        findLimits(t,vars[i],bgcut, bgl, bgh);
                                        
                        if (sigl>bgl) sigl=bgl;
                        if (sigh<bgh) sigh=bgh;
                        */
                        TH1F h1("h1",vars[i],200,minh[i],maxh[i]);
                        TH1F h2("h2",vars[i],200,minh[i],maxh[i]);
                        h2.SetLineColor(2);
                
                        t->SetEventList(&els);
                        t->Project("h1",vars[i]);
                        t->SetEventList(&elb);
                        t->Project("h2",vars[i]);
                        
                        h1.Scale(1.0/h1.Integral());
                        h2.Scale(1.0/h2.Integral());
                        h1.SetTitleSize(0.05);
                        
                        c1->cd(j+1);
                        double maxi = h1.GetMaximum();
                        if (h2.GetMaximum()>maxi ) maxi = h2.GetMaximum();
                        maxi*=1.1;
                        h1.SetMaximum(maxi);
                        h2.SetMaximum(maxi);
                                                
                        h1.DrawNormalized();
                        h2.DrawNormalized("same");

                        double axmin = h1.GetXaxis()->GetXmin(),axmax = h1.GetXaxis()->GetXmax(); 
                        
                        l.DrawLine(cut[i],0, cut[i], maxi*0.9);
                        
                        lt.DrawLatex(axmin+(axmax-axmin)*0.6,1.01*maxi,TString::Format("sig = %6.4f",signi[i]));

                        //c1->Update();
                }
                
        }
        
        c1->Update();
        
        float nsig = countEvents(t,els);
        float nbg  = countEvents(t,elb);
        
        cout <<"SIG EVT : "<<nsig<<"    "<<"BG EVT : "<<nbg<<endl;
        cout <<"SIG EFF : "<<nsig/N0_sig<<"    "<<"BG EFF : "<< nbg/N0_bg<<endl;
  return 0;
}

double diffQA	(	TH1F &	ht1,
		TH1F &	ht2
	)

Definition at line 128 of file cutfinder_fullev.C.

References fabs(), h1, h2, i, and n.

{
        int n=ht1.GetNbinsX();
        TH1F h1=ht1;
        TH1F h2=ht2;
        h1.Scale(1.0/h1.Integral());
        h2.Scale(1.0/h2.Integral());
        h1.Add(&h2,-1);
        
        double sum=0.;
        
        for (int i=1;i<=n;++i)
        {
                sum+=fabs(h1.GetBinContent(i));
        }
        
        return sum;
}

void findLimits	(	TTree *	t,
		TString	var,
		TString	ccut,
		double &	low,
		double &	high,
		double	frac = 0.98
	)

Definition at line 500 of file cutfinder_fullev.C.

References htemp, and i.

Referenced by cutfinder(), and drawHistos().

{
        low  = t->GetMinimum(var);
        high = t->GetMaximum(var);
        return;
        
        double miss = (1.-frac)/2;
        
        t->SetEventList(0);
        TEventList el("el");
        t->Draw(">>el",ccut);
        t->SetEventList(&el);
        
        double llow  = t->GetMinimum(var);
        double lhigh = t->GetMaximum(var);

        TH1F htemp("htemp","",500,llow, lhigh);
        t->Project("htemp",var);
        
        double sum=0.;
        double integ = htemp.Integral();
        
        int i=1;
        
        while (sum<miss) sum+=htemp.GetBinContent(i++)/integ;
        low = htemp.GetBinCenter(i-2);
        sum=0.; i=500;
        
        while (sum<miss) sum+=htemp.GetBinContent(i--)/integ;
        high = htemp.GetBinCenter(i+2);
        
        t->SetEventList(0);     
}

bool mycompare	(	int	i,
		int	j
	)

Definition at line 36 of file cutfinder_fullev.C.

References i, and signi.

{
  return signi[i]>signi[j];
}

Variable Documentation

double cut[MAX]

Definition at line 29 of file cutfinder_fullev.C.

std::map<int, int> evcnt

Definition at line 24 of file cutfinder_fullev.C.

int idx[MAX]

Definition at line 27 of file cutfinder_fullev.C.

double maxh[MAX]

Definition at line 31 of file cutfinder_fullev.C.

double minh[MAX]

Definition at line 31 of file cutfinder_fullev.C.

double N0_bg

Definition at line 33 of file cutfinder_fullev.C.

double N0_sig

Definition at line 33 of file cutfinder_fullev.C.

double Nbgev

Definition at line 34 of file cutfinder_fullev.C.

double Nsigev

Definition at line 34 of file cutfinder_fullev.C.

double signi[MAX]

Definition at line 26 of file cutfinder_fullev.C.

TString vars[MAX]

Definition at line 28 of file cutfinder_fullev.C.