[u/mrichter/AliRoot.git] / ITS / AliITSVertexerZ.cxx

/**************************************************************************
 * Copyright(c) 1998-2003, ALICE Experiment at CERN, All rights reserved. *
 *                                                                        *
 * Author: The ALICE Off-line Project.                                    *
 * Contributors are mentioned in the code where appropriate.              *
 *                                                                        *
 * Permission to use, copy, modify and distribute this software and its   *
 * documentation strictly for non-commercial purposes is hereby granted   *
 * without fee, provided that the above copyright notice appears in all   *
 * copies and that both the copyright notice and this permission notice   *
 * appear in the supporting documentation. The authors make no claims     *
 * about the suitability of this software for any purpose. It is          *
 * provided "as is" without express or implied warranty.                  *
 **************************************************************************/
#include "AliITSVertexerZ.h"
#include<TBranch.h>
#include<TH1.h>
#include <TString.h>
#include<TTree.h>
#include "AliITSLoader.h"
#include "AliITSgeom.h"
#include "AliITSDetTypeRec.h"
#include "AliITSRecPoint.h"

/////////////////////////////////////////////////////////////////
// this class implements a fast method to determine
// the Z coordinate of the primary vertex
// for p-p collisions it seems to give comparable or better results
// with respect to what obtained with AliITSVertexerPPZ
// It can be used successfully with Pb-Pb collisions
////////////////////////////////////////////////////////////////

ClassImp(AliITSVertexerZ)


//______________________________________________________________________
AliITSVertexerZ::AliITSVertexerZ():AliITSVertexer() {
  // Default constructor
  SetDiffPhiMax(0);
  fX0 = 0.;
  fY0 = 0.;
  SetFirstLayerModules(0);
  SetSecondLayerModules(0);
  fZFound = 0;
  fZsig = 0.;
  fZCombc = 0;
  fZCombf = 0;
  fZCombv = 0;
  SetLowLimit(0.);
  SetHighLimit(0.);
  SetBinWidthCoarse(0.);
  SetBinWidthFine(0.);
  SetTolerance(0.);
  SetPPsetting(0.,0.);
  ConfigIterations();
}

//______________________________________________________________________
AliITSVertexerZ::AliITSVertexerZ(TString fn, Float_t x0, Float_t y0):AliITSVertexer(fn) {
  // Standard Constructor
  SetDiffPhiMax();
  fX0 = x0;
  fY0 = y0;
  SetFirstLayerModules();
  SetSecondLayerModules();
  fZFound = 0;
  fZsig = 0.;
  fZCombc = 0;
  fZCombf = 0;
  fZCombv = 0;
  SetLowLimit();
  SetHighLimit();
  SetBinWidthCoarse();
  SetBinWidthFine();
  SetTolerance();
  SetPPsetting();
  ConfigIterations();

}

//______________________________________________________________________
AliITSVertexerZ::AliITSVertexerZ(const AliITSVertexerZ &vtxr) : AliITSVertexer(vtxr) {
  // Copy constructor
  // Copies are not allowed. The method is protected to avoid misuse.
  Error("AliITSVertexerZ","Copy constructor not allowed\n");
}

//______________________________________________________________________
AliITSVertexerZ& AliITSVertexerZ::operator=(const AliITSVertexerZ& /* vtxr */){
  // Assignment operator
  // Assignment is not allowed. The method is protected to avoid misuse.
  Error("= operator","Assignment operator not allowed\n");
  return *this;
}

//______________________________________________________________________
AliITSVertexerZ::~AliITSVertexerZ() {
  // Destructor
  delete fZCombc;
  delete fZCombf;
  delete fZCombv;
}

//______________________________________________________________________
void AliITSVertexerZ::ConfigIterations(Int_t noiter,Float_t *ptr){
  // configure the iterative procedure to gain efficiency for
  // pp events with very low multiplicity
  Float_t defaults[5]={0.05,0.1,0.2,0.3,0.5};
  fMaxIter=noiter;
  if(noiter>5){
    Error("ConfigIterations","Maximum number of iterations is 5\n");
    fMaxIter=5;
  }
  for(Int_t j=0;j<5;j++)fPhiDiffIter[j]=defaults[j];
  if(ptr)for(Int_t j=0;j<fMaxIter;j++)fPhiDiffIter[j]=ptr[j];
}

//______________________________________________________________________
AliESDVertex* AliITSVertexerZ::FindVertexForCurrentEvent(Int_t evnumber){
  // Defines the AliESDVertex for the current event
  VertexZFinder(evnumber);
  Int_t ntrackl=0;
  for(Int_t iteraz=0;iteraz<fMaxIter;iteraz++){
    if(fCurrentVertex) ntrackl=fCurrentVertex->GetNContributors();
    if(!fCurrentVertex || ntrackl==0 || ntrackl==-1){
      Float_t diffPhiMaxOrig=fDiffPhiMax;
      fDiffPhiMax=GetPhiMaxIter(iteraz);
      VertexZFinder(evnumber);
      fDiffPhiMax=diffPhiMaxOrig;
    }
  }
  FindMultiplicity(evnumber);
  return fCurrentVertex;
}  


