[u/mrichter/AliRoot.git] / ITS / AliV0Comparison.C

/****************************************************************************
 *           Very important, delicate and rather obscure macro.             *
 *                                                                          *
 *                  Creates list of "findable" V0s,                         *
 *             calculates efficiency, resolutions etc.                      *
 *                                                                          *
 *   Origin: I.Belikov, IReS, Strasbourg, Jouri.Belikov@cern.ch             *
 ****************************************************************************/

#if !defined(__CINT__) || defined(__MAKECINT__)
  #include "Riostream.h"
  #include <fstream.h>

  #include "AliRun.h"
  #include "AliMC.h"
  #include "AliHeader.h"
  #include "AliRunLoader.h"
  #include "AliITSLoader.h"

  #include "TH1.h"
  #include "TFile.h"
  #include "TKey.h"
  #include "TTree.h"
  #include "TObjArray.h"
  #include "TStyle.h"
  #include "TCanvas.h"
  #include "TLine.h"
  #include "TText.h"
  #include "TParticle.h"
  #include "TStopwatch.h"

  #include "AliRun.h"
  #include "AliESD.h"
  #include "AliV0vertex.h"
#endif

struct GoodVertex {
  Int_t nlab,plab;
  Int_t code;
  Float_t px,py,pz;
  Float_t x,y,z;
};
Int_t good_vertices(GoodVertex *gt, Int_t max);

extern AliRun *gAlice;

