Removing the run DB. The information contained in the DB is still stored in the raw...

[u/mrichter/AliRoot.git] / STEER / AliVertexerTracks.h

diff --git a/STEER/AliVertexerTracks.h b/STEER/AliVertexerTracks.h
index c2019428bcb63c3f0ff126e8e4676e8c85e64807..e541ea0259bf6cf38ac5ff902b37e91996a9b584 100644 (file)
--- a/STEER/AliVertexerTracks.h
+++ b/STEER/AliVertexerTracks.h
@@ -42,40 +42,58 @@ class AliVertexerTracks : public TObject {
   AliVertex* VertexForSelectedTracks(TTree *trkTree);
   AliVertex* VertexForSelectedTracks(TObjArray *trkArray);
   AliESDVertex* FindPrimaryVertex(const AliESD *esdEvent);
-  void  SetMinTracks(Int_t n=2) { fMinTracks = n; return; }
+  void  SetMinTracks(Int_t n=1) { fMinTracks = n; return; }
+  void  SetITSNotRequired() { fITSrefit=kFALSE;fITSin=kFALSE; return; }
+  void  SetITSrefitNotRequired() { fITSrefit=kFALSE; return; }
+  void  SetMinITSClusters(Int_t n=5) { fMinITSClusters = n; return; }
   void  SetSkipTracks(Int_t n,Int_t *skipped);
-  void SetDebug(Int_t optdebug=0) {fDebug=optdebug;}
-  void  SetVtxStart(Double_t x=0,Double_t y=0) 
-    { fNominalPos[0]=x; fNominalPos[1]=y; return; }
-  void  SetDCAcut(Double_t maxdca)
-    { fDCAcut=maxdca; return;}
-  void SetFinderAlgorithm(Int_t opt=1) 
-    { fAlgo=opt; return;}
-  
+  void  SetDebug(Int_t optdebug=0) {fDebug=optdebug;}
+  void  SetVtxStart(Double_t x=0,Double_t y=0,Double_t z=0) 
+    { fNominalPos[0]=x; fNominalPos[1]=y; fNominalPos[2]=z; return; }
+  void  SetVtxStartSigma(Double_t sx=3,Double_t sy=3,Double_t sz=6) 
+    { fNominalCov[0]=sx*sx; fNominalCov[2]=sy*sy; fNominalCov[5]=sz*sz;
+      fNominalCov[1]=0.; fNominalCov[3]=0.; fNominalCov[4]=0.; return; }
+  void  SetVtxStart(AliESDVertex *vtx);
+  void  SetDCAcut(Double_t maxdca) { fDCAcut=maxdca; return; }
+  void  SetFinderAlgorithm(Int_t opt=1) { fAlgo=opt; return; }
+  void  SetNSigmad0(Double_t n=3) { fNSigma=n; return; }
+  Double_t GetNSigmad0() const { return fNSigma; }
+  static Double_t GetStrLinMinDist(Double_t *p0,Double_t *p1,Double_t *x0);
+  static Double_t GetDeterminant3X3(Double_t matr[][3]);
+  static void GetStrLinDerivMatrix(Double_t *p0,Double_t *p1,Double_t (*m)[3],Double_t *d);
+  static void GetStrLinDerivMatrix(Double_t *p0,Double_t *p1,Double_t *sigmasq,Double_t (*m)[3],Double_t *d);
+
  protected:
-  Double_t   GetField() const { return AliTracker::GetBz();} 
-  void     ComputeMaxChi2PerTrack(Int_t nTracks);
-  Int_t PrepareTracks(TTree &trkTree, Int_t OptImpParCut);
+  Double_t GetField() const { 
+    if(!AliTracker::GetFieldMap())
+      AliFatal("Field map not set; use AliTracker::SetFieldMap()!");
+    return AliTracker::GetBz(); } 
+  Int_t    PrepareTracks(TTree &trkTree,Int_t OptImpParCut);
+  void     OneTrackVertFinder();
   void     VertexFinder(Int_t optUseWeights=0);
   void     HelixVertexFinder();
   void     StrLinVertexFinderMinDist(Int_t OptUseWeights=0);
-  static void GetStrLinDerivMatrix(Double_t *p0,Double_t *p1,Double_t m[][3],Double_t *d);
-  static void GetStrLinDerivMatrix(Double_t *p0,Double_t *p1,Double_t *sigmasq,Double_t m[][3],Double_t *d);
-  static Double_t GetStrLinMinDist(Double_t *p0,Double_t *p1,Double_t *x0);
-  static Double_t GetDeterminant3X3(Double_t matr[][3]);
-  void     VertexFitter();
+  void     VertexFitter(Bool_t useNominaVtx=kFALSE);
+  void     TooFewTracks(const AliESD *esdEvent);
 
+   
   AliVertex fVert;         // vertex after vertex finder
   AliESDVertex *fCurrentVertex;  // ESD vertex after fitter
-  Double_t  fNominalPos[2];   // initial knowledge on vertex position
+  Double_t  fNominalPos[3];   // initial knowledge on vertex position
+  Double_t  fNominalCov[6];   // initial knowledge on vertex position
   Int_t     fMinTracks;       // minimum number of tracks
-  Double_t  fMaxChi2PerTrack; // maximum contribition to the chi2 
+  Int_t     fMinITSClusters;  // minimum number of ITS clusters per track
   TObjArray fTrkArray;        // array with tracks to be processed
   Int_t     *fTrksToSkip;     // tracks to be skipped for find and fit 
   Int_t     fNTrksToSkip;     // number of tracks to be skipped 
   Double_t  fDCAcut;          // maximum DCA between 2 tracks used for vertex
   Int_t     fAlgo;            // option for vertex finding algorythm
-  Int_t fDebug;               //! debug flag - verbose printing if >0
+  Double_t  fNSigma;          // number of sigmas for d0 cut in PrepareTracks()
+  Bool_t    fITSin;           // if kTRUE (default), use only kITSin tracks
+                              // if kFALSE, use all tracks (also TPC only)
+  Bool_t    fITSrefit;        // if kTRUE (default), use only kITSrefit tracks
+                              // if kFALSE, use all tracks (also TPC only)
+  Int_t     fDebug;           //! debug flag - verbose printing if >0
   // fAlgo=1 (default) finds minimum-distance point among all selected tracks
   //         approximated as straight lines 
   //         and uses errors on track parameters as weights
@@ -89,11 +107,11 @@ class AliVertexerTracks : public TObject {
   // fAlgo=5 finds the average point among DCA points of all pairs of tracks
   //         approximated as straight lines 
 
+ private:
+  AliVertexerTracks(const AliVertexerTracks & source);
+  AliVertexerTracks & operator=(const AliVertexerTracks & source);
 
-  ClassDef(AliVertexerTracks,3) // 3D Vertexing with ESD tracks 
+  ClassDef(AliVertexerTracks,5) // 3D Vertexing with ESD tracks 
 };
 
 #endif
-
-
-