30{
31
32
33 const int NST = 4;
34 const int NDET = 4;
35 const int NTRAINS = 4;
36
37
38 std::vector<float> vecTDHit[NST][NDET][NTRAINS];
39
40 for (
int i=0;
i<NST; ++
i)
41 {
42 for (int j=0; j<NDET; ++j)
43 {
44 for (
int k=0;
k<NTRAINS; ++
k)
45 {
46 vecTDHit[
i][j][
k].clear();
47 }
48 }
49 }
50
51
52 std::list<TDHIT>::const_iterator
iter;
53 for (iter=ListTDHits.begin(); iter!=ListTDHits.end(); ++iter)
54 {
56 {
57
58
59 if ((*iter).fADC < 100) vecTDHit[(*iter).nStationID][(*iter).nSensitiveElementID][((*iter).nDetectorID)%4].push_back( (*iter).fTDC + int(((*iter).nDetectorID)/4)*0.001 );
60 else {
61 vecTDHit[(*iter).nStationID][(*iter).nSensitiveElementID][((*iter).nDetectorID)%4].push_back(0.0);
62 }
63 }
64 }
65
66
67
68 for (
int i=0;
i<NST; ++
i)
69 {
70 for (int j=0; j<NDET; ++j)
71 {
72 for (
int k=0;
k<NTRAINS; ++
k)
73 {
74 int TrSize = vecTDHit[
i][j][
k].size();
75 float TrTime = 0.;
76 int TrSat = 0;
77 if ( TrSize>0 )
78 {
79 for (
int l=0;
l<TrSize; ++
l)
80 {
81 TrTime += (vecTDHit[
i][j][
k].at(l));
82 if ( vecTDHit[i][j][k].at(l)==0.0) ++TrSat;
83 }
84
85 if( TrSize!=TrSat) TrTime /= (TrSize-TrSat);
86
88 if (1)
89 {
97 }
98
99 }
100 }
101 }
102 }
103
104
105
106
107 return StatusCode::SUCCESS;
108}
struct _TDRESULT TDRESULT
std::vector< Result > Results
l
Printing final latex table to .tex output file.