7 #include <TBranchElement.h>
8 #include <TClonesArray.h>
11 #include <AliTrackReference.h>
13 #include "Reve/Track.h"
14 #include "Reve/RenderElement.h"
19 //______________________________________________________________________
24 using namespace Alieve;
29 KineTools::KineTools()
32 /**************************************************************************/
34 void KineTools::SetDaughterPathMarks(RenderElement* cont, AliStack* stack, Bool_t recurse)
36 // Import daughters birth points.
38 RenderElement::List_i iter = cont->BeginChildren();
40 while(iter != cont->EndChildren())
42 Track* track = dynamic_cast<Track*>(*iter);
43 TParticle* p = stack->Particle(track->GetLabel());
44 if(p->GetNDaughters()) {
45 Int_t d0 = p->GetDaughter(0), d1 = p->GetDaughter(1);
46 for(int d=d0; d>0 && d<=d1; ++d)
48 TParticle* dp = stack->Particle(d);
49 Reve::PathMark* pm = new PathMark(PathMark::Daughter);
50 pm->V.Set(dp->Vx(), dp->Vy(), dp->Vz());
51 pm->P.Set(dp->Px(), dp->Py(), dp->Pz());
53 track->AddPathMark(pm);
56 SetDaughterPathMarks(track, stack, recurse);
62 /**************************************************************************/
67 bool operator()(PathMark* const & a, PathMark* const & b)
68 { return a->time < b->time; }
71 void slurp_tracks(map<Int_t, Track*>& tracks, RenderElement* cont, Bool_t recurse)
73 RenderElement::List_i citer = cont->BeginChildren();
74 while(citer != cont->EndChildren())
76 Track* track = dynamic_cast<Track*>(*citer);
77 tracks[track->GetLabel()] = track;
79 slurp_tracks(tracks, track, recurse);
86 void KineTools::SetTrackReferences(RenderElement* cont, TTree* treeTR, Bool_t recurse)
88 // set decay and reference points
90 static const Exc_t eH("KineTools::ImportPathMarks");
93 map<Int_t, Track*> tracks;
94 slurp_tracks(tracks, cont, recurse);
96 Int_t nPrimaries = (Int_t) treeTR->GetEntries();
97 TIter next(treeTR->GetListOfBranches());
101 while ((el = (TBranchElement*) next()))
103 if (strcmp("AliRun",el->GetName()) == 0)
106 TClonesArray* arr = 0;
107 el->SetAddress(&arr);
108 for (Int_t iPrimPart = 0; iPrimPart<nPrimaries; iPrimPart++)
110 el->GetEntry(iPrimPart);
112 Int_t last_label = -1;
113 map<Int_t, Track*>::iterator iter = tracks.end();
114 Int_t Nent = arr->GetEntriesFast();
115 for (Int_t iTrackRef = 0; iTrackRef < Nent; iTrackRef++)
117 AliTrackReference* atr = (AliTrackReference*)arr->UncheckedAt(iTrackRef);
119 Int_t label = atr->GetTrack();
121 throw(eH + Form("negative label for entry %d in branch %s.",
122 iTrackRef, el->GetName()));
124 if(label != last_label) {
125 iter = tracks.find(label);
129 if (iter != tracks.end()) {
130 PathMark* pm = new PathMark(isRef ? PathMark::Reference : PathMark::Decay);
131 pm->V.Set(atr->X(),atr->Y(), atr->Z());
132 pm->P.Set(atr->Px(),atr->Py(), atr->Pz());
133 pm->time = atr->GetTime();
134 Track* track = iter->second;
135 track->AddPathMark(pm);
138 } // loop primaries, clones arrays
140 } // end loop through top branches
143 void KineTools::SortPathMarks(RenderElement* cont, Bool_t recurse)
145 // Sort path-marks for all tracks by time.
148 map<Int_t, Track*> tracks;
149 slurp_tracks(tracks, cont, recurse);
152 for(map<Int_t, Track*>::iterator j=tracks.begin(); j!=tracks.end(); ++j)
154 j->second->SortPathMarksByTime();