Coding conventions (Annalisa)

[u/mrichter/AliRoot.git] / ANALYSIS / AliEventCut.h

diff --git a/ANALYSIS/AliEventCut.h b/ANALYSIS/AliEventCut.h
index b14131499f47b59576370d58a74f07720d5905f5..198fd5b00694a930731c7d9db4330ec98ac7c6c8 100644 (file)
--- a/ANALYSIS/AliEventCut.h
+++ b/ANALYSIS/AliEventCut.h
@@ -1,6 +1,6 @@
 #ifndef ALIEVENTCUT_H
 #define ALIEVENTCUT_H
-//________________________________
+
 ///////////////////////////////////////////////////////////
 //
 // class AliEventCut
@@ -9,7 +9,7 @@
 // Each of base event cut checks only one property.
 // Logical base cuts also exists that point to other base cuts.
 // Using them one can build complicated cut with binary tree structure
-//
+// Author: Piotr.Skowronski@cern.ch
 ///////////////////////////////////////////////////////////
 
 #include <TObject.h>
@@ -25,11 +25,18 @@ class AliEventCut: public TObject
     AliEventCut(const AliEventCut& in);
     virtual ~AliEventCut();
     
-    virtual Bool_t Pass(AliAOD* aod) const;//returns kTRUE if rejected
-    void AddBasePartCut(AliEventBaseCut* ebcut){fBaseCuts.Add(ebcut);}
+    virtual Bool_t Rejected(AliAOD* aod) const;//returns kTRUE if rejected
+    void           AddBasePartCut(AliEventBaseCut* ebcut);
+
+    void           SetNChargedRange(Int_t min,Int_t max, Double_t etamin = -10.0,Double_t etamax = 10.0);
+    void           SetVertexXRange(Double_t min, Double_t max);
+    void           SetVertexYRange(Double_t min, Double_t max);
+    void           SetVertexZRange(Double_t min, Double_t max);
     
   protected:
-    TObjArray fBaseCuts;
+    AliEventBaseCut* FindCut(AliEventBaseCut::EEventCutProperty prop);
+    
+    TObjArray fBaseCuts; // Array of cuts
   private:
     ClassDef(AliEventCut,1)
 };
@@ -40,7 +47,7 @@ class AliEventEmptyCut: public TObject
     AliEventEmptyCut(){}
     virtual ~AliEventEmptyCut(){}
     
-    Bool_t Pass(AliAOD* aod) const {return kFALSE;}//always accept
+    Bool_t Rejected(AliAOD* /*aod*/) const {return kFALSE;}//always accept
     
   protected:
   private: