43 dataVersion( version ),
101 std::vector<int> chanKey;
103 chanKey.push_back( wheelId );
104 chanKey.push_back( stationId );
105 chanKey.push_back( sectorId );
106 chanKey.push_back( slId );
107 chanKey.push_back( layerId );
108 chanKey.push_back( partId );
110 int searchStatus =
dBuf->
find( chanKey.begin(), chanKey.end(), ientry );
111 if ( !searchStatus ) {
132 return get(
id.wheel(),
138 fCell, lCell, flagA, flagC, flagS );
146 flagA = flagC = flagS = 0;
147 int iCell =
id.wire();
151 fCheck =
get(
id.wheel(),
157 flagA, flagC, flagS );
158 if ( ( fCheck == 0 ) &&
159 ( fCell <= iCell ) &&
160 ( lCell >= iCell ) )
return 0;
161 fCheck =
get(
id.wheel(),
167 flagA, flagC, flagS );
168 if ( ( fCheck == 0 ) &&
169 ( fCell <= iCell ) &&
170 ( lCell >= iCell ) )
return 0;
171 flagA = flagC = flagS = 0;
180 while ( iter != iend ) {
181 const std::pair<DTHVStatusId,DTHVStatusData>& entry = *iter++;
184 int offA = data.
flagA & 1;
185 int offC = data.
flagC & 1;
186 int offS = data.
flagS & 1;
187 if ( offA || offC || offS )
198 while ( iter != iend ) {
199 const std::pair<DTHVStatusId,DTHVStatusData>& entry = *iter++;
202 if ( hvId. wheelId !=
id. wheel() )
continue;
203 if ( hvId.
stationId !=
id.station() )
continue;
204 if ( hvId. sectorId !=
id. sector() )
continue;
205 int offA = data.
flagA & 1;
206 int offC = data.
flagC & 1;
207 int offS = data.
flagS & 1;
208 if ( offA || offC || offS )
219 while ( iter != iend ) {
220 const std::pair<DTHVStatusId,DTHVStatusData>& entry = *iter++;
234 while ( iter != iend ) {
235 const std::pair<DTHVStatusId,DTHVStatusData>& entry = *iter++;
238 if ( hvId. wheelId !=
id. wheel() )
continue;
239 if ( hvId.
stationId !=
id.station() )
continue;
240 if ( hvId. sectorId !=
id. sector() )
continue;
279 std::vector<int> chanKey;
281 chanKey.push_back( wheelId );
282 chanKey.push_back( stationId );
283 chanKey.push_back( sectorId );
284 chanKey.push_back( slId );
285 chanKey.push_back( layerId );
286 chanKey.push_back( partId );
288 int searchStatus =
dBuf->
find( chanKey.begin(), chanKey.end(), ientry );
290 if ( !searchStatus ) {
301 key. wheelId = wheelId;
303 key. sectorId = sectorId;
305 key. layerId = layerId;
306 key. partId = partId;
316 dBuf->
insert( chanKey.begin(), chanKey.end(), ientry );
332 return set(
id.wheel(),
338 fCell, lCell, flagA, flagC, flagS );
503 std::stringstream
name;
515 std::vector<int> chanKey;
517 while ( entryNum < entryMax ) {
522 chanKey.push_back( chan. wheelId );
524 chanKey.push_back( chan. sectorId );
525 chanKey.push_back( chan. slId );
526 chanKey.push_back( chan. layerId );
527 chanKey.push_back( chan. partId );
528 dBuf->
insert( chanKey.begin(), chanKey.end(), entryNum++ );
std::vector< std::pair< DTHVStatusId, DTHVStatusData > > dataList
int get(int wheelId, int stationId, int sectorId, int slId, int layerId, int partId, int &fCell, int &lCell, int &flagA, int &flagC, int &flagS) const
get content
int setFlagS(int wheelId, int stationId, int sectorId, int slId, int layerId, int partId, int flag)
void clear()
reset content
int setFlagC(int wheelId, int stationId, int sectorId, int slId, int layerId, int partId, int flag)
int find(ElementKey fKey, ElementKey lKey, typename DTBufferTreeTrait< Content >::outputTypeOfConstFind &cont) const
int setFlagA(int wheelId, int stationId, int sectorId, int slId, int layerId, int partId, int flag)
U second(std::pair< T, U > const &p)
std::string mapName() const
read and store full content
int offChannelsNumber() const
edm::ConstRespectingPtr< DTBufferTree< int, int > > dBuf
int badChannelsNumber() const
std::vector< std::pair< DTHVStatusId, DTHVStatusData > >::const_iterator const_iterator
Access methods to data.
int set(int wheelId, int stationId, int sectorId, int slId, int layerId, int partId, int fCell, int lCell, int flagA, int flagC, int flagS)
char data[epos_bytes_allocation]
int insert(ElementKey fKey, ElementKey lKey, Content cont)
const_iterator end() const
const_iterator begin() const
const std::string & version() const
access version