67 return get(wheelId, stationId, sectorId, slId, 0, 0,
tTrig, tTrms, kFact,
unit);
80 tTrig = tTrms = kFact = 0.0;
82 std::vector<int> chanKey;
84 chanKey.push_back(wheelId);
85 chanKey.push_back(stationId);
86 chanKey.push_back(sectorId);
87 chanKey.push_back(slId);
88 chanKey.push_back(layerId);
89 chanKey.push_back(cellId);
91 int searchStatus =
dBuf->
find(chanKey.begin(), chanKey.end(), ientry);
125 return get(wheelId, stationId, sectorId, slId, 0, 0,
tTrig,
unit);
139 int status =
get(wheelId, stationId, sectorId, slId, layerId, cellId, tMean, tTrms, kFact,
unit);
140 tTrig = tMean + (kFact * tTrms);
174 return set(wheelId, stationId, sectorId, slId, 0, 0,
tTrig, tTrms, kFact,
unit);
192 std::vector<int> chanKey;
194 chanKey.push_back(wheelId);
195 chanKey.push_back(stationId);
196 chanKey.push_back(sectorId);
197 chanKey.push_back(slId);
198 chanKey.push_back(layerId);
199 chanKey.push_back(cellId);
201 int searchStatus =
dBuf->
find(chanKey.begin(), chanKey.end(), ientry);
211 key.wheelId = wheelId;
212 key.stationId = stationId;
213 key.sectorId = sectorId;
215 key.layerId = layerId;
223 dBuf->
insert(chanKey.begin(), chanKey.end(), ientry);
255 std::stringstream
name;
265 std::vector<int> chanKey;
267 while (entryNum < entryMax) {
271 chanKey.push_back(
chan.wheelId);
272 chanKey.push_back(
chan.stationId);
273 chanKey.push_back(
chan.sectorId);
274 chanKey.push_back(
chan.slId);
275 chanKey.push_back(
chan.layerId);
276 chanKey.push_back(
chan.cellId);
277 dBuf->
insert(chanKey.begin(), chanKey.end(), entryNum++);