42 dataVersion( version ) {
102 std::vector<int> chanKey;
104 chanKey.push_back( wheelId );
105 chanKey.push_back( stationId );
106 chanKey.push_back( sectorId );
107 chanKey.push_back( slId );
109 int searchStatus =
dBuf->
find( chanKey.begin(), chanKey.end(), ientry );
110 if ( !searchStatus ) {
124 return get(
id.wheel(),
168 std::vector<int> chanKey;
170 chanKey.push_back( wheelId );
171 chanKey.push_back( stationId );
172 chanKey.push_back( sectorId );
173 chanKey.push_back( slId );
175 int searchStatus =
dBuf->
find( chanKey.begin(), chanKey.end(), ientry );
177 if ( !searchStatus ) {
185 key. wheelId = wheelId;
187 key. sectorId = sectorId;
193 dataList.push_back( std::pair<DTRangeT0Id,DTRangeT0Data>( key, data ) );
194 dBuf->
insert( chanKey.begin(), chanKey.end(), ientry );
206 return set(
id.wheel(),
225 std::stringstream
name;
242 std::vector<int> chanKey;
244 while ( entryNum < entryMax ) {
249 chanKey.push_back( chan. wheelId );
251 chanKey.push_back( chan. sectorId );
252 chanKey.push_back( chan. slId );
253 dBuf->
insert( chanKey.begin(), chanKey.end(), entryNum++ );
std::string mapName() const
const_iterator end() const
std::vector< std::pair< DTRangeT0Id, DTRangeT0Data > >::const_iterator const_iterator
Access methods to data.
int insert(ElementKey fKey, ElementKey lKey, const Content &cont)
int get(int wheelId, int stationId, int sectorId, int slId, int &t0min, int &t0max) const
const std::string & version() const
access version
U second(std::pair< T, U > const &p)
std::vector< std::pair< DTRangeT0Id, DTRangeT0Data > > dataList
void clear()
reset content
int find(ElementKey fKey, ElementKey lKey, Content &cont)
void cacheMap() const
read and store full content
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