56 std::vector<int> chanKey;
58 chanKey.push_back(wheelId);
59 chanKey.push_back(stationId);
60 chanKey.push_back(sectorId);
61 chanKey.push_back(slId);
65 int searchStatus = constDBuf->
find(chanKey.begin(), chanKey.end(), ientry);
76 return get(
id.wheel(),
id.station(),
id.sector(),
id.superLayer(),
t0min,
t0max);
90 std::vector<int> chanKey;
92 chanKey.push_back(wheelId);
93 chanKey.push_back(stationId);
94 chanKey.push_back(sectorId);
95 chanKey.push_back(slId);
97 int searchStatus = dBuf->find(chanKey.begin(), chanKey.end(), ientry);
113 ientry = dataList.size();
114 dataList.push_back(std::pair<DTRangeT0Id, DTRangeT0Data>(key, data));
115 dBuf->insert(chanKey.begin(), chanKey.end(), ientry);
123 return set(
id.wheel(),
id.station(),
id.sector(),
id.superLayer(),
t0min,
t0max);
131 std::stringstream
name;
132 name << dataVersion <<
"_map_RangeT0" <<
this;
140 int entryMax = dataList.size();
141 std::vector<int> chanKey;
143 while (entryNum < entryMax) {
147 chanKey.push_back(chan.
wheelId);
150 chanKey.push_back(chan.
slId);
151 dBuf->insert(chanKey.begin(), chanKey.end(), entryNum++);
static AlgebraicMatrix initialize()
std::string mapName() const
read and store full content
const_iterator end() const
int get(int wheelId, int stationId, int sectorId, int slId, int &t0min, int &t0max) const
const std::string & version() const
access version
int find(ElementKey fKey, ElementKey lKey, typename DTBufferTreeTrait< Content >::outputTypeOfConstFind &cont) const
U second(std::pair< T, U > const &p)
std::vector< std::pair< DTRangeT0Id, DTRangeT0Data > >::const_iterator const_iterator
Access methods to data.
std::vector< std::pair< DTRangeT0Id, DTRangeT0Data > > dataList
void clear()
reset content
chan
lumi = TPaveText(lowX+0.38, lowY+0.061, lowX+0.45, lowY+0.161, "NDC") lumi.SetBorderSize( 0 ) lumi...
const_iterator begin() const
char data[epos_bytes_allocation]
int set(int wheelId, int stationId, int sectorId, int slId, int t0min, int t0max)
DTBufferTree< int, int > * dBuf