Int_t AliV0Comparison(Int_t code=310) { //Lambda=3122, LambdaBar=-3122
   cerr<<"Doing comparison...\n";
   TStopwatch timer;

   /*** Check if the file with the "good" vertices exists ***/
   GoodVertex gv[1000];
   Int_t ngood=0;
   ifstream in("good_vertices");
   if (in) {
      cerr<<"Reading good vertices...\n";
      while (in>>gv[ngood].nlab>>gv[ngood].plab>>gv[ngood].code>>
                 gv[ngood].px>>gv[ngood].py>>gv[ngood].pz>>
                 gv[ngood].x >>gv[ngood].y >>gv[ngood].z) {
         ngood++;
         cerr<<ngood<<'\r';
         if (ngood==1000) {
            cerr<<"Too many good vertices !\n";
            break;
         }
      }
      if (!in.eof()) cerr<<"Read error (good_vertices) !\n";
   } else {
     /*** generate a file with the "good" vertices ***/
      cerr<<"Marking good vertices (this will take a while)...\n";
      ngood=good_vertices(gv,1000);
      ofstream out("good_vertices");
      if (out) {
         for (Int_t ngd=0; ngd<ngood; ngd++)            
	    out<<gv[ngd].nlab<<' '<<gv[ngd].plab<<' '<<gv[ngd].code<<' '<<
                 gv[ngd].px<<' '<<gv[ngd].py<<' '<<gv[ngd].pz<<' '<<
                 gv[ngd].x <<' '<<gv[ngd].y <<' '<<gv[ngd].z <<endl;
      } else cerr<<"Can not open file (good_vertices) !\n";
      out.close();
   }

   
   AliESD *event=0;
   { /*** Load reconstructed vertices ***/
   TFile *ef=TFile::Open("AliESDv0.root");
   if ((!ef)||(!ef->IsOpen())) {
     cerr<<"AliV0Comparison.C: Can't open AliESDv0.root !\n";
     return 1;
   }
   TKey *key=0;
   TIter next(ef->GetListOfKeys());
   if ((key=(TKey*)next())!=0) event=(AliESD*)key->ReadObj();
   ef->Close();
   }
   Int_t nentr=event->GetNumberOfV0s();


   const Double_t V0window=0.05;
   Double_t ptncut=0.13, ptpcut=0.13, kinecut=0.03; 
   Double_t V0mass=0.497672, V0width=0.020;
   switch (code) {
   case kK0Short: 
        break;
   case kLambda0:    
        V0mass=1.115683; V0width=0.015; ptpcut=0.50; kinecut=0.002; 
        break;
   case kLambda0Bar: 
        V0mass=1.115683; V0width=0.015; ptncut=0.50; kinecut=0.002;
        break;
   default: cerr<<"Invalid PDG code !\n"; return 1;
   }

   TH1F *hp=new TH1F("hp","Angular Resolution",30,-30.,30.); //phi resolution 
   hp->SetXTitle("(mrad)"); hp->SetFillColor(2);
   TH1F *hl=new TH1F("hl","Lambda Resolution",30,-30,30);
   hl->SetXTitle("(mrad)"); hl->SetFillColor(1); hl->SetFillStyle(3013); 
   TH1F *hpt=new TH1F("hpt","Relative Pt Resolution",30,-10.,10.); 
   hpt->SetXTitle("(%)"); hpt->SetFillColor(2); 

   TH1F *hx=new TH1F("hx","Position Resolution (X,Y)",30,-3.,3.); //x res. 
   hx->SetXTitle("(mm)"); hx->SetFillColor(6);
   TH1F *hy=new TH1F("hy","Position Resolution (Y)",30,-3.,3.);   //y res
   hy->SetXTitle("(mm)"); hy->SetFillColor(1); hy->SetFillStyle(3013);
   TH1F *hz=new TH1F("hz","Position Resolution (Z)",30,-3.,3.);   //z res. 
   hz->SetXTitle("(mm)"); hz->SetFillColor(6);


   Double_t pmin=0.2, pmax=4.2; Int_t nchan=20;
   TH1F *hgood=new TH1F("hgood","Good Vertices",nchan,pmin,pmax);    
   TH1F *hfound=new TH1F("hfound","Found Vertices",nchan,pmin,pmax);
   TH1F *hfake=new TH1F("hfake","Fake Vertices",nchan,pmin,pmax);
   TH1F *hg=new TH1F("hg","Efficiency for Good Vertices",nchan,pmin,pmax);
   hg->SetLineColor(4); hg->SetLineWidth(2);
   TH1F *hf=new TH1F("hf","Probability of Fake Vertices",nchan,pmin,pmax);
   hf->SetFillColor(1); hf->SetFillStyle(3013); hf->SetLineWidth(2);

   Double_t mmin=V0mass-V0window, mmax=V0mass+V0window;
   TH1F *v0s =new TH1F("v0s","V0s Effective Mass",40, mmin, mmax);
   v0s->SetXTitle("(GeV)");
   v0s->SetLineColor(4); v0s->SetLineWidth(4);
   TH1F *v0sf =new TH1F("v0sf","Fake V0s Effective Mass",40, mmin, mmax);
   v0sf->SetXTitle("(GeV)"); v0sf->SetFillColor(6);


   Double_t pxg=0.,pyg=0.,ptg=0.;
   Int_t nlab=-1, plab=-1;
   Int_t i;
   for (i=0; i<nentr; i++) {
       AliESDv0 *vertex=event->GetV0(i);

       Int_t nidx=TMath::Abs(vertex->GetNindex());
       Int_t pidx=TMath::Abs(vertex->GetPindex());

       AliESDtrack *ntrack=event->GetTrack(nidx);
       AliESDtrack *ptrack=event->GetTrack(pidx);

       nlab=TMath::Abs(ntrack->GetLabel());
       plab=TMath::Abs(ptrack->GetLabel());

       /** Kinematical cuts **/
       Double_t pxn,pyn,pzn; vertex->GetNPxPyPz(pxn,pyn,pzn); 
       Double_t ptn=TMath::Sqrt(pxn*pxn + pyn*pyn);
       if (ptn < ptncut) continue;
       Double_t pxp,pyp,pzp; vertex->GetPPxPyPz(pxp,pyp,pzp); 
       Double_t ptp=TMath::Sqrt(pxp*pxp + pyp*pyp);
       if (ptp < ptpcut) continue;
       Double_t kine=vertex->ChangeMassHypothesis(code);
       //if (TMath::Abs(kine)>kinecut) continue;

       Double_t mass=vertex->GetEffMass();
       v0s->Fill(mass);
       v0sf->Fill(mass);

       Int_t j;
       for (j=0; j<ngood; j++) {
          if (gv[j].code != vertex->GetPdgCode()) continue;
          if (gv[j].nlab == nlab)
          if (gv[j].plab == plab) break;
       }

       if (TMath::Abs(mass-V0mass)>V0width) continue;

       Double_t px,py,pz; vertex->GetPxPyPz(px,py,pz);
       Double_t pt=TMath::Sqrt(px*px+py*py);

       if (j==ngood) {
          hfake->Fill(pt);
          cerr<<"Fake vertex: ("<<nlab<<","<<plab<<")\n";
          continue;
       }
       v0sf->Fill(mass,-1);

       pxg=gv[j].px; pyg=gv[j].py; ptg=TMath::Sqrt(pxg*pxg+pyg*pyg);
       Double_t phig=TMath::ATan2(pyg,pxg), phi=TMath::ATan2(py,px);
       Double_t lamg=TMath::ATan2(gv[j].pz,ptg), lam=TMath::ATan2(pz,pt);
       hp->Fill((phi - phig)*1000.);
       hl->Fill((lam - lamg)*1000.);
       hpt->Fill((1/pt - 1/ptg)/(1/ptg)*100.);

       Double_t x,y,z; vertex->GetXYZ(x,y,z);
       hx->Fill((x-gv[j].x)*10);
       hy->Fill((y-gv[j].y)*10);
       hz->Fill((z-gv[j].z)*10);

       hfound->Fill(ptg);
       gv[j].nlab=-1;

   }
   for (i=0; i<ngood; i++) {
      if (gv[i].code != code) continue;
      pxg=gv[i].px; pyg=gv[i].py; ptg=TMath::Sqrt(pxg*pxg+pyg*pyg);
      hgood->Fill(ptg);
      nlab=gv[i].nlab; plab=gv[i].plab;
      if (nlab < 0) continue;
      cerr<<"Vertex ("<<nlab<<','<<plab<<") has not been found !\n";
   }

   delete event;

   Stat_t ng=hgood->GetEntries();
   Stat_t nf=hfound->GetEntries();

   cerr<<"Number of found vertices: "<<nentr<<" ("<<nf<<" in the peak)\n";
   cerr<<"Number of good vertices: "<<ng<<endl;

   if (ng!=0) 
      cerr<<"Integral efficiency is about "<<nf/ng*100.<<" %\n";

   gStyle->SetOptStat(111110);
   gStyle->SetOptFit(1);

   TCanvas *c1=new TCanvas("c1","",0,0,580,610);
   c1->Divide(2,2);

   c1->cd(1);
   gPad->SetFillColor(42); gPad->SetFrameFillColor(10); 
   //hp->Fit("gaus");
   hp->Draw();
   hl->Draw("same"); c1->cd();

   c1->cd(2);
   gPad->SetFillColor(42); gPad->SetFrameFillColor(10);
   //hpt->Fit("gaus"); c1->cd();
   hpt->Draw(); c1->cd();

   c1->cd(3);
   gPad->SetFillColor(42); gPad->SetFrameFillColor(10); 
   //hx->Fit("gaus"); 
   hx->Draw(); 
   hy->Draw("same"); c1->cd();

   c1->cd(4);
   gPad->SetFillColor(42); gPad->SetFrameFillColor(10);
   //hz->Fit("gaus");
   hz->Draw();


   TCanvas *c2=new TCanvas("c2","",600,0,580,610);
   c2->Divide(1,2);

   c2->cd(1);
   gPad->SetFillColor(42); gPad->SetFrameFillColor(10);
   hfound->Sumw2(); hgood->Sumw2(); hfake->Sumw2();
   hg->Divide(hfound,hgood,1,1.,"b");
   hf->Divide(hfake,hgood,1,1.,"b");
   hg->SetMaximum(1.4);
   hg->SetYTitle("V0 reconstruction efficiency");
   hg->SetXTitle("Pt (GeV/c)");
   hg->Draw();

   TLine *line1 = new TLine(pmin,1.0,pmax,1.0); line1->SetLineStyle(4);
   line1->Draw("same");
   TLine *line2 = new TLine(pmin,0.9,pmax,0.9); line2->SetLineStyle(4);
   line2->Draw("same");

   hf->SetFillColor(1);
   hf->SetFillStyle(3013);
   hf->SetLineColor(2);
   hf->SetLineWidth(2);
   hf->Draw("histsame");
   TText *text = new TText(0.461176,0.248448,"Fake vertices");
   text->SetTextSize(0.05);
   text->Draw();
   text = new TText(0.453919,1.11408,"Good vertices");
   text->SetTextSize(0.05);
   text->Draw();


   c2->cd(2);
   gPad->SetFillColor(42); gPad->SetFrameFillColor(10);
   //v0s->Fit("gaus","","",V0mass-V0width,V0mass+V0width);
   v0s->Draw();
   v0sf->Draw("same");
   Double_t max=v0s->GetMaximum();
   TLine *line3 = new TLine(V0mass-V0width,0.,V0mass-V0width,max);
   line3->Draw("same");
   TLine *line4 = new TLine(V0mass+V0width,0.,V0mass+V0width,max);
   line4->Draw("same");

   timer.Stop(); timer.Print();

   return 0;
}

