25{
26
27
28 {
30
31 std::cout << "\n\nconstructing ..." << std::endl;
32
33 TFile
f(
"tree.root",
"recreate");
34 TTree *
tree =
new TTree(
"tree",
"tree");
35
36
37 tree->Branch(
"TIDA::Event",
"TIDA::Event",&
h,6400, 1);
38
39 std::string
ars[3] = {
"ars0",
"ars1",
"ars2" };
40
41 std::cout << "\n\nfilling ..." << std::endl;
42
43 for (
int i=0;
i<3 ;
i++ ) {
44
46
49
50 std::cout <<
"\n\nEvent " <<
i << std::endl;
51
52 for ( int j=0 ; j<2 ; j++ ) {
53
54 std::cout << "\n\tRoi " << j << std::endl;
55
56 h->addChain( ars[j] );
57
59
60
61
62
64 j+3., j+3-1.1, j+3+1.1,
65 j+2.1, j+2.1-100, j+2.1+100 );
66
67 for (
int ij=0 ; ij<j+1 ; ij++ ) roi1.push_back(
TIDARoiDescriptor( ij, ij-0.2, ij+0.2,
68 ij, ij-0.2, ij+0.2,
69 ij, ij-0.2, ij+0.2 ) );
70
71 std::cout << "Roi " << roi1 << std::endl;
72
74 j+3., j+3-1.1, j+3+1.1,
75 j+2.1, j+2.1-100, j+2.1+100 );
76
78
80
81 }
82
83 cout <<
"TIDA::Event " << *
h << endl;
84
86
87 }
88
89 std::cout << "\n\nwriting ..." << std::endl;
90
91
94
95 }
96
97
98 {
99 std::cout << "\n\nreading ..." << std::endl;
100
102
103 TFile
f(
"tree.root");
104 TTree *
tree = (TTree*)
f.Get(
"tree");
105
106
107 tree->SetBranchAddress(
"TIDA::Event", &hh );
108
109 for (
int i=0;
i<
tree->GetEntries() ;
i++ ) {
110
112
113 cout <<
"TIDA::Event " <<
i <<
" " << *
hh << endl;
114
115 }
116
118
119 }
120
121 return 0;
122}
Header file for AthHistogramAlgorithm.
Describes the Region of Ineterest geometry It has basically 8 parameters.