22 template <
typename T >
29 typedef typename std::pair< EcalLogicID, T >
DataItem;
30 typedef typename std::map< EcalLogicID, T >
DataMap ;
32 typedef typename std::map< EcalLogicID, T >::iterator
map_iterator;
35 template <
typename U >
45 return ( diff_time<0 );
48 std::pair< Tm, std::pair< EcalLogicID, U > >
m_iData;
72 std::cout <<
" we are in getReducedDataList "<< std::endl;
75 std::cout <<
" created iterator "<< std::endl;
81 Tm t = (*i).m_iData.first;
83 bool new_time_change=
true;
93 for(it =my_new_list->begin(); it!= my_new_list->end(); ++it) {
98 std::pair< Tm, DataMap > pair_new_list = *it;
100 Tm t_l = pair_new_list.first;
103 for(ip =dd.begin(); ip!= dd.end(); ++ip) {
105 T dcs_dat = ip->second;
106 if(ecid.
getLogicID()==d.first.getLogicID() ) last_state= dcs_dat.getStatus();
110 if(diff_time<0) diff_time=-diff_time;
115 new_time_change=
false;
117 the_data = pair_new_list.second;
124 if(last_state != d.second.getStatus()){
125 if(!new_time_change ) {
126 std::pair< Tm, DataMap > pair_new_list = *it_good;
127 Tm t_good = pair_new_list.first;
128 the_data = pair_new_list.second;
130 std::pair< Tm, DataMap > pair_new_good;
131 pair_new_good.first=t_good;
132 pair_new_good.second=the_data;
134 my_new_list->erase(it_good);
135 my_new_list->push_back(pair_new_good);
138 }
else if(new_time_change) {
140 std::pair< Tm, DataMap > p_new;
145 my_new_list->push_back(p_new);
150 if(my_new_list->size() > s_old) {
151 s_old=my_new_list->size();
154 for(it3 =my_new_list->begin(); it3!= my_new_list->end(); ++it3) {
155 std::pair< Tm, DataMap > pair_new_list3 = *it3;
156 Tm t3 = pair_new_list3.first;
166 std::pair< Tm, DataMap > p_new;
171 my_new_list->insert(my_new_list->begin(),p_new);
181 for(it3 =my_new_list->begin(); it3!= my_new_list->end(); ++it3) {
182 std::pair< Tm, DataMap > pair_new_list3 = *it3;
183 Tm t3 = pair_new_list3.first;
193 std::list< MyData<T> >
m_list;
static const int TIMELIMIT
void setDataList(std::list< MyData< T > > _list)
std::list< MyData< T > > m_list
uint64_t microsTime() const
auto const T2 &decltype(t1.eta()) t2
std::list< MyData< T > >::iterator iterator
void getReducedDataList(std::list< std::pair< Tm, DataMap > > *my_new_list)
bool operator<(const MyData &rhs)
std::pair< EcalLogicID, T > DataItem
std::map< EcalLogicID, T >::iterator map_iterator
std::pair< Tm, std::pair< EcalLogicID, U > > m_iData
std::map< EcalLogicID, T > DataMap
std::list< std::pair< Tm, DataMap > >::iterator list_iterator
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