Int_t good_vertices(GoodVertex *gv, Int_t max) {
   Int_t nv=0;
   /*** Get information about the cuts ***/
   Double_t r2min=0.9*0.9;
   Double_t r2max=2.9*2.9;

   /*** Get labels of the "good" tracks ***/
   Double_t dd; Int_t id, label[15000], ngt=0;
   ifstream in("good_tracks_its");
   if (!in) {
     cerr<<"Can't open the file good_tracks_its \n";
     return nv;
   }
   while (in>>label[ngt]>>id>>dd>>dd>>dd>>dd>>dd>>dd) {
     ngt++;
     if (ngt>=15000) {
       cerr<<"Too many good ITS tracks !\n";
       return nv;
     }
   }   
   if (!in.eof()) {
      cerr<<"Read error (good_tracks_its) !\n";
      return nv;
   }

   /*** Get an access to the kinematics ***/
   if (gAlice) {
      delete gAlice->GetRunLoader();
      delete gAlice; 
      gAlice=0;
   }   
   AliRunLoader *rl = AliRunLoader::Open("galice.root");
   if (!rl) {
       cerr<<"AliV0Comparison.C, good_vertices :Can't start session !\n";
       return 1;
   }

   rl->LoadgAlice();
   rl->LoadHeader();
   rl->LoadKinematics();
   Int_t np = rl->GetHeader()->GetNtrack();

   while (np--) {
      cerr<<np<<'\r';
      TParticle *p0=gAlice->GetMCApp()->Particle(np);

      /*** only these V0s are "good" ***/
      Int_t code=p0->GetPdgCode();
      if (code!=kK0Short)
      if (code!=kLambda0)
      if (code!=kLambda0Bar) continue; 

      /*** daughter tracks should be "good" ***/
      Int_t plab=p0->GetFirstDaughter(), nlab=p0->GetLastDaughter();
      if (nlab==plab) continue;
      if (nlab<0) continue;
      if (plab<0) continue;
      Int_t i;
      for (i=0; i<ngt; i++) if (label[i]==nlab) break;
      if (i==ngt) continue;
      for (i=0; i<ngt; i++) if (label[i]==plab) break;
      if (i==ngt) continue;

      /*** fiducial volume ***/
      TParticle *p=gAlice->GetMCApp()->Particle(nlab);
      Double_t x=p->Vx(), y=p->Vy(), z=p->Vz(), r2=x*x+y*y;
      if (r2<r2min) continue;
      if (r2>r2max) continue;
       
      if (gAlice->GetMCApp()->Particle(plab)->GetPDG()->Charge() < 0.) {
         i=plab; plab=nlab; nlab=i;
      }
      
      gv[nv].code=code;
      gv[nv].plab=plab; gv[nv].nlab=nlab;
      gv[nv].px=p0->Px(); gv[nv].py=p0->Py(); gv[nv].pz=p0->Pz();
      gv[nv].x=x; gv[nv].y=y; gv[nv].z=z;
      nv++;
   }
 
   delete rl;

   return nv;
}
Commit	Line	Data
ca28c5f5	1	/****************************************************************************
	2	* Very important, delicate and rather obscure macro. *
	3	* *
	4	* Creates list of "findable" V0s, *
	5	* calculates efficiency, resolutions etc. *
	6	* *
	7	* Origin: I.Belikov, IReS, Strasbourg, Jouri.Belikov@cern.ch *
	8	****************************************************************************/
	9
