48 {
49
50 MsgStream log(
msgSvc(),
"TreeDedxSimDataCnv");
51
55
56 TBufferFile *buf1 = new TBufferFile(TBuffer::kRead);
57 TBufferFile *buf2 = new TBufferFile(TBuffer::kRead);
58
59 buf1->SetBuffer((*records)["TH1F_Col"],51200000,kFALSE);
60 buf2->SetBuffer((*records)["bin"],512000,kFALSE);
61
62 std::cout<<" SftVer is "<<(*records)["SftVer"];
63 std::cout<<" CalVerSft is "<<(*records)["CalParVer"];
64 std::cout<<" File name is "<<(*records)["FileName"]<<std::endl;
65
66
67
68
69 TTree* tree = new TTree();
70 tree->Streamer(*buf1);
71
72 TTree*
bin =
new TTree();
74
75 TH1F *h1=new TH1F();
76
77 std::vector<TH1F> hist;
78 std::vector<double> hRange;
79
80 int cnt;
82 int entries=tree->GetEntries();
83 for(cnt=0; cnt<entries; cnt++){
85 gROOT->cd();
86 TH1F *h2=new TH1F();
87 h2=(TH1F*)h1->Clone();
88 hist.push_back(*h2);
89 }
90 double betagamma[5000];
91 int totalNum;
92 int bgNum;
97
98 for(cnt=0; cnt<bgNum; cnt++){
99 hRange.push_back(betagamma[cnt]);
100 }
105 refpObject=tmpObject;
106
107 delete tree;
109
110 return StatusCode::SUCCESS;
111
112
113}
data SetBranchAddress("time",&time)
*******INTEGER m_nBinMax INTEGER m_NdiMax !No of bins in histogram for cell exploration division $ !Last vertex $ !Last active cell $ !Last cell in buffer $ !No of sampling when dividing cell $ !No of function total $ !Flag for random ceel for $ !Flag for type of for WtMax $ !Flag which decides whether vertices are included in the sampling $ entire domain is hyp !Maximum effective eevents per bin
void setHistNo(const int No)
void setRange(const vector< double > *hRange)
void setHist(const vector< TH1F > *hist)
void setRangeNo(const int No)
virtual DatabaseRecord * pp()