- AliMUONRecoParam.cxx:

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

diff --git a/ANALYSIS/AliEventCut.cxx b/ANALYSIS/AliEventCut.cxx
index ec20b6adc10d7274d3a74771406c65b97d0a66b5..447787c06b2ed28dc4c0ebf519a5cefc71efc62e 100644 (file)
--- a/ANALYSIS/AliEventCut.cxx
+++ b/ANALYSIS/AliEventCut.cxx
@@ -1,22 +1,20 @@
 #include "AliEventCut.h"
-//________________________________
+
 ///////////////////////////////////////////////////////////
 //
-// class AliRunAnalysis
-//
-//
-//
+// class AliEventCut
 //
+// Event cut. It has list of base event cuts. 
+// 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 <TObjArray.h>
-//#include <TIter.h>
-
 #include "AliEventBaseCut.h"
 
 ClassImp(AliEventCut)
 
-
 AliEventCut::AliEventCut():
  fBaseCuts(10)
 {
@@ -40,7 +38,7 @@ AliEventCut::~AliEventCut()
 
 /*********************************************************/
 
-Bool_t AliEventCut::Pass(AliAOD* aod) const
+Bool_t AliEventCut::Rejected(AliAOD* aod) const
 {
   //returns kTRUE if rejected
   if (aod == 0x0)
@@ -53,11 +51,87 @@ Bool_t AliEventCut::Pass(AliAOD* aod) const
   AliEventBaseCut* becut;
   while (( becut = (AliEventBaseCut*)iter() ))
    {
-     if (becut->Pass(aod)) return kTRUE;
+     if (becut->Rejected(aod)) return kTRUE;
    }
   return kFALSE;
 }
+/*********************************************************/
+void AliEventCut::AddBasePartCut(AliEventBaseCut* ebcut)
+{
+//Adds a base cut
+ if (ebcut == 0x0)
+  {
+    Error("AddBasePartCut","Pointer to base cut is NULL");
+    return;
+  }
+ 
+ if (ebcut->GetProperty() != AliEventBaseCut::kNone)
+  {
+    if (FindCut(ebcut->GetProperty()))
+     {
+       Warning("AddBasePartCut","Cut with this property is already in the list of base cuts");
+     }
+  }  
+  
+ fBaseCuts.Add(ebcut->Clone());
+ 
+}
+/*********************************************************/
+
+AliEventBaseCut* AliEventCut::FindCut(AliEventBaseCut::EEventCutProperty prop)
+{
+//Finds and returns pointer to the cut with given property
+ Int_t n = fBaseCuts.GetEntries();
+ for (Int_t i = 0; i<n; i++)
+  {
+    AliEventBaseCut* bcut = (AliEventBaseCut*)fBaseCuts.At(i);
+    if (bcut->GetProperty() == prop)
+       return bcut; //we found the cut we were searching for
+  }
+
+ return 0x0; //we did not found this cut
+
+}
+/*********************************************************/
+
+void AliEventCut::SetNChargedRange(Int_t min,Int_t max,Double_t etamin,Double_t etamax)
+{
+ //Sets renge of number of charged particles
+  AliNChargedCut* cut = dynamic_cast<AliNChargedCut*>(FindCut(AliEventBaseCut::kNChargedCut));
+  if(cut) 
+   { 
+     cut->SetRange(min,max);
+     cut->SetEtaRange(etamin,etamax);
+   }  
+  else fBaseCuts.Add(new AliNChargedCut(min,max,etamin,etamax));
+}
+/*********************************************************/
 
+void AliEventCut::SetVertexXRange(Double_t min, Double_t max)
+{
+  //Sets range of z coordinate of a primary vertex
+  AliEventBaseCut* cut = FindCut(AliEventBaseCut::kPrimVertexXCut);
+  if (cut) cut->SetRange(min,max);
+  else fBaseCuts.Add(new AliPrimVertexXCut(min,max));
+}
+/*********************************************************/
+
+void AliEventCut::SetVertexYRange(Double_t min, Double_t max)
+{
+  //Sets range of z coordinate of a primary vertex
+  AliEventBaseCut* cut = FindCut(AliEventBaseCut::kPrimVertexYCut);
+  if (cut) cut->SetRange(min,max);
+  else fBaseCuts.Add(new AliPrimVertexYCut(min,max));
+}
+/*********************************************************/
+
+void AliEventCut::SetVertexZRange(Double_t min, Double_t max)
+{
+  //Sets range of z coordinate of a primary vertex
+  AliEventBaseCut* cut = FindCut(AliEventBaseCut::kPrimVertexZCut);
+  if (cut) cut->SetRange(min,max);
+  else fBaseCuts.Add(new AliPrimVertexZCut(min,max));
+}
 /*********************************************************/
 /*********************************************************/
 /*********************************************************/