#include "hrichcut.h"

HRichCut


class description - source file - inheritance tree (.pdf)

class HRichCut : public TObject

Inheritance Chart:
TObject
<-
HRichCut

    public:
HRichCut() HRichCut(const HRichCut&) ~HRichCut() static TClass* Class() virtual TClass* IsA() const static Bool_t isFullRichMdcMetaTracklet(HHitMatch*) static Bool_t isGEANTPair(HDiHitMatchSim*, HLinearCategory*, Char_t*) static Bool_t isGoodRing(HRichHitSim*) static Bool_t isGoodRing(HRichHit*) static Bool_t isGoodRing(HHitMatch*) static Bool_t isGoodTrack(HHitMatchSim*) static Bool_t isInKickTrack(HDiHitMatch*) static Bool_t isNew2Tuple(Int_t, Int_t, Int_t*, Int_t) static Bool_t isNewIndex(Int_t, Int_t*, Int_t) static Bool_t isOpangBetween(HDiHitMatch*, Float_t, Float_t) static Bool_t isOpangGreaterThan(HDiHitMatch*, Float_t) static Bool_t isRICHBetween(HHitMatch*, Float_t, Float_t) static Bool_t isRMPhiDiff(HHitMatch*, Float_t) static Bool_t isRMThetaDiff(HHitMatch*, Float_t) static Bool_t isTOFBetween(HHitMatch*, Float_t, Float_t) static Bool_t isUnlikeSignPair(HDiHitMatch*) static Int_t NbRingsPerMDCUNLIKEPair(HDiHitMatch*) HRichCut& operator=(const HRichCut&) virtual void ShowMembers(TMemberInspector& insp, char* parent) virtual void Streamer(TBuffer& b) void StreamerNVirtual(TBuffer& b)

Data Members




Class Description

 HRichCut

 this class is a helper that contains functionality
 that can be shared by different reconstructors
 it provides cuts and conditions on HHitMatch objects


HRichCut()

~HRichCut(void)

Bool_t isRICHBetween(HHitMatch* track,Float_t low,Float_t high)
polar angle cut for Rich ring in tracklet

Bool_t isTOFBetween(HHitMatch* track,Float_t low,Float_t high)

Bool_t isRMThetaDiff(HHitMatch* track,Float_t limit)

Bool_t isRMPhiDiff(HHitMatch* track,Float_t limit)

Bool_t isInKickTrack(HDiHitMatch* pair)

Bool_t isOpangGreaterThan(HDiHitMatch* pair,Float_t th)

Bool_t isOpangBetween(HDiHitMatch* pair,Float_t low,Float_t high)

Bool_t isFullRichMdcMetaTracklet(HHitMatch* track)

Int_t NbRingsPerMDCUNLIKEPair(HDiHitMatch* pair)

Bool_t isGEANTPair(HDiHitMatchSim* pair, HLinearCategory* cat, Char_t* opt)

Bool_t isUnlikeSignPair(HDiHitMatch* pair)

Bool_t isNew2Tuple(Int_t i,Int_t j,Int_t *tuple,Int_t max)
this function projects (i,j)-->(n) {N2-->N1}
according to the function ax+by
and decides whether this value is already stored or not
the array tuple is assumed to be init to -2

Bool_t isNewIndex(Int_t i,Int_t* iarr,Int_t max)
 compare int to content of given array iarr
 and decide if it is already stored or not
 if not stored, remember the int

Bool_t isGoodRing(HRichHitSim *r)

Bool_t isGoodRing(HRichHit *r)
 apply same cuts as in simulation

Bool_t isGoodRing(HHitMatch *r)
 apply same cuts as in simulation

Bool_t isGoodTrack(HHitMatchSim *t)



Inline Functions


            TClass* Class()
            TClass* IsA() const
               void ShowMembers(TMemberInspector& insp, char* parent)
               void Streamer(TBuffer& b)
               void StreamerNVirtual(TBuffer& b)
           HRichCut HRichCut(const HRichCut&)
          HRichCut& operator=(const HRichCut&)


Last update: Fri Jan 26 12:26:17 2007


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.