46 cachedBrickNumber( 0 ),
47 cachedStringNumber( 0 ),
48 cachedByteNumber( 0 ) {
83 bool cacheFound =
false;
84 int cacheAge = 999999999;
85 std::map<int,counted_brick>::iterator cache_iter =
brickMap.begin();
86 std::map<int,counted_brick>::iterator cache_icfg =
brickMap.find( cfgId );
87 std::map<int,counted_brick>::iterator cache_iend =
brickMap.end();
88 if ( cache_icfg != cache_iend ) {
89 std::pair<const int,counted_brick>&
entry = *cache_icfg;
91 cacheAge = cBrick.first;
96 std::map<int,const DTKeyedConfig*> ageMap;
98 if ( !cacheAge )
return 0;
99 while ( cache_iter != cache_iend ) {
100 std::pair<const int,counted_brick>&
entry = *cache_iter++;
102 int& brickAge = cBrick.first;
103 if ( brickAge < cacheAge ) brickAge++;
104 if ( entry.first == cfgId ) brickAge = 0;
109 while ( cache_iter != cache_iend ) {
110 std::pair<const int,counted_brick>&
entry = *cache_iter++;
112 ageMap.insert( std::pair<int,const DTKeyedConfig*>(
113 ++cBrick.first, entry.second.second ) );
119 keyRecord.
get( klh );
122 if ( keyList == 0 )
return 999;
124 std::vector<unsigned long long> checkedKeys;
126 checkedKeys.push_back( cfgId );
127 bool brickFound =
false;
129 keyList->
load( checkedKeys );
131 if ( kBrick != 0 ) brickFound = ( kBrick->
getId() == cfgId );
137 brickMap.insert( std::pair<int,counted_brick>( cfgId, cBrick ) );
144 std::map<int,const DTKeyedConfig*>::reverse_iterator iter = ageMap.rbegin();
149 int oldestId = oldestBrick->
getId();
166 std::vector<std::string>&
list ) {
174 std::vector<std::string>&
list ) {
176 get( keyRecord, cfgId,
obj );
177 if ( obj == 0 )
return;
180 while ( d_iter != d_iend ) list.push_back( *d_iter++ );
183 while ( l_iter != l_iend )
getData( keyRecord, *l_iter++, list );
189 std::cout <<
"DTConfigPluginHandler::purge "
194 std::map<int,counted_brick>::const_iterator iter =
brickMap.begin();
195 std::map<int,counted_brick>::const_iterator iend =
brickMap.end();
196 while ( iter != iend ) {
197 delete iter->second.second;
std::map< int, counted_brick > brickMap
static int maxStringNumber
void load(std::vector< unsigned long long > const &keys)
std::pair< int, const DTKeyedConfig * > counted_brick
virtual int get(const edm::EventSetup &context, int cfgId, const DTKeyedConfig *&obj)
get content
data_iterator dataBegin() const
link_iterator linkBegin() const
link_iterator linkEnd() const
std::pair< std::string, MonitorElement * > entry
static void build()
build static object
void get(HolderT &iHolder) const
T const * get(int n) const
std::vector< int >::const_iterator link_iterator
void purge()
purge db copy
virtual ~DTConfigPluginHandler()
virtual void getData(const edm::EventSetup &context, int cfgId, std::vector< std::string > &list)
static int maxBrickNumber
T const * product() const
std::vector< std::string >::const_iterator data_iterator
static DTConfigAbstractHandler * instance
tuple size
Write out results.
data_iterator dataEnd() const
How EventSelector::AcceptEvent() decides whether to accept an event for output otherwise it is excluding the probing of A single or multiple positive and the trigger will pass if any such matching triggers are PASS or EXCEPTION[A criterion thatmatches no triggers at all is detected and causes a throw.] A single negative with an expectation of appropriate bit checking in the decision and the trigger will pass if any such matching triggers are FAIL or EXCEPTION A wildcarded negative criterion that matches more than one trigger in the trigger list("!*","!HLTx*"if it matches 2 triggers or more) will accept the event if all the matching triggers are FAIL.It will reject the event if any of the triggers are PASS or EXCEPTION(this matches the behavior of"!*"before the partial wildcard feature was incorporated).Triggers which are in the READY state are completely ignored.(READY should never be returned since the trigger paths have been run