31 |
#include <TTree.h> |
#include <TTree.h> |
32 |
#include <TFriendElement.h> |
#include <TFriendElement.h> |
33 |
#include <TChain.h> |
#include <TChain.h> |
34 |
|
#include <TChainElement.h> |
35 |
#include <TFile.h> |
#include <TFile.h> |
36 |
#include <TList.h> |
#include <TList.h> |
37 |
#include <TKey.h> |
#include <TKey.h> |
39 |
#include <TSystemDirectory.h> |
#include <TSystemDirectory.h> |
40 |
#include <TSQLServer.h> |
#include <TSQLServer.h> |
41 |
|
|
42 |
|
#include <stdlib.h> |
43 |
#include <iostream> |
#include <iostream> |
44 |
|
#include <iomanip> |
45 |
|
using namespace std; |
46 |
|
|
47 |
#define NCLONES 10 |
#define NCLONES 10 |
48 |
|
|
62 |
TrkTrack* trk_track; |
TrkTrack* trk_track; |
63 |
CaloTrkVar* calo_track; |
CaloTrkVar* calo_track; |
64 |
ToFTrkVar* tof_track; |
ToFTrkVar* tof_track; |
65 |
|
Int_t pscore; |
66 |
|
Int_t iscore; |
67 |
bool candeleteobj; |
bool candeleteobj; |
68 |
|
|
69 |
// TClonesArray *Cluster; ///< clusters (if stored) |
// TClonesArray *Cluster; ///< clusters (if stored) |
79 |
void Clear(Option_t *option){Clear();}; |
void Clear(Option_t *option){Clear();}; |
80 |
void Delete(); |
void Delete(); |
81 |
|
|
82 |
|
Bool_t IsSolved(){if ((pscore-iscore)>0) return true; return false;}; |
83 |
|
Int_t GetScore(){return (pscore-iscore);}; |
84 |
|
Int_t GetPScore(){return (pscore);}; |
85 |
|
Int_t GetIScore(){return (iscore);}; |
86 |
|
void SetPScore(Int_t p){pscore=p;}; |
87 |
|
void SetIScore(Int_t i){iscore=i;}; |
88 |
|
|
89 |
TrkTrack* GetTrkTrack(){return trk_track;}; |
TrkTrack* GetTrkTrack(){return trk_track;}; |
90 |
CaloTrkVar* GetCaloTrack(){return calo_track;}; |
CaloTrkVar* GetCaloTrack(){return calo_track;}; |
91 |
ToFTrkVar* GetToFTrack(){return tof_track;}; |
ToFTrkVar* GetToFTrack(){return tof_track;}; |
120 |
TTree* run_tree_clone; |
TTree* run_tree_clone; |
121 |
TChain* sel_tree; |
TChain* sel_tree; |
122 |
TTree* sel_tree_clone; |
TTree* sel_tree_clone; |
123 |
|
|
124 |
|
// ------------------------------------------- |
125 |
|
// variables to store total live and dead time |
126 |
|
// ------------------------------------------- |
127 |
|
ULong64_t totdltime[3];// 0=live 1=dead 2=n.events |
128 |
|
|
129 |
// --------------------------------- |
// --------------------------------- |
130 |
// variables to retrieve level0 info |
// variables to retrieve level0 info |
131 |
// --------------------------------- |
// --------------------------------- |
133 |
TTree* l0_tree; |
TTree* l0_tree; |
134 |
Int_t iroot; |
Int_t iroot; |
135 |
Int_t prevshift; // to remember if any shift is needed to synchronize l0 and l2 data instead of calculating any time |
Int_t prevshift; // to remember if any shift is needed to synchronize l0 and l2 data instead of calculating any time |
136 |
|
Int_t maxshift; // EMILIANO maximum discrepancy between L2 and L0 data (the bigger the better concering synch but the processing speed drops) default = 10 |
137 |
// -------------------------------------------- |
// -------------------------------------------- |
138 |
// variables to store Level0 info (if required) |
// variables to store Level0 info (if required) |
139 |
// -------------------------------------------- |
// -------------------------------------------- |
204 |
|
|
205 |
Bool_t RUN; |
Bool_t RUN; |
206 |
|
|
207 |
|
Bool_t ISGP; //GP simulation |
208 |
|
|
209 |
|
|
210 |
Int_t SELLI; //trees of selected events (there is a selection list) |
Int_t SELLI; //trees of selected events (there is a selection list) |
211 |
|
|
212 |
void Initialize(); |
void Initialize(); |
231 |
void GetWhichTrees(TFile*); |
void GetWhichTrees(TFile*); |
232 |
|
|
233 |
TTree* GetPamTree(TFile*,TString); |
TTree* GetPamTree(TFile*,TString); |
234 |
TTree* GetPamTree(TFile* f){return GetPamTree(f,"");}; |
TTree* GetPamTree(TFile* f){return GetPamTree(f,"");}; |
235 |
|
|
236 |
TList* GetListOfLevel2Files(TString, TString); |
TList* GetListOfLevel2Files(TString, TString); |
237 |
Bool_t CheckLevel2File(TString); |
Bool_t CheckLevel2File(TString); |
238 |
TChain* GetPamTree(TList*,TString); |
TChain* GetPamTree(TList*,TString); |
239 |
TChain* GetPamTree(TString ddir,TString list,TString detlist){ return GetPamTree(GetListOfLevel2Files(ddir,list),detlist); }; |
TChain* GetPamTree(TString ddir,TString list,TString detlist){ return GetPamTree(GetListOfLevel2Files(ddir,list),detlist); }; |
240 |
TChain* GetPamTree(TString ddir,TString list){ return GetPamTree(GetListOfLevel2Files(ddir,list),""); }; |
TChain* GetPamTree(TString ddir,TString list){ return GetPamTree(GetListOfLevel2Files(ddir,list),""); }; |
241 |
|
TChain* AddFriend(TString); |
242 |
|
|
243 |
TTree* GetRunTree(TFile*); |
TTree* GetRunTree(TFile*); |
244 |
TChain* GetRunTree(TList*); |
TChain* GetRunTree(TList*); |
245 |
TChain* GetRunTree(TString ddir,TString list){ return GetRunTree(GetListOfLevel2Files(ddir,list)); }; |
TChain* GetRunTree(TString ddir,TString list){ return GetRunTree(GetListOfLevel2Files(ddir,list)); }; |
246 |
|
Bool_t UpdateRunInfo(Long64_t);//{ return UpdateRunInfo(run_tree,iev); }; |
247 |
Bool_t UpdateRunInfo(TTree *,Long64_t); |
Bool_t UpdateRunInfo(TTree *,Long64_t); |
248 |
Bool_t UpdateRunInfo(TChain *,Long64_t); |
Bool_t UpdateRunInfo(TChain *,Long64_t); |
|
Bool_t UpdateRunInfo(Long64_t iev);//{ return UpdateRunInfo(run_tree,iev); }; |
|
249 |
|
|
250 |
void CreateCloneTrees0(TChain *fChain, TFile* file); |
void CreateCloneTrees0(TChain *fChain, TFile* file); |
251 |
void CreateCloneTrees(TFile* file); |
void CreateCloneTrees(TFile* file); |
261 |
Int_t GetEntry(Long64_t); |
Int_t GetEntry(Long64_t); |
262 |
Int_t GetYodaEntry(); |
Int_t GetYodaEntry(); |
263 |
|
|
264 |
|
void SetMaxShift(Int_t sh){ maxshift = sh; return;}; // EMILIANO method to change the maxshift variable |
265 |
|
|
266 |
Long64_t GetEntries(){return pam_tree->GetEntries();}; |
Long64_t GetEntries(){return pam_tree->GetEntries();}; |
267 |
TChain* GetPamTree(){return pam_tree;}; |
TChain* GetPamTree(){return pam_tree;}; |
268 |
TChain* GetRunTree(){return run_tree;}; |
TChain* GetRunTree(){return run_tree;}; |
364 |
|
|
365 |
Int_t IsSELLI(){return SELLI;}; //trees of selected events (there is a selection list) |
Int_t IsSELLI(){return SELLI;}; //trees of selected events (there is a selection list) |
366 |
|
|
367 |
|
Bool_t IsGP(){return ISGP;}; |
368 |
|
|
369 |
|
void SetGP(Bool_t tt){ISGP=tt;}; |
370 |
|
|
371 |
|
|
372 |
ClassDef(PamLevel2,1); |
ClassDef(PamLevel2,1); |
373 |
}; |
}; |
374 |
|
|