40 dataVersion( version ),
88 std::vector<int> chanKey;
90 chanKey.push_back( wheelId );
91 chanKey.push_back( stationId );
92 chanKey.push_back( sectorId );
93 chanKey.push_back( slId );
95 int searchStatus =
dBuf->
find( chanKey.begin(), chanKey.end(), ientry );
96 if ( !searchStatus ) {
110 return get(
id.wheel(),
143 std::vector<int> chanKey;
145 chanKey.push_back( wheelId );
146 chanKey.push_back( stationId );
147 chanKey.push_back( sectorId );
148 chanKey.push_back( slId );
150 int searchStatus =
dBuf->
find( chanKey.begin(), chanKey.end(), ientry );
152 if ( !searchStatus ) {
160 key. wheelId = wheelId;
162 key. sectorId = sectorId;
168 dataList.push_back( std::pair<DTRangeT0Id,DTRangeT0Data>( key, data ) );
169 dBuf->
insert( chanKey.begin(), chanKey.end(), ientry );
181 return set(
id.wheel(),
200 std::stringstream
name;
212 std::vector<int> chanKey;
214 while ( entryNum < entryMax ) {
219 chanKey.push_back( chan. wheelId );
221 chanKey.push_back( chan. sectorId );
222 chanKey.push_back( chan. slId );
223 dBuf->
insert( chanKey.begin(), chanKey.end(), entryNum++ );
std::string mapName() const
read and store full content
const_iterator end() const
std::vector< std::pair< DTRangeT0Id, DTRangeT0Data > >::const_iterator const_iterator
Access methods to data.
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 > > dataList
void clear()
reset content
const_iterator begin() const
char data[epos_bytes_allocation]
int insert(ElementKey fKey, ElementKey lKey, Content cont)
int set(int wheelId, int stationId, int sectorId, int slId, int t0min, int t0max)
DTBufferTree< int, int > * dBuf