//______________________________________________________________________
void AliITSVertexerZ::VertexZFinder(Int_t evnumber){
  // Defines the AliESDVertex for the current event
  fCurrentVertex = 0;
  AliRunLoader *rl =AliRunLoader::GetRunLoader();
  AliITSLoader* itsLoader = (AliITSLoader*)rl->GetLoader("ITSLoader");
  AliITSgeom* geom = itsLoader->GetITSgeom();
  itsLoader->LoadRecPoints();
  rl->GetEvent(evnumber);

  AliITSDetTypeRec detTypeRec;

  TTree *tR = itsLoader->TreeR();
  detTypeRec.SetTreeAddressR(tR);
  TClonesArray *itsRec  = 0;
  // lc and gc are local and global coordinates for layer 1
  Float_t lc[3]; for(Int_t ii=0; ii<3; ii++) lc[ii]=0.;
  Float_t gc[3]; for(Int_t ii=0; ii<3; ii++) gc[ii]=0.;
  // lc2 and gc2 are local and global coordinates for layer 2
  Float_t lc2[3]; for(Int_t ii=0; ii<3; ii++) lc2[ii]=0.;
  Float_t gc2[3]; for(Int_t ii=0; ii<3; ii++) gc2[ii]=0.;

  itsRec = detTypeRec.RecPoints();
  TBranch *branch;
  branch = tR->GetBranch("ITSRecPoints");

  Int_t nrpL1 = 0;
  Int_t nrpL2 = 0;
  // By default fFirstL1=0 and fLastL1=79
  // This loop counts the number of recpoints on layer1 (central modules)
  for(Int_t module= fFirstL1; module<=fLastL1;module++){
    // Keep only central modules
    if(module%4==0 || module%4==3)continue;
    //   cout<<"Procesing module "<<module<<" ";
    branch->GetEvent(module);
    //    cout<<"Number of clusters "<<clusters->GetEntries()<<endl;
    nrpL1+= itsRec->GetEntries();
    detTypeRec.ResetRecPoints();
  }
  //By default fFirstL2=80 and fLastL2=239
  //This loop counts the number of RP on layer 2
  for(Int_t module= fFirstL2; module<=fLastL2;module++){
    branch->GetEvent(module);
    nrpL2+= itsRec->GetEntries();
    detTypeRec.ResetRecPoints();
  }
  if(nrpL1 == 0 || nrpL2 == 0){
    ResetHistograms();
    itsLoader->UnloadRecPoints();
    fCurrentVertex = new AliESDVertex(0.,5.3,-2);
    return;
  }
  // The vertex finding is attempted only if the number of RP is !=0 on
  // both layers
  Float_t *xc1 = new Float_t [nrpL1]; // coordinates of the L1 Recpoints
  Float_t *yc1 = new Float_t [nrpL1];
  Float_t *zc1 = new Float_t [nrpL1];
  Float_t *phi1 = new Float_t [nrpL1];
  Float_t *xc2 = new Float_t [nrpL2]; // coordinates of the L1 Recpoints
  Float_t *yc2 = new Float_t [nrpL2];
  Float_t *zc2 = new Float_t [nrpL2];
  Float_t *phi2 = new Float_t [nrpL2];
  Int_t ind = 0;// running index for RP
  // Force a coarse bin size of 200 microns if the number of clusters on layer 2
  // is low
  if(nrpL2<fPPsetting[0])SetBinWidthCoarse(fPPsetting[1]);
  // By default nbinfine = (10+10)/0.0005=40000
  Int_t nbinfine = static_cast<Int_t>((fHighLim-fLowLim)/fStepFine);
  // By default nbincoarse=(10+10)/0.01=2000
  Int_t nbincoarse = static_cast<Int_t>((fHighLim-fLowLim)/fStepCoarse);
  // Set stepverycoarse = 3*fStepCoarse
  Int_t nbinvcoarse = static_cast<Int_t>((fHighLim-fLowLim)/(3.*fStepCoarse));
  if(fZCombc)delete fZCombc;
  fZCombc = new TH1F("fZCombc","Z",nbincoarse,fLowLim,fLowLim+nbincoarse*fStepCoarse);
  if(fZCombv)delete fZCombv;
  fZCombv = new TH1F("fZCombv","Z",nbinvcoarse,fLowLim,fLowLim+nbinvcoarse*3.*fStepCoarse);
  if(fZCombf)delete fZCombf;
  fZCombf = new TH1F("fZCombf","Z",nbinfine,fLowLim,fLowLim+nbinfine*fStepFine);
  // Loop on modules of layer 1 (restricted to central modules)
  for(Int_t module= fFirstL1; module<=fLastL1;module++){
    if(module%4==0 || module%4==3)continue;
    branch->GetEvent(module);
    Int_t nrecp1 = itsRec->GetEntries();
    for(Int_t j=0;j<nrecp1;j++){
      AliITSRecPoint *recp = (AliITSRecPoint*)itsRec->At(j);
      // Local coordinates of this recpoint
      lc[0]=recp->GetDetLocalX();
      lc[2]=recp->GetDetLocalZ();
      geom->LtoG(module,lc,gc);
      // Global coordinates of this recpoints
      gc[0]-=fX0; // Possible beam offset in the bending plane
      gc[1]-=fY0; //   "               "
      xc1[ind]=gc[0];
      yc1[ind]=gc[1];
      zc1[ind]=gc[2];
      // azimuthal angle is computed in the interval 0 --> 2*pi
      phi1[ind] = TMath::ATan2(gc[1],gc[0]);
      if(phi1[ind]<0)phi1[ind]=2*TMath::Pi()+phi1[ind];
      ind++;
    }
    detTypeRec.ResetRecPoints();
  }
  ind = 0; // the running index is reset for Layer 2
  for(Int_t module= fFirstL2; module<=fLastL2;module++){
    branch->GetEvent(module);
    Int_t nrecp2 = itsRec->GetEntries();
    for(Int_t j=0;j<nrecp2;j++){
      AliITSRecPoint *recp = (AliITSRecPoint*)itsRec->At(j);
      lc[0]=recp->GetDetLocalX();
      lc[2]=recp->GetDetLocalZ();
      geom->LtoG(module,lc,gc);
      gc[0]-=fX0;
      gc[1]-=fY0;
      xc2[ind]=gc[0];
      yc2[ind]=gc[1];
      zc2[ind]=gc[2];
      phi2[ind] = TMath::ATan2(gc[1],gc[0]);
      if(phi2[ind]<0)phi2[ind]=2*TMath::Pi()+phi2[ind];
      ind++;
    }
    detTypeRec.ResetRecPoints();
  }
 
  Int_t nolines=0;
  for(Int_t i=0;i<nrpL1;i++){ // loop on L1 RP
    Float_t r1=TMath::Sqrt(xc1[i]*xc1[i]+yc1[i]*yc1[i]); // radius L1 RP
    for(Int_t j=0;j<nrpL2;j++){ // loop on L2 RP
      Float_t diff = TMath::Abs(phi2[j]-phi1[i]); // diff in azimuth
      if(diff>TMath::Pi())diff=2.*TMath::Pi()-diff; //diff<pi
      if(diff<fDiffPhiMax){ // cut on 10 milliradians by def.
	Float_t r2=TMath::Sqrt(xc2[j]*xc2[j]+yc2[j]*yc2[j]); // radius L2 RP
	Float_t zr0=(r2*zc1[i]-r1*zc2[j])/(r2-r1); //Z @ null radius
	fZCombf->Fill(zr0);
	fZCombc->Fill(zr0);
	fZCombv->Fill(zr0);
	Double_t pA[3];
	Double_t pB[3];
	pA[0]=xc1[i];
	pA[1]=yc1[i];
	pA[2]=zc1[i];
	pB[0]=xc2[j];
	pB[1]=yc2[j];
	pB[2]=zc2[j];
	MakeTracklet(pA,pB,nolines);
      }
    }
  }
  delete [] xc1;
  delete [] yc1;
  delete [] zc1;
  delete [] phi1;
  delete [] xc2;
  delete [] yc2;
  delete [] zc2;
  delete [] phi2;
  Double_t contents = fZCombc->GetEntries()- fZCombc->GetBinContent(0)-fZCombc->GetBinContent(nbincoarse+1);
  if(contents<1.){
    //    Warning("FindVertexForCurrentEvent","Insufficient number of rec. points\n");
    ResetHistograms();
    itsLoader->UnloadRecPoints();
    fCurrentVertex = new AliESDVertex(0.,5.3,-1);
    return;
  }
  /*
  else {
    if(fDebug>0)cout<<"Number of entries in hist. "<<fZCombc->GetEntries()<<endl;
  }
  */

  TH1F *hc = fZCombc;
  Bool_t goon = kFALSE;
  Int_t cnt = 0;
  Int_t bi;

  do {
    goon = kFALSE;
    cnt++;
    bi = hc->GetMaximumBin();   // bin with maximal content on coarse histogram
    if(hc->GetBinContent(bi)<3){
      if(cnt==1)goon = kTRUE;
      hc = fZCombv;
    }
  } while(goon);


  Float_t centre = hc->GetBinCenter(bi);  // z value of the bin with maximal content
  
  Int_t bifine=static_cast<Int_t>((hc->GetBinCenter(bi)-fZCombf->GetBinLowEdge(0))/fStepFine);
  Int_t nbinsfine=static_cast<Int_t>(3*hc->GetBinWidth(bi)/fStepFine);
  // evaluation of the centroid
  Int_t ii1=TMath::Max(bifine-nbinsfine,1);
  Int_t ii2=TMath::Min(bifine+nbinsfine,fZCombf->GetNbinsX());
  centre = 0.;
  Int_t nn=0;
  for(Int_t ii=ii1;ii<ii2;ii++){
    centre+= fZCombf->GetBinCenter(ii)*fZCombf->GetBinContent(ii);
    nn+=static_cast<Int_t>(fZCombf->GetBinContent(ii));
  }
  if (nn) centre/=nn;
  /*
  if(fDebug>0){
    cout<<"Value of center "<<centre<<endl;
    cout<<"Population of 3 central bins: "<<hc->GetBinContent(bi-1)<<", ";
    cout<<hc->GetBinContent(bi)<<", ";
    cout<<hc->GetBinContent(bi+1)<<endl;
  }
  */
  // n1 is the bin number of fine histogram containing the point located 1 coarse bin less than "centre"
  Int_t n1 = static_cast<Int_t>((centre-hc->GetBinWidth(bi)-fZCombf->GetBinLowEdge(0))/fStepFine);
  // n2 is the bin number of fine histogram containing the point located 1 coarse bin more than "centre"
  Int_t n2 = static_cast<Int_t>((centre+hc->GetBinWidth(bi)-fZCombf->GetBinLowEdge(0))/fStepFine);
  if(n1<1)n1=1;
  if(n2>nbinfine)n2=nbinfine;
  Int_t niter = 0;
  goon = kTRUE;
  Int_t num=0;
  Bool_t last = kFALSE;

  while(goon || last){
    fZFound = 0.;
    fZsig = 0.;
    num=0;
    // at the end of the loop:
    // fZFound = N*(Average Z) - where N is the number of tracklets
    // num=N
    // fZsig = N*Q - where Q is the average of Z*Z
    for(Int_t n=n1;n<=n2;n++){
      fZFound+=fZCombf->GetBinCenter(n)*fZCombf->GetBinContent(n);
      num+=static_cast<Int_t>(fZCombf->GetBinContent(n));
      fZsig+=fZCombf->GetBinCenter(n)*fZCombf->GetBinCenter(n)*fZCombf->GetBinContent(n);
    }
    if(num<2){
      fZsig = 5.3;  // Default error from the beam sigmoid
    }
    else{
      Float_t radi =  fZsig/(num-1)-fZFound*fZFound/num/(num-1);
      // radi = square root of sample variance of Z
      if(radi>0.)fZsig=TMath::Sqrt(radi);
      else fZsig=5.3;  // Default error from the beam sigmoid
      // fZfound - Average Z
      fZFound/=num;
    }
    if(!last){
      // goon is true if the distance between the found Z and the lower bin differs from the distance between the found Z and
      // the upper bin by more than tolerance (0.002)
      goon = TMath::Abs(TMath::Abs(fZFound-fZCombf->GetBinCenter(n1))-TMath::Abs(fZFound-fZCombf->GetBinCenter(n2)))>fTolerance;
      // a window in the fine grained histogram is centered aroung the found Z. The width is 2 bins of
      // the coarse grained histogram
      if(num>0){
	n1 = static_cast<Int_t>((fZFound-hc->GetBinWidth(bi)-fZCombf->GetBinLowEdge(0))/fStepFine);
	if(n1<1)n1=1;
	n2 = static_cast<Int_t>((fZFound+hc->GetBinWidth(bi)-fZCombf->GetBinLowEdge(0))/fStepFine);
	if(n2>nbinfine)n2=nbinfine;
	/*
	  if(fDebug>0){
	  cout<<"Search restricted to n1 = "<<n1<<", n2= "<<n2<<endl;
	  cout<<"z1= "<<fZCombf->GetBinCenter(n1)<<", n2 = "<<fZCombf->GetBinCenter(n2)<<endl;
	  }
	*/
      }
      else {
	n1 = static_cast<Int_t>((centre-(niter+2)*hc->GetBinWidth(bi)-fZCombf->GetBinLowEdge(0))/fStepFine);
	n2 = static_cast<Int_t>((centre+(niter+2)*hc->GetBinWidth(bi)-fZCombf->GetBinLowEdge(0))/fStepFine);
	if(n1<1)n1=1;
	if(n2>nbinfine)n2=nbinfine;
      }
      niter++;
      // no more than 10 adjusting iterations
      if(niter>=10){
	goon = kFALSE;
	//	Warning("FindVertexForCurrentEvent","The procedure does not converge\n");
      }

      if((fZsig> 0.0001) && !goon && num>5){
	last = kTRUE;
	n1 = static_cast<Int_t>((fZFound-fZsig-fZCombf->GetBinLowEdge(0))/fZCombf->GetBinWidth(0));
	if(n1<1)n1=1;
	n2 = static_cast<Int_t>((fZFound+fZsig-fZCombf->GetBinLowEdge(0))/fZCombf->GetBinWidth(0));
	if(n2>nbinfine)n2=nbinfine;
	/*
	if(fDebug>0){
	  cout<<"FINAL Search restricted to n1 = "<<n1<<", n2= "<<n2<<endl;
	  cout<<"z1= "<<fZCombf->GetBinCenter(n1)<<", n2 = "<<fZCombf->GetBinCenter(n2)<<endl;
	}
	*/
      }
    }
    else {
      last = kFALSE;
    }

  }
  //  if(fDebug>0)cout<<"Numer of Iterations "<<niter<<endl<<endl;
  //  if(num!=0)fZsig/=TMath::Sqrt(num);
  if (fZsig<=0) fZsig=5.3; // Default error from the beam sigmoid
  fCurrentVertex = new AliESDVertex(fZFound,fZsig,num);
  fCurrentVertex->SetTitle("vertexer: B");
  ResetHistograms();
  itsLoader->UnloadRecPoints();
  return;
}

