61 meanAfterPulse( 0.0 ),
62 meanResolution( 0.0 ),
63 meanEfficiency( 0.0 ) {
104 meanEfficiency = 0.0;
106 std::vector<int> chanKey;
108 chanKey.push_back( wheelId );
109 chanKey.push_back( stationId );
110 chanKey.push_back( sectorId );
111 chanKey.push_back( slId );
115 int searchStatus = constDBuf->
find( chanKey.begin(), chanKey.end(), ientry );
116 if ( !searchStatus ) {
126 meanT0 *= nsPerCount;
127 meanTtrig *= nsPerCount;
128 meanMtime *= nsPerCount;
146 return get(
id.wheel(),
198 meanT0 /= nsPerCount;
199 meanTtrig /= nsPerCount;
200 meanMtime /= nsPerCount;
203 std::vector<int> chanKey;
205 chanKey.push_back( wheelId );
206 chanKey.push_back( stationId );
207 chanKey.push_back( sectorId );
208 chanKey.push_back( slId );
210 int searchStatus = dBuf->find( chanKey.begin(), chanKey.end(), ientry );
212 if ( !searchStatus ) {
225 key. wheelId = wheelId;
227 key. sectorId = sectorId;
237 ientry = dataList.size();
238 dataList.push_back( std::pair<DTPerformanceId,DTPerformanceData>(
240 dBuf->insert( chanKey.begin(), chanKey.end(), ientry );
258 return set(
id.wheel(),
279 return dataList.begin();
284 return dataList.end();
289 std::stringstream
name;
290 name << dataVersion <<
"_map_Performance" <<
this;
300 int entryMax = dataList.size();
301 std::vector<int> chanKey;
303 while ( entryNum < entryMax ) {
308 chanKey.push_back( chan. wheelId );
310 chanKey.push_back( chan. sectorId );
311 chanKey.push_back( chan. slId );
312 dBuf->insert( chanKey.begin(), chanKey.end(), entryNum++ );
static AlgebraicMatrix initialize()
int find(ElementKey fKey, ElementKey lKey, typename DTBufferTreeTrait< Content >::outputTypeOfConstFind &cont) const
U second(std::pair< T, U > const &p)
chan
lumi = TPaveText(lowX+0.38, lowY+0.061, lowX+0.45, lowY+0.161, "NDC") lumi.SetBorderSize( 0 ) lumi...
char data[epos_bytes_allocation]