566abf75	10	#if !defined(__CINT__) \|\| defined(__MAKECINT__)
548b1270	11	#include "Riostream.h"
ca28c5f5	12	#include <fstream.h>
ca28c5f5	13
566abf75	14	#include "AliRun.h"
5102bab6	15	#include "AliMC.h"
566abf75	16	#include "AliHeader.h"
	17	#include "AliRunLoader.h"
	18	#include "AliITSLoader.h"
	19
ca28c5f5	20	#include "TH1.h"
ca28c5f5	21	#include "TFile.h"
5102bab6	22	#include "TKey.h"
ca28c5f5	23	#include "TTree.h"
	24	#include "TObjArray.h"
	25	#include "TStyle.h"
	26	#include "TCanvas.h"
	27	#include "TLine.h"
	28	#include "TText.h"
	29	#include "TParticle.h"
	30	#include "TStopwatch.h"
	31
	32	#include "AliRun.h"
5102bab6	33	#include "AliESD.h"
ca28c5f5	34	#include "AliV0vertex.h"
	35	#endif
	36
	37	struct GoodVertex {
	38	Int_t nlab,plab;
	39	Int_t code;
	40	Float_t px,py,pz;
	41	Float_t x,y,z;
	42	};
	43	Int_t good_vertices(GoodVertex *gt, Int_t max);
	44
