41 cachedBrickNumber( 0 ),
42 cachedStringNumber( 0 ),
43 cachedByteNumber( 0 ) {
78 bool cacheFound =
false;
79 int cacheAge = 999999999;
80 std::map<int,counted_brick>::iterator cache_iter =
brickMap.begin();
81 std::map<int,counted_brick>::iterator cache_icfg =
brickMap.find( cfgId );
82 std::map<int,counted_brick>::iterator cache_iend =
brickMap.end();
83 if ( cache_icfg != cache_iend ) {
84 std::pair<const int,counted_brick>& entry = *cache_icfg;
86 cacheAge = cBrick.first;
91 std::map<int,const DTKeyedConfig*> ageMap;
93 if ( !cacheAge )
return 0;
94 while ( cache_iter != cache_iend ) {
95 std::pair<const int,counted_brick>& entry = *cache_iter++;
97 int& brickAge = cBrick.first;
98 if ( brickAge < cacheAge ) brickAge++;
99 if ( entry.first == cfgId ) brickAge = 0;
104 while ( cache_iter != cache_iend ) {
105 std::pair<const int,counted_brick>& entry = *cache_iter++;
107 ageMap.insert( std::pair<int,const DTKeyedConfig*>(
108 ++cBrick.first, entry.second.second ) );
114 keyRecord.
get( klh );
117 if ( keyList == 0 )
return 999;
119 std::vector<unsigned long long> checkedKeys;
120 boost::shared_ptr<DTKeyedConfig> kBrick;
121 checkedKeys.push_back( cfgId );
122 bool brickFound =
false;
124 keyList->
load( checkedKeys );
126 if ( kBrick.get() ) brickFound = ( kBrick->getId() == cfgId );
132 brickMap.insert( std::pair<int,counted_brick>( cfgId, cBrick ) );
139 std::map<int,const DTKeyedConfig*>::reverse_iterator iter = ageMap.rbegin();
144 int oldestId = oldestBrick->
getId();
161 std::vector<std::string>&
list ) {
169 std::vector<std::string>&
list ) {
171 get( keyRecord, cfgId,
obj );
172 if ( obj == 0 )
return;
175 while ( d_iter != d_iend ) list.push_back( *d_iter++ );
178 while ( l_iter != l_iend )
getData( keyRecord, *l_iter++, list );
184 std::cout <<
"DTConfigPluginHandler::purge "
189 std::map<int,counted_brick>::const_iterator iter =
brickMap.begin();
190 std::map<int,counted_brick>::const_iterator iend =
brickMap.end();
191 while ( iter != iend ) {
192 delete iter->second.second;
static const int maxBrickNumber
std::map< int, counted_brick > brickMap
std::pair< int, const DTKeyedConfig * > counted_brick
virtual int get(const edm::EventSetup &context, int cfgId, const DTKeyedConfig *&obj)
get content
boost::shared_ptr< T > get(size_t n) const
static const int maxByteNumber
data_iterator dataBegin() const
link_iterator linkBegin() const
link_iterator linkEnd() const
static void build()
build static object
void get(HolderT &iHolder) 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 const int maxStringNumber
T const * product() const
std::vector< std::string >::const_iterator data_iterator
static DTConfigAbstractHandler * instance
void load(const std::vector< unsigned long long > &keys)
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