[u/mrichter/AliRoot.git] / PWG2 / RESONANCES / AliRsnCutSet.h

//
// Class AliRsnCutSet
//
// This is the front-end for cut management and checking.
// It must be prepared by adding all required single cuts,
// and then with a logical expression which combines all cuts
// with the "AND", "OR" and "NOT" operators.
//
// author: M. Vala (martin.vala@cern.ch)
//

#ifndef ALIRSNCUTSET_H
#define ALIRSNCUTSET_H

#include <TNamed.h>
#include <TObjArray.h>

#include "AliRsnTarget.h"

class AliRsnCut;
class AliRsnDaughter;
class AliRsnExpression;
class AliRsnPairParticle;
class AliRsnEvent;

class AliRsnCutSet : public AliRsnTarget {
public:

   AliRsnCutSet();
   AliRsnCutSet(const char *name, RSNTARGET target);
   AliRsnCutSet(const AliRsnCutSet &copy);
   AliRsnCutSet& operator=(const AliRsnCutSet& copy);
   ~AliRsnCutSet();

   void      AddCut(AliRsnCut* cut);

   void      ShowCuts() const;
   Int_t     GetIndexByCutName(TString s);
   Bool_t    Passed();
   Bool_t    IsValidScheme();
   TString   ShowCutScheme() const;
   Int_t     TestExpression(TString opt = "short");
   void      PrintSetInfo();

   Bool_t    IsSelected(TObject *object);

   void SetBoolValue(Bool_t theValue, Int_t index) { fBoolValues[index] = theValue; }
   Bool_t GetBoolValue(Int_t index) const { return fBoolValues[index]; }

   void SetCutScheme(const char *theValue);
   TString GetCutScheme() const { return fCutScheme; }

   void SetCutSchemeIndexed(TString theValue);
   TString   GetCutSchemeIndexed();

   TObjArray *GetCuts() { return &fCuts; }

private:

   TObjArray     fCuts;                  // array of cuts
   Int_t         fNumOfCuts;             // number of cuts
   TString       fCutScheme;             // cut scheme
   TString       fCutSchemeIndexed;      // cut scheme indexed

   Bool_t       *fBoolValues;            //[fNumOfCuts]
   Bool_t        fIsScheme;              // is scheme

   AliRsnExpression  *fExpression;       // pointer to AliRsnExpression

   ClassDef(AliRsnCutSet, 1)   // ROOT dictionary
};

#endif
Commit	Line	Data
	1	//
	2	// Class AliRsnCutSet
	3	//
	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.
	8	//
	9	// author: M. Vala (martin.vala@cern.ch)
	10	//
	11
	12	#ifndef ALIRSNCUTSET_H
	13	#define ALIRSNCUTSET_H
	14
	15	#include <TNamed.h>
	16	#include <TObjArray.h>
	17
	18	#include "AliRsnTarget.h"
	19
	20	class AliRsnCut;
	21	class AliRsnDaughter;
	22	class AliRsnExpression;
	23	class AliRsnPairParticle;
	24	class AliRsnEvent;
	25
	26	class AliRsnCutSet : public AliRsnTarget {
	27	public:
	28
	29	AliRsnCutSet();
	30	AliRsnCutSet(const char *name, RSNTARGET target);
	31	AliRsnCutSet(const AliRsnCutSet &copy);
	32	AliRsnCutSet& operator=(const AliRsnCutSet& copy);
	33	~AliRsnCutSet();
	34
	35	void AddCut(AliRsnCut* cut);
	36
	37	void ShowCuts() const;
	38	Int_t GetIndexByCutName(TString s);
	39	Bool_t Passed();
	40	Bool_t IsValidScheme();
	41	TString ShowCutScheme() const;
	42	Int_t TestExpression(TString opt = "short");
	43	void PrintSetInfo();
	44
	45	Bool_t IsSelected(TObject *object);
	46
	47	void SetBoolValue(Bool_t theValue, Int_t index) { fBoolValues[index] = theValue; }
	48	Bool_t GetBoolValue(Int_t index) const { return fBoolValues[index]; }
	49
	50	void SetCutScheme(const char *theValue);
	51	TString GetCutScheme() const { return fCutScheme; }
	52
	53	void SetCutSchemeIndexed(TString theValue);
	54	TString GetCutSchemeIndexed();
	55
	56	TObjArray *GetCuts() { return &fCuts; }
	57
	58	private:
	59
	60	TObjArray fCuts; // array of cuts
	61	Int_t fNumOfCuts; // number of cuts
	62	TString fCutScheme; // cut scheme
	63	TString fCutSchemeIndexed; // cut scheme indexed
	64
	65	Bool_t *fBoolValues; //[fNumOfCuts]
	66	Bool_t fIsScheme; // is scheme
	67
	68	AliRsnExpression *fExpression; // pointer to AliRsnExpression
	69
	70	ClassDef(AliRsnCutSet, 1) // ROOT dictionary
	71	};
	72
	73	#endif