566abf75	45	extern AliRun *gAlice;
566abf75	46
ca28c5f5	47	Int_t AliV0Comparison(Int_t code=310) { //Lambda=3122, LambdaBar=-3122
ca28c5f5	48	cerr<<"Doing comparison...\n";
566abf75	49	TStopwatch timer;
566abf75	50
5102bab6	51	/* Check if the file with the "good" vertices exists */
	52	GoodVertex gv[1000];
	53	Int_t ngood=0;
	54	ifstream in("good_vertices");
	55	if (in) {
	56	cerr<<"Reading good vertices...\n";
	57	while (in>>gv[ngood].nlab>>gv[ngood].plab>>gv[ngood].code>>
	58	gv[ngood].px>>gv[ngood].py>>gv[ngood].pz>>
	59	gv[ngood].x >>gv[ngood].y >>gv[ngood].z) {
	60	ngood++;
	61	cerr<<ngood<<'\r';
	62	if (ngood==1000) {
	63	cerr<<"Too many good vertices !\n";
	64	break;
	65	}
	66	}
	67	if (!in.eof()) cerr<<"Read error (good_vertices) !\n";
	68	} else {
	69	/* generate a file with the "good" vertices */
	70	cerr<<"Marking good vertices (this will take a while)...\n";
	71	ngood=good_vertices(gv,1000);
	72	ofstream out("good_vertices");
	73	if (out) {
	74	for (Int_t ngd=0; ngd<ngood; ngd++)
	75	out<<gv[ngd].nlab<<' '<<gv[ngd].plab<<' '<<gv[ngd].code<<' '<<
	76	gv[ngd].px<<' '<<gv[ngd].py<<' '<<gv[ngd].pz<<' '<<
	77	gv[ngd].x <<' '<<gv[ngd].y <<' '<<gv[ngd].z <<endl;
	78	} else cerr<<"Can not open file (good_vertices) !\n";
	79	out.close();
	80	}
	81
	82
	83	AliESD *event=0;
	84	{ /* Load reconstructed vertices */
	85	TFile *ef=TFile::Open("AliESDv0.root");
	86	if ((!ef)\|\|(!ef->IsOpen())) {
	87	cerr<<"AliV0Comparison.C: Can't open AliESDv0.root !\n";
	88	return 1;
	89	}
	90	TKey *key=0;
	91	TIter next(ef->GetListOfKeys());
	92	if ((key=(TKey)next())!=0) event=(AliESD)key->ReadObj();
	93	ef->Close();
	94	}
	95	Int_t nentr=event->GetNumberOfV0s();
	96
	97
04b2a5f1	98	const Double_t V0window=0.05;
	99	Double_t ptncut=0.13, ptpcut=0.13, kinecut=0.03;
	100	Double_t V0mass=0.497672, V0width=0.020;
ca28c5f5	101	switch (code) {
04b2a5f1	102	case kK0Short:
	103	break;
	104	case kLambda0:
	105	V0mass=1.115683; V0width=0.015; ptpcut=0.50; kinecut=0.002;
	106	break;
	107	case kLambda0Bar:
	108	V0mass=1.115683; V0width=0.015; ptncut=0.50; kinecut=0.002;
	109	break;
ca28c5f5	110	default: cerr<<"Invalid PDG code !\n"; return 1;
	111	}
	112
566abf75	113	TH1F *hp=new TH1F("hp","Angular Resolution",30,-30.,30.); //phi resolution
	114	hp->SetXTitle("(mrad)"); hp->SetFillColor(2);
	115	TH1F *hl=new TH1F("hl","Lambda Resolution",30,-30,30);
	116	hl->SetXTitle("(mrad)"); hl->SetFillColor(1); hl->SetFillStyle(3013);
	117	TH1F *hpt=new TH1F("hpt","Relative Pt Resolution",30,-10.,10.);
	118	hpt->SetXTitle("(%)"); hpt->SetFillColor(2);
	119
	120	TH1F *hx=new TH1F("hx","Position Resolution (X,Y)",30,-3.,3.); //x res.
	121	hx->SetXTitle("(mm)"); hx->SetFillColor(6);
	122	TH1F *hy=new TH1F("hy","Position Resolution (Y)",30,-3.,3.); //y res
	123	hy->SetXTitle("(mm)"); hy->SetFillColor(1); hy->SetFillStyle(3013);
	124	TH1F *hz=new TH1F("hz","Position Resolution (Z)",30,-3.,3.); //z res.
	125	hz->SetXTitle("(mm)"); hz->SetFillColor(6);
	126
	127
	128	Double_t pmin=0.2, pmax=4.2; Int_t nchan=20;
	129	TH1F *hgood=new TH1F("hgood","Good Vertices",nchan,pmin,pmax);
	130	TH1F *hfound=new TH1F("hfound","Found Vertices",nchan,pmin,pmax);
	131	TH1F *hfake=new TH1F("hfake","Fake Vertices",nchan,pmin,pmax);
	132	TH1F *hg=new TH1F("hg","Efficiency for Good Vertices",nchan,pmin,pmax);
	133	hg->SetLineColor(4); hg->SetLineWidth(2);
	134	TH1F *hf=new TH1F("hf","Probability of Fake Vertices",nchan,pmin,pmax);
	135	hf->SetFillColor(1); hf->SetFillStyle(3013); hf->SetLineWidth(2);
	136
	137	Double_t mmin=V0mass-V0window, mmax=V0mass+V0window;
	138	TH1F *v0s =new TH1F("v0s","V0s Effective Mass",40, mmin, mmax);
	139	v0s->SetXTitle("(GeV)");
	140	v0s->SetLineColor(4); v0s->SetLineWidth(4);
	141	TH1F *v0sf =new TH1F("v0sf","Fake V0s Effective Mass",40, mmin, mmax);
	142	v0sf->SetXTitle("(GeV)"); v0sf->SetFillColor(6);
	143
	144
ca28c5f5	145	Double_t pxg=0.,pyg=0.,ptg=0.;
	146	Int_t nlab=-1, plab=-1;
	147	Int_t i;
	148	for (i=0; i<nentr; i++) {
5102bab6	149	AliESDv0 *vertex=event->GetV0(i);
	150
	151	Int_t nidx=TMath::Abs(vertex->GetNindex());
	152	Int_t pidx=TMath::Abs(vertex->GetPindex());
	153
	154	AliESDtrack *ntrack=event->GetTrack(nidx);
	155	AliESDtrack *ptrack=event->GetTrack(pidx);
	156
	157	nlab=TMath::Abs(ntrack->GetLabel());
	158	plab=TMath::Abs(ptrack->GetLabel());
ca28c5f5	159
04b2a5f1	160	/ Kinematical cuts /
	161	Double_t pxn,pyn,pzn; vertex->GetNPxPyPz(pxn,pyn,pzn);
	162	Double_t ptn=TMath::Sqrt(pxnpxn + pynpyn);
	163	if (ptn < ptncut) continue;
	164	Double_t pxp,pyp,pzp; vertex->GetPPxPyPz(pxp,pyp,pzp);
	165	Double_t ptp=TMath::Sqrt(pxppxp + pyppyp);
	166	if (ptp < ptpcut) continue;
	167	Double_t kine=vertex->ChangeMassHypothesis(code);
	168	//if (TMath::Abs(kine)>kinecut) continue;
ca28c5f5	169
	170	Double_t mass=vertex->GetEffMass();
	171	v0s->Fill(mass);
04b2a5f1	172	v0sf->Fill(mass);
ca28c5f5	173
	174	Int_t j;
	175	for (j=0; j<ngood; j++) {
	176	if (gv[j].code != vertex->GetPdgCode()) continue;
	177	if (gv[j].nlab == nlab)
	178	if (gv[j].plab == plab) break;
	179	}
	180
	181	if (TMath::Abs(mass-V0mass)>V0width) continue;
	182
	183	Double_t px,py,pz; vertex->GetPxPyPz(px,py,pz);
	184	Double_t pt=TMath::Sqrt(pxpx+pypy);
	185
	186	if (j==ngood) {
	187	hfake->Fill(pt);
	188	cerr<<"Fake vertex: ("<<nlab<<","<<plab<<")\n";
	189	continue;
	190	}
04b2a5f1	191	v0sf->Fill(mass,-1);
ca28c5f5	192
	193	pxg=gv[j].px; pyg=gv[j].py; ptg=TMath::Sqrt(pxgpxg+pygpyg);
	194	Double_t phig=TMath::ATan2(pyg,pxg), phi=TMath::ATan2(py,px);
	195	Double_t lamg=TMath::ATan2(gv[j].pz,ptg), lam=TMath::ATan2(pz,pt);
	196	hp->Fill((phi - phig)*1000.);
	197	hl->Fill((lam - lamg)*1000.);
	198	hpt->Fill((1/pt - 1/ptg)/(1/ptg)*100.);
	199
	200	Double_t x,y,z; vertex->GetXYZ(x,y,z);
	201	hx->Fill((x-gv[j].x)*10);
	202	hy->Fill((y-gv[j].y)*10);
	203	hz->Fill((z-gv[j].z)*10);
	204
	205	hfound->Fill(ptg);
	206	gv[j].nlab=-1;
	207
	208	}
	209	for (i=0; i<ngood; i++) {
	210	if (gv[i].code != code) continue;
	211	pxg=gv[i].px; pyg=gv[i].py; ptg=TMath::Sqrt(pxgpxg+pygpyg);
	212	hgood->Fill(ptg);
	213	nlab=gv[i].nlab; plab=gv[i].plab;
	214	if (nlab < 0) continue;
	215	cerr<<"Vertex ("<<nlab<<','<<plab<<") has not been found !\n";
	216	}
	217
5102bab6	218	delete event;
ca28c5f5	219
	220	Stat_t ng=hgood->GetEntries();
	221	Stat_t nf=hfound->GetEntries();
	222
	223	cerr<<"Number of found vertices: "<<nentr<<" ("<<nf<<" in the peak)\n";
	224	cerr<<"Number of good vertices: "<<ng<<endl;
	225
	226	if (ng!=0)
	227	cerr<<"Integral efficiency is about "<<nf/ng*100.<<" %\n";
	228
	229	gStyle->SetOptStat(111110);
	230	gStyle->SetOptFit(1);
	231
	232	TCanvas *c1=new TCanvas("c1","",0,0,580,610);
	233	c1->Divide(2,2);
	234
	235	c1->cd(1);
	236	gPad->SetFillColor(42); gPad->SetFrameFillColor(10);
	237	//hp->Fit("gaus");
	238	hp->Draw();
	239	hl->Draw("same"); c1->cd();
	240
	241	c1->cd(2);
	242	gPad->SetFillColor(42); gPad->SetFrameFillColor(10);
	243	//hpt->Fit("gaus"); c1->cd();
	244	hpt->Draw(); c1->cd();
	245
	246	c1->cd(3);
	247	gPad->SetFillColor(42); gPad->SetFrameFillColor(10);
	248	//hx->Fit("gaus");
	249	hx->Draw();
	250	hy->Draw("same"); c1->cd();
	251
	252	c1->cd(4);
	253	gPad->SetFillColor(42); gPad->SetFrameFillColor(10);
	254	//hz->Fit("gaus");
	255	hz->Draw();
	256
	257
	258	TCanvas *c2=new TCanvas("c2","",600,0,580,610);
	259	c2->Divide(1,2);
	260
	261	c2->cd(1);
	262	gPad->SetFillColor(42); gPad->SetFrameFillColor(10);
	263	hfound->Sumw2(); hgood->Sumw2(); hfake->Sumw2();
	264	hg->Divide(hfound,hgood,1,1.,"b");
	265	hf->Divide(hfake,hgood,1,1.,"b");
	266	hg->SetMaximum(1.4);
	267	hg->SetYTitle("V0 reconstruction efficiency");
	268	hg->SetXTitle("Pt (GeV/c)");
	269	hg->Draw();
	270
	271	TLine *line1 = new TLine(pmin,1.0,pmax,1.0); line1->SetLineStyle(4);
	272	line1->Draw("same");
	273	TLine *line2 = new TLine(pmin,0.9,pmax,0.9); line2->SetLineStyle(4);
	274	line2->Draw("same");
	275
	276	hf->SetFillColor(1);
	277	hf->SetFillStyle(3013);
	278	hf->SetLineColor(2);
	279	hf->SetLineWidth(2);
	280	hf->Draw("histsame");
	281	TText *text = new TText(0.461176,0.248448,"Fake vertices");
	282	text->SetTextSize(0.05);
283	text->Draw();
284	text = new TText(0.453919,1.11408,"Good vertices");
285	text->SetTextSize(0.05);
286	text->Draw();
287
288
289	c2->cd(2);
290	gPad->SetFillColor(42); gPad->SetFrameFillColor(10);
04b2a5f1	291	//v0s->Fit("gaus","","",V0mass-V0width,V0mass+V0width);
	292	v0s->Draw();
	293	v0sf->Draw("same");
ca28c5f5	294	Double_t max=v0s->GetMaximum();
	295	TLine *line3 = new TLine(V0mass-V0width,0.,V0mass-V0width,max);
	296	line3->Draw("same");
	297	TLine *line4 = new TLine(V0mass+V0width,0.,V0mass+V0width,max);
	298	line4->Draw("same");
	299
	300	timer.Stop(); timer.Print();
	301
	302	return 0;
	303	}
	304
	305	Int_t good_vertices(GoodVertex *gv, Int_t max) {
	306	Int_t nv=0;
	307	/* Get information about the cuts */
	308	Double_t r2min=0.9*0.9;
	309	Double_t r2max=2.9*2.9;
	310
	311	/* Get labels of the "good" tracks */
	312	Double_t dd; Int_t id, label[15000], ngt=0;
	313	ifstream in("good_tracks_its");
	314	if (!in) {
	315	cerr<<"Can't open the file good_tracks_its \n";
	316	return nv;
	317	}
	318	while (in>>label[ngt]>>id>>dd>>dd>>dd>>dd>>dd>>dd) {
	319	ngt++;
	320	if (ngt>=15000) {
	321	cerr<<"Too many good ITS tracks !\n";
	322	return nv;
	323	}
	324	}
	325	if (!in.eof()) {
	326	cerr<<"Read error (good_tracks_its) !\n";
	327	return nv;
	328	}
	329
	330	/* Get an access to the kinematics */
5102bab6	331	if (gAlice) {
	332	delete gAlice->GetRunLoader();
	333	delete gAlice;
	334	gAlice=0;
	335	}
	336	AliRunLoader *rl = AliRunLoader::Open("galice.root");
	337	if (!rl) {
	338	cerr<<"AliV0Comparison.C, good_vertices :Can't start session !\n";
566abf75	339	return 1;
ca28c5f5	340	}
5102bab6	341
566abf75	342	rl->LoadgAlice();
	343	rl->LoadHeader();
	344	rl->LoadKinematics();
	345	Int_t np = rl->GetHeader()->GetNtrack();
ca28c5f5	346
ca28c5f5	347	while (np--) {
ca28c5f5	348	cerr<<np<<'\r';
0555741a	349	TParticle *p0=gAlice->GetMCApp()->Particle(np);
ca28c5f5	350
	351	/* only these V0s are "good" */
	352	Int_t code=p0->GetPdgCode();
	353	if (code!=kK0Short)
	354	if (code!=kLambda0)
	355	if (code!=kLambda0Bar) continue;
	356
	357	/* daughter tracks should be "good" */
	358	Int_t plab=p0->GetFirstDaughter(), nlab=p0->GetLastDaughter();
	359	if (nlab==plab) continue;
	360	if (nlab<0) continue;
	361	if (plab<0) continue;
	362	Int_t i;
	363	for (i=0; i<ngt; i++) if (label[i]==nlab) break;
	364	if (i==ngt) continue;
	365	for (i=0; i<ngt; i++) if (label[i]==plab) break;
	366	if (i==ngt) continue;
	367
	368	/* fiducial volume */
0555741a	369	TParticle *p=gAlice->GetMCApp()->Particle(nlab);
ca28c5f5	370	Double_t x=p->Vx(), y=p->Vy(), z=p->Vz(), r2=xx+yy;
	371	if (r2<r2min) continue;
	372	if (r2>r2max) continue;
	373
0555741a	374	if (gAlice->GetMCApp()->Particle(plab)->GetPDG()->Charge() < 0.) {
ca28c5f5	375	i=plab; plab=nlab; nlab=i;
	376	}
	377
	378	gv[nv].code=code;
	379	gv[nv].plab=plab; gv[nv].nlab=nlab;
	380	gv[nv].px=p0->Px(); gv[nv].py=p0->Py(); gv[nv].pz=p0->Pz();
	381	gv[nv].x=x; gv[nv].y=y; gv[nv].z=z;
	382	nv++;
	383	}
	384
566abf75	385	delete rl;
ca28c5f5	386
	387	return nv;
	388	}