4 // This is the front-end for cut management and checking.
5 // It must be prepared by adding all required single cuts,
6 // and then with a logical expression which combines all cuts
7 // with the "AND", "OR" and "NOT" operators.
9 // author: M. Vala (martin.vala@cern.ch)
12 #ifndef ALIRSNCUTSET_H
13 #define ALIRSNCUTSET_H
16 #include <TObjArray.h>
18 #include "AliRsnTarget.h"
19 #include "AliRsnCut.h"
22 class AliRsnExpression;
23 class AliRsnPairParticle;
26 class AliRsnCutSet : public AliRsnTarget {
30 AliRsnCutSet(const char *name, RSNTARGET target);
31 AliRsnCutSet(const AliRsnCutSet ©);
32 AliRsnCutSet& operator=(const AliRsnCutSet& copy);
35 void AddCut(AliRsnCut* cut);
37 void ShowCuts() const;
38 Int_t GetIndexByCutName(TString s);
40 Bool_t IsValidScheme();
41 TString ShowCutScheme();
42 Int_t TestExpression(TString opt = "short");
45 Bool_t IsSelected(TObject *object);
47 void SetBoolValue(Bool_t theValue, Int_t index) { fBoolValues[index] = theValue; }
48 Bool_t GetBoolValue(Int_t index) const { return fBoolValues[index]; }
50 void SetCutScheme(const char *theValue);
51 TString GetCutScheme() const { return fCutScheme; }
53 void SetCutSchemeIndexed(TString theValue);
54 TString GetCutSchemeIndexed();
56 TObjArray *GetCuts() { return &fCuts; }
60 TObjArray fCuts; // array of cuts
61 Int_t fNumOfCuts; // number of cuts
62 TString fCutScheme; // cut scheme
63 TString fCutSchemeIndexed; // cut scheme indexed
65 Bool_t *fBoolValues; //[fNumOfCuts]
66 Bool_t fIsScheme; // is scheme
68 AliRsnExpression *fExpression; // pointer to AliRsnExpression
70 ClassDef(AliRsnCutSet, 1) // ROOT dictionary