36 nsPerCount( 25.0 / 32.0 ),
44 dataVersion( version ),
45 nsPerCount( 25.0 / 32.0 ),
105 std::vector<int> chanKey;
107 chanKey.push_back( wheelId );
108 chanKey.push_back( stationId );
109 chanKey.push_back( sectorId );
111 int searchStatus =
dBuf->
find( chanKey.begin(), chanKey.end(), ientry );
112 if ( !searchStatus ) {
130 return get(
id.wheel(),
143 get( wheelId, stationId, sectorId, cl, ph,
unit );
145 else return ( cl *
clock() ) + ph;
208 std::vector<int> chanKey;
210 chanKey.push_back( wheelId );
211 chanKey.push_back( stationId );
212 chanKey.push_back( sectorId );
214 int searchStatus =
dBuf->
find( chanKey.begin(), chanKey.end(), ientry );
216 if ( !searchStatus ) {
224 key. wheelId = wheelId;
226 key. sectorId = sectorId;
233 dBuf->
insert( chanKey.begin(), chanKey.end(), ientry );
246 return set(
id.wheel(),
274 std::stringstream
name;
291 std::vector<int> chanKey;
293 while ( entryNum < entryMax ) {
298 chanKey.push_back( chan. wheelId );
300 chanKey.push_back( chan. sectorId );
301 dBuf->
insert( chanKey.begin(), chanKey.end(), entryNum++ );
std::vector< std::pair< DTTPGParametersId, DTTPGParametersData > >::const_iterator const_iterator
Access methods to data.
void clear()
reset content
const std::string & version() const
access version
const_iterator begin() const
int set(int wheelId, int stationId, int sectorId, int nc, float ph, DTTimeUnits::type unit)
int insert(ElementKey fKey, ElementKey lKey, const Content &cont)
U second(std::pair< T, U > const &p)
const_iterator end() const
DTBufferTree< int, int > * dBuf
float totalTime(int wheelId, int stationId, int sectorId, DTTimeUnits::type unit) const
int find(ElementKey fKey, ElementKey lKey, Content &cont)
char data[epos_bytes_allocation]
std::string mapName() const
std::vector< std::pair< DTTPGParametersId, DTTPGParametersData > > dataList
int get(int wheelId, int stationId, int sectorId, int &nc, float &ph, DTTimeUnits::type unit) const
get content
void cacheMap() const
read and store full content