//_____________________________________________________________________
void AliITSVertexerZ::ResetHistograms(){
  // delete TH1 data members
  if(fZCombc)delete fZCombc;
  if(fZCombf)delete fZCombf;
  if(fZCombv)delete fZCombv;
  fZCombc = 0;
  fZCombf = 0;
  fZCombv = 0;
}

//______________________________________________________________________
void AliITSVertexerZ::FindVertices(){
  // computes the vertices of the events in the range FirstEvent - LastEvent
  AliRunLoader *rl = AliRunLoader::GetRunLoader();
  AliITSLoader* itsLoader =  (AliITSLoader*) rl->GetLoader("ITSLoader");
  itsLoader->ReloadRecPoints();
  for(Int_t i=fFirstEvent;i<=fLastEvent;i++){
    //  cout<<"Processing event "<<i<<endl;
    rl->GetEvent(i);
    FindVertexForCurrentEvent(i);
    if(fCurrentVertex){
      WriteCurrentVertex();
    }
    /*
    else {
      if(fDebug>0){
	cout<<"Vertex not found for event "<<i<<endl;
	cout<<"fZFound = "<<fZFound<<", fZsig= "<<fZsig<<endl;
      }
    }
    */
  }
}

//________________________________________________________
void AliITSVertexerZ::PrintStatus() const {
  // Print current status
  cout <<"=======================================================\n";
  cout <<" First layer first and last modules: "<<fFirstL1<<", ";
  cout <<fLastL1<<endl;
  cout <<" Second layer first and last modules: "<<fFirstL2<<", ";
  cout <<fLastL2<<endl;
  cout <<" Max Phi difference: "<<fDiffPhiMax<<endl;
  cout <<"Limits for Z histograms: "<<fLowLim<<"; "<<fHighLim<<endl;
  cout <<"Bin sizes for coarse and fine z histos "<<fStepCoarse<<"; "<<fStepFine<<endl;
  cout <<" Current Z "<<fZFound<<"; Z sig "<<fZsig<<endl;
  cout <<" Debug flag: "<<fDebug<<endl;
  cout <<"First event to be processed "<<fFirstEvent;
  cout <<"\n Last event to be processed "<<fLastEvent<<endl;
  if(fZCombc){
    cout<<"fZCombc exists - entries="<<fZCombc->GetEntries()<<endl;
  }
  else{
    cout<<"fZCombc does not exist\n";
  }
  if(fZCombv){
    cout<<"fZCombv exists - entries="<<fZCombv->GetEntries()<<endl;
  }
  else{
    cout<<"fZCombv does not exist\n";
  }
   if(fZCombf){
    cout<<"fZCombf exists - entries="<<fZCombv->GetEntries()<<endl;
  }
  else{
    cout<<"fZCombf does not exist\n";
  }
 
  cout <<"=======================================================\n";
}
Commit	Line	Data
	1	/**************************************************************************
	2	* Copyright(c) 1998-2003, ALICE Experiment at CERN, All rights reserved. *
	3	* *
	4	* Author: The ALICE Off-line Project. *
	5	* Contributors are mentioned in the code where appropriate. *
	6	* *
	7	* Permission to use, copy, modify and distribute this software and its *
	8	* documentation strictly for non-commercial purposes is hereby granted *
	9	* without fee, provided that the above copyright notice appears in all *
	10	* copies and that both the copyright notice and this permission notice *
	11	* appear in the supporting documentation. The authors make no claims *
	12	* about the suitability of this software for any purpose. It is *
	13	* provided "as is" without express or implied warranty. *
	14	**************************************************************************/
	15	#include "AliITSVertexerZ.h"
	16	#include<TBranch.h>
	17	#include<TH1.h>
	18	#include <TString.h>
	19	#include<TTree.h>
	20	#include "AliITSLoader.h"
	21	#include "AliITSgeom.h"
	22	#include "AliITSDetTypeRec.h"
	23	#include "AliITSRecPoint.h"
	24
	25	/////////////////////////////////////////////////////////////////
	26	// this class implements a fast method to determine
	27	// the Z coordinate of the primary vertex
	28	// for p-p collisions it seems to give comparable or better results
	29	// with respect to what obtained with AliITSVertexerPPZ
	30	// It can be used successfully with Pb-Pb collisions
	31	////////////////////////////////////////////////////////////////
	32
	33	ClassImp(AliITSVertexerZ)
	34
	35
	36
	37	//______________________________________________________________________
	38	AliITSVertexerZ::AliITSVertexerZ():AliITSVertexer() {
	39	// Default constructor
	40	SetDiffPhiMax(0);
	41	fX0 = 0.;
	42	fY0 = 0.;
	43	SetFirstLayerModules(0);
	44	SetSecondLayerModules(0);
	45	fZFound = 0;
	46	fZsig = 0.;
	47	fZCombc = 0;
	48	fZCombf = 0;
	49	fZCombv = 0;
	50	SetLowLimit(0.);
	51	SetHighLimit(0.);
	52	SetBinWidthCoarse(0.);
	53	SetBinWidthFine(0.);
	54	SetTolerance(0.);
	55	SetPPsetting(0.,0.);
	56	ConfigIterations();
	57	}
	58
	59	//______________________________________________________________________
	60	AliITSVertexerZ::AliITSVertexerZ(TString fn, Float_t x0, Float_t y0):AliITSVertexer(fn) {
	61	// Standard Constructor
	62	SetDiffPhiMax();
	63	fX0 = x0;
	64	fY0 = y0;
	65	SetFirstLayerModules();
	66	SetSecondLayerModules();
	67	fZFound = 0;
	68	fZsig = 0.;
	69	fZCombc = 0;
	70	fZCombf = 0;
	71	fZCombv = 0;
	72	SetLowLimit();
	73	SetHighLimit();
	74	SetBinWidthCoarse();
	75	SetBinWidthFine();
	76	SetTolerance();
	77	SetPPsetting();
	78	ConfigIterations();
	79
	80	}
	81
	82	//______________________________________________________________________
	83	AliITSVertexerZ::AliITSVertexerZ(const AliITSVertexerZ &vtxr) : AliITSVertexer(vtxr) {
	84	// Copy constructor
	85	// Copies are not allowed. The method is protected to avoid misuse.
	86	Error("AliITSVertexerZ","Copy constructor not allowed\n");
	87	}
	88
	89	//______________________________________________________________________
	90	AliITSVertexerZ& AliITSVertexerZ::operator=(const AliITSVertexerZ& /* vtxr */){
	91	// Assignment operator
	92	// Assignment is not allowed. The method is protected to avoid misuse.
	93	Error("= operator","Assignment operator not allowed\n");
	94	return *this;
	95	}
	96
	97	//______________________________________________________________________
	98	AliITSVertexerZ::~AliITSVertexerZ() {
	99	// Destructor
	100	delete fZCombc;
	101	delete fZCombf;
	102	delete fZCombv;
	103	}
	104
	105	//______________________________________________________________________
	106	void AliITSVertexerZ::ConfigIterations(Int_t noiter,Float_t *ptr){
	107	// configure the iterative procedure to gain efficiency for
	108	// pp events with very low multiplicity
	109	Float_t defaults[5]={0.05,0.1,0.2,0.3,0.5};
	110	fMaxIter=noiter;
	111	if(noiter>5){
	112	Error("ConfigIterations","Maximum number of iterations is 5\n");
	113	fMaxIter=5;
	114	}
	115	for(Int_t j=0;j<5;j++)fPhiDiffIter[j]=defaults[j];
	116	if(ptr)for(Int_t j=0;j<fMaxIter;j++)fPhiDiffIter[j]=ptr[j];
	117	}
	118
	119	//______________________________________________________________________
	120	AliESDVertex* AliITSVertexerZ::FindVertexForCurrentEvent(Int_t evnumber){
	121	// Defines the AliESDVertex for the current event
	122	VertexZFinder(evnumber);
	123	Int_t ntrackl=0;
	124	for(Int_t iteraz=0;iteraz<fMaxIter;iteraz++){
	125	if(fCurrentVertex) ntrackl=fCurrentVertex->GetNContributors();
	126	if(!fCurrentVertex \|\| ntrackl==0 \|\| ntrackl==-1){
	127	Float_t diffPhiMaxOrig=fDiffPhiMax;
	128	fDiffPhiMax=GetPhiMaxIter(iteraz);
	129	VertexZFinder(evnumber);
	130	fDiffPhiMax=diffPhiMaxOrig;
	131	}
	132	}
	133	FindMultiplicity(evnumber);
	134	return fCurrentVertex;
	135	}
	136
	137
	138
	139
	140	//______________________________________________________________________
	141	void AliITSVertexerZ::VertexZFinder(Int_t evnumber){
	142	// Defines the AliESDVertex for the current event
	143	fCurrentVertex = 0;
	144	AliRunLoader *rl =AliRunLoader::GetRunLoader();
	145	AliITSLoader* itsLoader = (AliITSLoader*)rl->GetLoader("ITSLoader");
	146	AliITSgeom* geom = itsLoader->GetITSgeom();
	147	itsLoader->LoadRecPoints();
	148	rl->GetEvent(evnumber);
	149
	150	AliITSDetTypeRec detTypeRec;
	151
	152	TTree *tR = itsLoader->TreeR();
	153	detTypeRec.SetTreeAddressR(tR);
	154	TClonesArray *itsRec = 0;
	155	// lc and gc are local and global coordinates for layer 1
	156	Float_t lc[3]; for(Int_t ii=0; ii<3; ii++) lc[ii]=0.;
	157	Float_t gc[3]; for(Int_t ii=0; ii<3; ii++) gc[ii]=0.;
	158	// lc2 and gc2 are local and global coordinates for layer 2
	159	Float_t lc2[3]; for(Int_t ii=0; ii<3; ii++) lc2[ii]=0.;
	160	Float_t gc2[3]; for(Int_t ii=0; ii<3; ii++) gc2[ii]=0.;
	161
	162	itsRec = detTypeRec.RecPoints();
	163	TBranch *branch;
	164	branch = tR->GetBranch("ITSRecPoints");
	165
	166	Int_t nrpL1 = 0;
	167	Int_t nrpL2 = 0;
	168	// By default fFirstL1=0 and fLastL1=79
	169	// This loop counts the number of recpoints on layer1 (central modules)
	170	for(Int_t module= fFirstL1; module<=fLastL1;module++){
	171	// Keep only central modules
	172	if(module%4==0 \|\| module%4==3)continue;
	173	// cout<<"Procesing module "<<module<<" ";
	174	branch->GetEvent(module);
	175	// cout<<"Number of clusters "<<clusters->GetEntries()<<endl;
	176	nrpL1+= itsRec->GetEntries();
	177	detTypeRec.ResetRecPoints();
	178	}
	179	//By default fFirstL2=80 and fLastL2=239
	180	//This loop counts the number of RP on layer 2
	181	for(Int_t module= fFirstL2; module<=fLastL2;module++){
	182	branch->GetEvent(module);
	183	nrpL2+= itsRec->GetEntries();
	184	detTypeRec.ResetRecPoints();
	185	}
	186	if(nrpL1 == 0 \|\| nrpL2 == 0){
	187	ResetHistograms();
	188	itsLoader->UnloadRecPoints();
	189	fCurrentVertex = new AliESDVertex(0.,5.3,-2);
	190	return;
	191	}
	192	// The vertex finding is attempted only if the number of RP is !=0 on
	193	// both layers
	194	Float_t *xc1 = new Float_t [nrpL1]; // coordinates of the L1 Recpoints
	195	Float_t *yc1 = new Float_t [nrpL1];
	196	Float_t *zc1 = new Float_t [nrpL1];
	197	Float_t *phi1 = new Float_t [nrpL1];
	198	Float_t *xc2 = new Float_t [nrpL2]; // coordinates of the L1 Recpoints
	199	Float_t *yc2 = new Float_t [nrpL2];
	200	Float_t *zc2 = new Float_t [nrpL2];
	201	Float_t *phi2 = new Float_t [nrpL2];
	202	Int_t ind = 0;// running index for RP
	203	// Force a coarse bin size of 200 microns if the number of clusters on layer 2
	204	// is low
	205	if(nrpL2<fPPsetting[0])SetBinWidthCoarse(fPPsetting[1]);
	206	// By default nbinfine = (10+10)/0.0005=40000
	207	Int_t nbinfine = static_cast<Int_t>((fHighLim-fLowLim)/fStepFine);
	208	// By default nbincoarse=(10+10)/0.01=2000
	209	Int_t nbincoarse = static_cast<Int_t>((fHighLim-fLowLim)/fStepCoarse);
	210	// Set stepverycoarse = 3*fStepCoarse
	211	Int_t nbinvcoarse = static_cast<Int_t>((fHighLim-fLowLim)/(3.*fStepCoarse));
	212	if(fZCombc)delete fZCombc;
	213	fZCombc = new TH1F("fZCombc","Z",nbincoarse,fLowLim,fLowLim+nbincoarse*fStepCoarse);
	214	if(fZCombv)delete fZCombv;
	215	fZCombv = new TH1F("fZCombv","Z",nbinvcoarse,fLowLim,fLowLim+nbinvcoarse3.fStepCoarse);
	216	if(fZCombf)delete fZCombf;
	217	fZCombf = new TH1F("fZCombf","Z",nbinfine,fLowLim,fLowLim+nbinfine*fStepFine);
	218	// Loop on modules of layer 1 (restricted to central modules)
	219	for(Int_t module= fFirstL1; module<=fLastL1;module++){
	220	if(module%4==0 \|\| module%4==3)continue;
	221	branch->GetEvent(module);
	222	Int_t nrecp1 = itsRec->GetEntries();
	223	for(Int_t j=0;j<nrecp1;j++){
	224	AliITSRecPoint recp = (AliITSRecPoint)itsRec->At(j);
	225	// Local coordinates of this recpoint
	226	lc[0]=recp->GetDetLocalX();
	227	lc[2]=recp->GetDetLocalZ();
	228	geom->LtoG(module,lc,gc);
	229	// Global coordinates of this recpoints
	230	gc[0]-=fX0; // Possible beam offset in the bending plane
	231	gc[1]-=fY0; // " "
	232	xc1[ind]=gc[0];
	233	yc1[ind]=gc[1];
	234	zc1[ind]=gc[2];
	235	// azimuthal angle is computed in the interval 0 --> 2*pi
	236	phi1[ind] = TMath::ATan2(gc[1],gc[0]);
	237	if(phi1[ind]<0)phi1[ind]=2*TMath::Pi()+phi1[ind];
	238	ind++;
	239	}
	240	detTypeRec.ResetRecPoints();
	241	}
	242	ind = 0; // the running index is reset for Layer 2
	243	for(Int_t module= fFirstL2; module<=fLastL2;module++){
	244	branch->GetEvent(module);
	245	Int_t nrecp2 = itsRec->GetEntries();
	246	for(Int_t j=0;j<nrecp2;j++){
	247	AliITSRecPoint recp = (AliITSRecPoint)itsRec->At(j);
	248	lc[0]=recp->GetDetLocalX();
	249	lc[2]=recp->GetDetLocalZ();
	250	geom->LtoG(module,lc,gc);
	251	gc[0]-=fX0;
	252	gc[1]-=fY0;
	253	xc2[ind]=gc[0];
	254	yc2[ind]=gc[1];
	255	zc2[ind]=gc[2];
	256	phi2[ind] = TMath::ATan2(gc[1],gc[0]);
	257	if(phi2[ind]<0)phi2[ind]=2*TMath::Pi()+phi2[ind];
	258	ind++;
	259	}
	260	detTypeRec.ResetRecPoints();
	261	}
	262
	263	Int_t nolines=0;
	264	for(Int_t i=0;i<nrpL1;i++){ // loop on L1 RP
	265	Float_t r1=TMath::Sqrt(xc1[i]xc1[i]+yc1[i]yc1[i]); // radius L1 RP
	266	for(Int_t j=0;j<nrpL2;j++){ // loop on L2 RP
	267	Float_t diff = TMath::Abs(phi2[j]-phi1[i]); // diff in azimuth
	268	if(diff>TMath::Pi())diff=2.*TMath::Pi()-diff; //diff<pi
	269	if(diff<fDiffPhiMax){ // cut on 10 milliradians by def.
	270	Float_t r2=TMath::Sqrt(xc2[j]xc2[j]+yc2[j]yc2[j]); // radius L2 RP
	271	Float_t zr0=(r2zc1[i]-r1zc2[j])/(r2-r1); //Z @ null radius
	272	fZCombf->Fill(zr0);
	273	fZCombc->Fill(zr0);
	274	fZCombv->Fill(zr0);
	275	Double_t pA[3];
	276	Double_t pB[3];
	277	pA[0]=xc1[i];
	278	pA[1]=yc1[i];
	279	pA[2]=zc1[i];
	280	pB[0]=xc2[j];
	281	pB[1]=yc2[j];
	282	pB[2]=zc2[j];
	283	MakeTracklet(pA,pB,nolines);
	284	}
	285	}
	286	}
	287	delete [] xc1;
	288	delete [] yc1;
	289	delete [] zc1;
	290	delete [] phi1;
	291	delete [] xc2;
	292	delete [] yc2;
	293	delete [] zc2;
	294	delete [] phi2;
	295	Double_t contents = fZCombc->GetEntries()- fZCombc->GetBinContent(0)-fZCombc->GetBinContent(nbincoarse+1);
	296	if(contents<1.){
	297	// Warning("FindVertexForCurrentEvent","Insufficient number of rec. points\n");
	298	ResetHistograms();
	299	itsLoader->UnloadRecPoints();
	300	fCurrentVertex = new AliESDVertex(0.,5.3,-1);
	301	return;
	302	}
	303	/*
	304	else {
	305	if(fDebug>0)cout<<"Number of entries in hist. "<<fZCombc->GetEntries()<<endl;
	306	}
	307	*/
	308
	309	TH1F *hc = fZCombc;
	310	Bool_t goon = kFALSE;
	311	Int_t cnt = 0;
	312	Int_t bi;
	313
	314	do {
	315	goon = kFALSE;
	316	cnt++;
	317	bi = hc->GetMaximumBin(); // bin with maximal content on coarse histogram
	318	if(hc->GetBinContent(bi)<3){
	319	if(cnt==1)goon = kTRUE;
	320	hc = fZCombv;
	321	}
	322	} while(goon);
	323
	324
	325	Float_t centre = hc->GetBinCenter(bi); // z value of the bin with maximal content
	326
	327	Int_t bifine=static_cast<Int_t>((hc->GetBinCenter(bi)-fZCombf->GetBinLowEdge(0))/fStepFine);
	328	Int_t nbinsfine=static_cast<Int_t>(3*hc->GetBinWidth(bi)/fStepFine);
	329	// evaluation of the centroid
	330	Int_t ii1=TMath::Max(bifine-nbinsfine,1);
	331	Int_t ii2=TMath::Min(bifine+nbinsfine,fZCombf->GetNbinsX());
	332	centre = 0.;
	333	Int_t nn=0;
	334	for(Int_t ii=ii1;ii<ii2;ii++){
	335	centre+= fZCombf->GetBinCenter(ii)*fZCombf->GetBinContent(ii);
	336	nn+=static_cast<Int_t>(fZCombf->GetBinContent(ii));
	337	}
	338	if (nn) centre/=nn;
	339	/*
	340	if(fDebug>0){
	341	cout<<"Value of center "<<centre<<endl;
	342	cout<<"Population of 3 central bins: "<<hc->GetBinContent(bi-1)<<", ";
	343	cout<<hc->GetBinContent(bi)<<", ";
	344	cout<<hc->GetBinContent(bi+1)<<endl;
	345	}
	346	*/
	347	// n1 is the bin number of fine histogram containing the point located 1 coarse bin less than "centre"
	348	Int_t n1 = static_cast<Int_t>((centre-hc->GetBinWidth(bi)-fZCombf->GetBinLowEdge(0))/fStepFine);
	349	// n2 is the bin number of fine histogram containing the point located 1 coarse bin more than "centre"
	350	Int_t n2 = static_cast<Int_t>((centre+hc->GetBinWidth(bi)-fZCombf->GetBinLowEdge(0))/fStepFine);
	351	if(n1<1)n1=1;
	352	if(n2>nbinfine)n2=nbinfine;
	353	Int_t niter = 0;
	354	goon = kTRUE;
	355	Int_t num=0;
	356	Bool_t last = kFALSE;
	357
	358	while(goon \|\| last){
	359	fZFound = 0.;
	360	fZsig = 0.;
	361	num=0;
	362	// at the end of the loop:
	363	// fZFound = N*(Average Z) - where N is the number of tracklets
	364	// num=N
	365	// fZsig = NQ - where Q is the average of ZZ
	366	for(Int_t n=n1;n<=n2;n++){
	367	fZFound+=fZCombf->GetBinCenter(n)*fZCombf->GetBinContent(n);
	368	num+=static_cast<Int_t>(fZCombf->GetBinContent(n));
	369	fZsig+=fZCombf->GetBinCenter(n)fZCombf->GetBinCenter(n)fZCombf->GetBinContent(n);
	370	}
	371	if(num<2){
	372	fZsig = 5.3; // Default error from the beam sigmoid
	373	}
	374	else{
	375	Float_t radi = fZsig/(num-1)-fZFound*fZFound/num/(num-1);
	376	// radi = square root of sample variance of Z
	377	if(radi>0.)fZsig=TMath::Sqrt(radi);
	378	else fZsig=5.3; // Default error from the beam sigmoid
	379	// fZfound - Average Z
	380	fZFound/=num;
	381	}
	382	if(!last){
	383	// goon is true if the distance between the found Z and the lower bin differs from the distance between the found Z and
	384	// the upper bin by more than tolerance (0.002)
	385	goon = TMath::Abs(TMath::Abs(fZFound-fZCombf->GetBinCenter(n1))-TMath::Abs(fZFound-fZCombf->GetBinCenter(n2)))>fTolerance;
	386	// a window in the fine grained histogram is centered aroung the found Z. The width is 2 bins of
	387	// the coarse grained histogram
	388	if(num>0){
	389	n1 = static_cast<Int_t>((fZFound-hc->GetBinWidth(bi)-fZCombf->GetBinLowEdge(0))/fStepFine);
	390	if(n1<1)n1=1;
	391	n2 = static_cast<Int_t>((fZFound+hc->GetBinWidth(bi)-fZCombf->GetBinLowEdge(0))/fStepFine);
	392	if(n2>nbinfine)n2=nbinfine;
	393	/*
	394	if(fDebug>0){
	395	cout<<"Search restricted to n1 = "<<n1<<", n2= "<<n2<<endl;
	396	cout<<"z1= "<<fZCombf->GetBinCenter(n1)<<", n2 = "<<fZCombf->GetBinCenter(n2)<<endl;
	397	}
	398	*/
	399	}
	400	else {
	401	n1 = static_cast<Int_t>((centre-(niter+2)*hc->GetBinWidth(bi)-fZCombf->GetBinLowEdge(0))/fStepFine);
	402	n2 = static_cast<Int_t>((centre+(niter+2)*hc->GetBinWidth(bi)-fZCombf->GetBinLowEdge(0))/fStepFine);
	403	if(n1<1)n1=1;
	404	if(n2>nbinfine)n2=nbinfine;
	405	}
	406	niter++;
	407	// no more than 10 adjusting iterations
	408	if(niter>=10){
	409	goon = kFALSE;
	410	// Warning("FindVertexForCurrentEvent","The procedure does not converge\n");
	411	}
	412
	413	if((fZsig> 0.0001) && !goon && num>5){
	414	last = kTRUE;
	415	n1 = static_cast<Int_t>((fZFound-fZsig-fZCombf->GetBinLowEdge(0))/fZCombf->GetBinWidth(0));
	416	if(n1<1)n1=1;
	417	n2 = static_cast<Int_t>((fZFound+fZsig-fZCombf->GetBinLowEdge(0))/fZCombf->GetBinWidth(0));
	418	if(n2>nbinfine)n2=nbinfine;
	419	/*
	420	if(fDebug>0){
	421	cout<<"FINAL Search restricted to n1 = "<<n1<<", n2= "<<n2<<endl;
	422	cout<<"z1= "<<fZCombf->GetBinCenter(n1)<<", n2 = "<<fZCombf->GetBinCenter(n2)<<endl;
	423	}
	424	*/
	425	}
	426	}
	427	else {
	428	last = kFALSE;
	429	}
	430
	431	}
	432	// if(fDebug>0)cout<<"Numer of Iterations "<<niter<<endl<<endl;
	433	// if(num!=0)fZsig/=TMath::Sqrt(num);
	434	if (fZsig<=0) fZsig=5.3; // Default error from the beam sigmoid
	435	fCurrentVertex = new AliESDVertex(fZFound,fZsig,num);
	436	fCurrentVertex->SetTitle("vertexer: B");
	437	ResetHistograms();
	438	itsLoader->UnloadRecPoints();
	439	return;
	440	}
	441
	442	//_____________________________________________________________________
	443	void AliITSVertexerZ::ResetHistograms(){
	444	// delete TH1 data members
	445	if(fZCombc)delete fZCombc;
	446	if(fZCombf)delete fZCombf;
	447	if(fZCombv)delete fZCombv;
	448	fZCombc = 0;
	449	fZCombf = 0;
	450	fZCombv = 0;
	451	}
	452
	453	//______________________________________________________________________
	454	void AliITSVertexerZ::FindVertices(){
	455	// computes the vertices of the events in the range FirstEvent - LastEvent
	456	AliRunLoader *rl = AliRunLoader::GetRunLoader();
	457	AliITSLoader* itsLoader = (AliITSLoader*) rl->GetLoader("ITSLoader");
	458	itsLoader->ReloadRecPoints();
	459	for(Int_t i=fFirstEvent;i<=fLastEvent;i++){
	460	// cout<<"Processing event "<<i<<endl;
	461	rl->GetEvent(i);
	462	FindVertexForCurrentEvent(i);
	463	if(fCurrentVertex){
	464	WriteCurrentVertex();
	465	}
	466	/*
	467	else {
	468	if(fDebug>0){
	469	cout<<"Vertex not found for event "<<i<<endl;
	470	cout<<"fZFound = "<<fZFound<<", fZsig= "<<fZsig<<endl;
	471	}
	472	}
	473	*/
	474	}
	475	}
	476
	477	//________________________________________________________
	478	void AliITSVertexerZ::PrintStatus() const {
	479	// Print current status
	480	cout <<"=======================================================\n";
	481	cout <<" First layer first and last modules: "<<fFirstL1<<", ";
	482	cout <<fLastL1<<endl;
	483	cout <<" Second layer first and last modules: "<<fFirstL2<<", ";
	484	cout <<fLastL2<<endl;
	485	cout <<" Max Phi difference: "<<fDiffPhiMax<<endl;
	486	cout <<"Limits for Z histograms: "<<fLowLim<<"; "<<fHighLim<<endl;
	487	cout <<"Bin sizes for coarse and fine z histos "<<fStepCoarse<<"; "<<fStepFine<<endl;
	488	cout <<" Current Z "<<fZFound<<"; Z sig "<<fZsig<<endl;
	489	cout <<" Debug flag: "<<fDebug<<endl;
	490	cout <<"First event to be processed "<<fFirstEvent;
	491	cout <<"\n Last event to be processed "<<fLastEvent<<endl;
	492	if(fZCombc){
	493	cout<<"fZCombc exists - entries="<<fZCombc->GetEntries()<<endl;
	494	}
	495	else{
	496	cout<<"fZCombc does not exist\n";
	497	}
	498	if(fZCombv){
	499	cout<<"fZCombv exists - entries="<<fZCombv->GetEntries()<<endl;
	500	}
	501	else{
	502	cout<<"fZCombv does not exist\n";
	503	}
	504	if(fZCombf){
	505	cout<<"fZCombf exists - entries="<<fZCombv->GetEntries()<<endl;
	506	}
	507	else{
	508	cout<<"fZCombf does not exist\n";
	509	}
	510
	511	cout <<"=======================================================\n";
	512	}
	513