HPairFL
class description - source file - inheritance tree (.pdf)
public:
HPairFL()
HPairFL(const HPairFL&)
~HPairFL()
static HCategory* buildLinearCategory(Cat_t, Text_t* catName = "HNewLinearCategory")
static Float_t calcInvMass(HPidParticle*, HPidParticle*)
static Float_t calcInvMass(TLorentzVector*, TLorentzVector*)
static Float_t calcVertex(HPidParticle*, HPidParticle*, TVector3*, TVector3*)
static TClass* Class()
static void clearBit(UChar_t, Int_t&)
static void clearBit(UInt_t, Int_t&)
static Int_t countPositiveBits(const Int_t)
static void dumpKine(HGeantKine*)
static HGeantKine* findParent(HGeantKine*, HCategory*)
static HGeantKine* findParent(HGeantKine*, HIterator*)
static Int_t getBit(UChar_t, const Int_t)
static Int_t getBit(UInt_t, const Int_t)
static HCategory* getCategory(Cat_t, Bool_t bWarning = kFALSE)
virtual TClass* IsA() const
static Bool_t isNew2Tuple(Int_t, Int_t, Int_t*, Int_t)
static Bool_t isNewIndex(Int_t, Int_t*, Int_t)
HPairFL& operator=(const HPairFL&)
static void printBitField(const Int_t)
static void printBitField(const Char_t)
static void saveHistos(TFile*, TObjArray*)
static void setBit(UChar_t, Int_t&)
static void setBit(UInt_t, Int_t&)
virtual void ShowMembers(TMemberInspector& insp, char* parent)
virtual void Streamer(TBuffer& b)
void StreamerNVirtual(TBuffer& b)
HPairFL
Static function library of module "pairs"
HPairFL(void)
~HPairFL(void)
HCategory* buildLinearCategory(Cat_t cat, Text_t* catName)
HCategory* getCategory(Cat_t cat, Bool_t bWarning)
Find HCategory if gHades->getCurrentEvent() is accessible
void saveHistos(TFile* pFileOut, TObjArray* pHistArray)
use this function to save histos every n events
assumes that you have opened a file and that your
histograms are stored in a TObjArray
void printBitField(const Int_t in)
void printBitField(const Char_t in)
void setBit(UChar_t pos, Int_t& in)
start counting from 0 for the position !
i.e.: 0,1,2,3,4,5,6, ....
Int_t getBit(UChar_t pos, const Int_t in)
start counting from 0 for the position !
i.e.: 0,1,2,3,4,5,6, ....
void clearBit(UChar_t pos, Int_t& in)
start counting from 0 for the position !
i.e.: 0,1,2,3,4,5,6, ....
void setBit(UInt_t pos, Int_t& in)
start counting from 0 for the position !
i.e.: 0,1,2,3,4,5,6, ....
Int_t getBit(UInt_t pos, const Int_t in)
start counting from 0 for the position !
i.e.: 0,1,2,3,4,5,6, ....
void clearBit(UInt_t pos, Int_t& in)
start counting from 0 for the position !
i.e.: 0,1,2,3,4,5,6, ....
Int_t countPositiveBits(const Int_t in)
Float_t calcInvMass(HPidParticle* p1, HPidParticle* p2)
use this function only for beta = 1 particles
Float_t calcInvMass(TLorentzVector* t1, TLorentzVector* t2)
use this function only for beta = 1 particles
HGeantKine* findParent(HGeantKine *kine,HIterator* iter_kine2)
HGeantKine* findParent(HGeantKine *kine,HCategory* cat)
Float_t calcVertex(HPidParticle *p1, HPidParticle *p2,
TVector3 *vertex, TVector3 *distance)
calcVertex should return
1. the vertex of two tracks (no weights included, so it returns the
center of closest approach vector)
2. a vector with direction and magnitude of the distance
(using stefanos algebra to calculate the magnitude, root cross product
to give the direction)
void dumpKine(HGeantKine *kine)
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 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
Inline Functions
TClass* Class()
TClass* IsA() const
void ShowMembers(TMemberInspector& insp, char* parent)
void Streamer(TBuffer& b)
void StreamerNVirtual(TBuffer& b)
HPairFL HPairFL(const HPairFL&)
HPairFL& operator=(const HPairFL&)
Last update: Fri Jan 26 12:20:27 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.