#include "hhyplistfillerinclusive.h" |
HHypListFillerInclusive
class description - source file - inheritance tree (.pdf)
private:
Int_t CalculateNComb(Int_t nTracksPlus, Int_t nPartPlus, Int_t nSamePartPlus)
void create_pid_table()
Bool_t fill_pid_fprob(HHypComb* hypcomb, Int_t* numpidtracks)
Int_t fill_pid_idx(HHypComb* hypcomb)
Int_t fill_pid_idx_double_part(HHypComb* hypcomb, Int_t nTracks, Int_t iParPosition, Int_t iStartComb, Int_t* pidIdx)
Int_t fill_pid_idx_singiel_part(HHypComb* hypcomb, Int_t nTracks, Int_t iParPosition, Int_t iStartComb, Int_t iNComb, Int_t* pidIdx)
void fill_pid_table(HHypComb* hypcomb)
Bool_t FindNextPermutation(Int_t* array, Int_t count)
Bool_t generateNumberOfCombinations()
void PermReverser(Int_t* array, Int_t a, Int_t b)
void PermSwapper(Int_t* array, Int_t a, Int_t b)
void remove_fakes_pid_table()
public:
HHypListFillerInclusive()
HHypListFillerInclusive(Text_t* name, Text_t* title)
~HHypListFillerInclusive()
Bool_t AddTrack(Int_t particle)
static TClass* Class()
virtual Int_t execute()
virtual Bool_t finalize()
virtual Bool_t init()
virtual TClass* IsA() const
void setContCatComb(HCategory* pContCat)
void setContCatList(HCategory* pContCat)
Bool_t SetExitList(Int_t e_list)
virtual void ShowMembers(TMemberInspector& insp, char* parent)
virtual void Streamer(TBuffer& b)
void StreamerNVirtual(TBuffer& b)
private:
Int_t exitList
Int_t nHadronPlus
Int_t nHadronMinus
Int_t nLeptonMinus
Int_t nLeptonPlus
Int_t numberOfParticles
Int_t nElectron
Int_t nPositron
Int_t nPosPion
Int_t nNegPion
Int_t nProton
Int_t numberOfCombinations
Int_t counterHadronPlus
Int_t counterHadronMinus
Int_t counterLeptonPlus
Int_t counterLeptonMinus
Int_t PosHadronIdx[20]
Int_t NegHadronIdx[20]
Int_t PositronIdx[20]
Int_t ElectronIdx[20]
TArrayI particleArrayPlus
TArrayI particleArrayMinus
HCategory* m_pContCatList !Pointer to the hit data category HHypList
HCategory* m_pContCatComb !Pointer to the hit data category HHypComb
HCategory* m_pContCatPart !Pointer to the hit data category HPidPArticle
HIterator* m_pContItPart !Pointer to the hit data category HPidPArticle
HHypListFillerInclusive
HypListFiller is creating a permutated list for all particle types
which are needed for the Algorithm. This list is created once at
init time and then copied to HypComp for every event on execute.
List of combination of 2(4) tracks out of N tracks
t1 t2 t3 t4 N=4, Ncomb=6, all tracks are taken as protons
assumed id=14
0: t1 t2
1: t1 t3
2: t1 t4
3: t2 t3
4: t2 t4
5: t3 t4
HHypListFillerInclusive(Text_t * name, Text_t * title):
HReconstructor(name, title)
HHypListFillerInclusive()
~HHypListFillerInclusive(void)
Bool_t SetExitList(Int_t e_list)
Bool_t init()
Int_t execute()
Bool_t finalize()
Bool_t AddTrack(Int_t particle)
Adds a particle type track to filler
must be done before init is called
void fill_pid_table(HHypComb * hypcomb)
Int_t fill_pid_idx(HHypComb * hypcomb)
Int_t fill_pid_idx_double_part(HHypComb * hypcomb,
Int_t nTracks, Int_t iParPosition, Int_t iStartComb, Int_t *pidIdx)
Int_t fill_pid_idx_singiel_part(HHypComb * hypcomb, Int_t nTracks, Int_t iParPosition,
Int_t iStartComb, Int_t iNComb,Int_t *pidIdx )
Bool_t fill_pid_fprob(HHypComb * hypcomb,Int_t *numpidtracks)
Int_t CalculateNComb(Int_t nTracksPlus,Int_t nPartPlus,Int_t nSamePartPlus)
// number of positiv tracks type X, number of positive particles X, number of identicel particles X
// X i.e positive hadron
// if we want to analize p p cases and we find out 3 good tracks (X) : CalculateNComb(3,2,2)
// if we want to analize p p pip and we find out 4 good tracks (X) : CalculateNComb(4,3,2)
Inline Functions
void setContCatList(HCategory* pContCat)
void setContCatComb(HCategory* pContCat)
Bool_t generateNumberOfCombinations()
void create_pid_table()
void remove_fakes_pid_table()
void PermSwapper(Int_t* array, Int_t a, Int_t b)
void PermReverser(Int_t* array, Int_t a, Int_t b)
Bool_t FindNextPermutation(Int_t* array, Int_t count)
TClass* Class()
TClass* IsA() const
void ShowMembers(TMemberInspector& insp, char* parent)
void Streamer(TBuffer& b)
void StreamerNVirtual(TBuffer& b)
Last update: Fri Jan 26 11:56:56 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.