#include "hmdcclosepaircutspar.h" |
HMdcClosePairCutsParEf
class description - source file - inheritance tree (.pdf)
public:
HMdcClosePairCutsParEf(Int_t n = 4)
HMdcClosePairCutsParEf(const HMdcClosePairCutsParEf&)
~HMdcClosePairCutsParEf()
static TClass* Class()
Int_t getSize()
virtual TClass* IsA() const
HMdcClosePairCutsParEf& operator=(const HMdcClosePairCutsParEf&)
HMdcClosePairCutsParCut& operator[](Int_t i)
virtual void ShowMembers(TMemberInspector& insp, char* parent)
virtual void Streamer(TBuffer& b)
void StreamerNVirtual(TBuffer& b)
protected:
TObjArray* array array of pointers of type HMdcClosePairCutsParCut
HMdcClosePairCutsPar
Container storing the cuts to make close pair rejection
If the all values of the cuts are larger than those from mdc-rich tracklet
than traclet is single. Cuts on mdc cluster size, mdc contributing wires
and integrated charge in ring are stored.
Because first two mdc variables are depending on theta,phi angle ,
there are different cuts for several theta,phi regions. There are 8 bins in theta space:
mdc cls finder level bins:
0: 4
1: 5
2: 6
theta bins:
0: 10-20 degrees
1: 20-30 degrees
2: 30-40 degrees
3: 40-50 degrees
4: 50-60 degrees
5: 60-70 degrees
6: 70-80 degrees
7: 80-90 degrees
There are three bins in phi space
phi bins:
0: 0-10 & 50-60
1: 10-20 & 40-50
2: 20-30 & 30-40
The rejection power S/B ratio depends on minimal single lepton efficiency therefore there are
4 bins of efficiency
efficiency bins:
0: 80-85
1: 85-90
2: 90-95
3: 95-100
HMdcClosePairCutsParEf(Int_t n)
constructor creates a TClonesArray of type
HMdcClosePairCutsParCut
~HMdcClosePairCutsParEf()
destructor
Int_t getSize()
return the size of the pointer array
Inline Functions
HMdcClosePairCutsParCut& operator[](Int_t i)
TClass* Class()
TClass* IsA() const
void ShowMembers(TMemberInspector& insp, char* parent)
void Streamer(TBuffer& b)
void StreamerNVirtual(TBuffer& b)
HMdcClosePairCutsParEf HMdcClosePairCutsParEf(const HMdcClosePairCutsParEf&)
HMdcClosePairCutsParEf& operator=(const HMdcClosePairCutsParEf&)
Last update: 18/06/2002
ROOT page - Class index - Class Hierarchy - Top of the page
This page has been automatically generated. If you have any comments or suggestions about the page layout send a mail to ROOT support, or contact the developers with any questions or problems regarding ROOT.