StRoot: StEEmcPool/macros/LCP/rdLcpTreeTest.C Source File

00001   float vz;
00002   int nTr;
00003   TChain *chain = new TChain("Tjas","jDst");
00004 
00005 rdLcpTree() {
00006   //  f=TFile("htree.root");
00007   //f->ls();
00008   //TH1F *h=f->Get("hpx");
00009   // h->Draw();
00010 
00011 
00012   chain->AddFile("./wrkLcp/R3011049.tree.root", -1);
00013   chain->AddFile("./wrkLcp/R3011050.tree.root", -1);
00014   chain->AddFile("./wrkLcp/R3011051.tree.root", -1);
00015   chain->AddFile("./wrkLcp/R3011052.tree.root", -1);
00016   chain->AddFile("./wrkLcp/R3012001.tree.root", -1);
00017   chain->AddFile("./wrkLcp/R3012002.tree.root", -1);
00018   chain->AddFile("./wrkLcp/R3012008.tree.root", -1);
00019   
00020   chain->SetBranchAddress("vz",&vz);  
00021   chain->SetBranchAddress("nPrim",&nTr);  
00022 
00023   
00024   int N=chain->GetEntries();
00025   printf("N=%d\n",N);
00026   system("date");
00027   int k;
00028   for(k=0;k<N;k++) {
00029     int ret=chain->GetEntry(k);  
00030     assert(ret);
00031     if(k%2000==0)printf("%d %d %d %f\n",k,ret,nTr,vz);
00032   }
00033   system("date");
00034 
00035 }