CMS 3D CMS Logo

List of all members | Public Member Functions | Static Public Attributes | Private Types | Private Attributes
DEcompare< T > Class Template Reference

#include <DEcompare.h>

Public Member Functions

bool CompareCollections (std::ofstream &, int dump=0)
 
int de_type () const
 
 DEcompare ()
 
 DEcompare (typeT dt, typeT em)
 
bool do_compare (std::ofstream &, int dump=0)
 
bool DumpCandidate (col_cit itd, col_cit itm, std::ofstream &, int mode=0)
 
bool get_match () const
 
int get_ncand (typeT) const
 
int get_ncand (int i) const
 
L1DEDigiCollection getDEDigis () const
 
std::string GetName (int i=0) const
 
bool is_empty (col_cit it) const
 
std::string print (col_cit it) const
 
std::string print () const
 
bool SortCollections (cand_vec &dg, cand_vec &eg, cand_vec &db, cand_vec &eb)
 
 ~DEcompare ()
 

Static Public Attributes

static const int debug_ =0
 

Private Types

typedef std::pair< cand_type, cand_typecand_pair
 
typedef de_trait::cand_type cand_type
 
typedef std::vector< cand_typecand_vec
 
typedef T::const_iterator col_cit
 
typedef T::iterator col_it
 
typedef T::size_type col_sz
 
typedef de_trait::coll_type coll_type
 
typedef DEtrait< Tde_trait
 
typedef de_trait::coll_type const * typeT
 

Private Attributes

typeT data_
 
DEutils< Tde_utils
 
L1DEDigiCollection deDigiColl_
 
typeT emul_
 
int ncand_ [2]
 
bool t_match
 

Detailed Description

template<typename T>
class DEcompare< T >

Definition at line 20 of file DEcompare.h.

Member Typedef Documentation

template<typename T>
typedef std::pair<cand_type,cand_type> DEcompare< T >::cand_pair
private

Definition at line 29 of file DEcompare.h.

template<typename T>
typedef de_trait::cand_type DEcompare< T >::cand_type
private

Definition at line 27 of file DEcompare.h.

template<typename T>
typedef std::vector<cand_type> DEcompare< T >::cand_vec
private

Definition at line 28 of file DEcompare.h.

template<typename T>
typedef T::const_iterator DEcompare< T >::col_cit
private

Definition at line 23 of file DEcompare.h.

template<typename T>
typedef T::iterator DEcompare< T >::col_it
private

Definition at line 24 of file DEcompare.h.

template<typename T>
typedef T::size_type DEcompare< T >::col_sz
private

Definition at line 22 of file DEcompare.h.

template<typename T>
typedef de_trait::coll_type DEcompare< T >::coll_type
private

Definition at line 26 of file DEcompare.h.

template<typename T>
typedef DEtrait<T> DEcompare< T >::de_trait
private

Definition at line 25 of file DEcompare.h.

template<typename T>
typedef de_trait::coll_type const* DEcompare< T >::typeT
private

Definition at line 30 of file DEcompare.h.

Constructor & Destructor Documentation

template<typename T>
DEcompare< T >::DEcompare ( )
inline

Definition at line 34 of file DEcompare.h.

34 {};
template<typename T>
DEcompare< T >::~DEcompare ( )
inline

Definition at line 35 of file DEcompare.h.

35 {};
template<typename T>
DEcompare< T >::DEcompare ( typeT  dt,
typeT  em 
)
inline

Definition at line 37 of file DEcompare.h.

References DEcompare< T >::CompareCollections(), DEcompare< T >::data_, DEcompare< T >::debug_, DEcompare< T >::deDigiColl_, DEcompare< T >::do_compare(), FrontierConditions_GlobalTag_cff::dump, DEcompare< T >::DumpCandidate(), DEcompare< T >::emul_, DEcompare< T >::get_ncand(), DEcompare< T >::GetName(), LogDebug, ALCARECOPromptCalibProdSiPixelAli0T_cff::mode, DEcompare< T >::ncand_, and DEcompare< T >::SortCollections().

37  :
38  data_(dt), emul_(em), t_match(false){
39  ncand_[0]=get_ncand(dt);
40  ncand_[1]=get_ncand(em);
41  deDigiColl_.clear();
42  if(debug_)
43  LogDebug("DEcompare")
44  << "DEcompare"
45  << ": creating instance of type: " << GetName(0)
46  << ", data size:" << data_->size() << " ncand:" << ncand_[0]
47  << ", emul size:" << emul_->size() << " ncand:" << ncand_[1]
48  << ".\n" << std::flush;
49  };
#define LogDebug(id)
float dt
Definition: AMPTWrapper.h:126
static const int debug_
Definition: DEcompare.h:92
typeT data_
Definition: DEcompare.h:96
int get_ncand(typeT) const
Definition: DEcompare.h:121
std::string GetName(int i=0) const
Definition: DEcompare.h:73
int ncand_[2]
Definition: DEcompare.h:100
bool t_match
Definition: DEcompare.h:99
typeT emul_
Definition: DEcompare.h:97
L1DEDigiCollection deDigiColl_
Definition: DEcompare.h:101

Member Function Documentation

template<typename T >
bool DEcompare< T >::CompareCollections ( std::ofstream &  os,
int  dump = 0 
)

-— treat NON-AGREEING candidates -—

-— treat AGREEING candidates -—

Definition at line 132 of file DEcompare.h.

References funct::abs(), gather_cfg::cout, DEcompare< T >::data_, DEcompare< T >::de_utils, DEcompare< T >::debug_, DEcompare< T >::deDigiColl_, DEcompare< T >::DumpCandidate(), DEcompare< T >::emul_, DEcompare< T >::get_ncand(), mps_fire::i, match(), and DEcompare< T >::SortCollections().

Referenced by DEcompare< T >::DEcompare(), and DEcompare< T >::do_compare().

132  {
133 
134  if(debug_)
135  std::cout << " DEcompare::CompareCollections...\n"<< std::flush;
136  bool match = true;
137  int ndata = get_ncand(0);
138  int nemul = get_ncand(1);
139  assert (ndata || nemul);
140 
141  cand_vec data_good, emul_good, data_bad, emul_bad;
142  data_good.reserve(data_->size());
143  emul_good.reserve(emul_->size());
144  data_bad .reserve(data_->size());
145  emul_bad .reserve(emul_->size());
146 
147  // find matching candidates -- tbd report order match
148  match &= SortCollections(data_good,emul_good,data_bad,emul_bad);
149 
150  if(debug_)
151  std::cout << "\tDEcompare stats2:"
152  << " data_bad:" << data_bad .size()
153  << " emul_bad:" << emul_bad .size()
154  << " data_good:" << data_good.size()
155  << " emul_good:" << emul_good.size()
156  << " data_:" << data_->size()
157  << " emul_:" << emul_->size()
158  << ".\n" <<std::flush;
159 
160  if(dump==-1 || (dump==1 && !match)) {
161  os << " number of candidates: " << ndata;
162  if(ndata!=nemul) {
163  match &= false;
164  os << " (data) " << nemul << " (emul) disagree";
165  }
166  os << std::endl;
167  }
168 
169 
170  col_cit itd, itm;
171  int prtmode=0;
172  col_sz ndt=0, nem=0, nde=0;
173  deDigiColl_.clear();
174 
176 
177  ndt = data_bad.size();
178  nem = emul_bad.size();
179  nde = (ndt>nem)?ndt:nem;
180 
181  itd = data_bad.begin();
182  itm = emul_bad.begin();
183 
184  if(dump==-1)
185  os << " un-matched (" << nde << ")\n";
186 
187  for (col_sz i=0; i<nde; i++) {
188 
189  if (i< ndt && i< nem) prtmode=0; //dt+em
190  else if(i< ndt && i>=nem) prtmode=1; //dt
191  else if(i>=ndt && i< nem) prtmode=2; //em
192  else assert(0);
193 
194  if(abs(dump)==1)
195  DumpCandidate(itd,itm,os,prtmode);
196  else if(prtmode==0) {
197  if( (dump==2 && !de_utils.de_equal_loc(*itd,*itm)) ||
198  (dump==3 && de_utils.de_equal_loc(*itd,*itm)) )
199  DumpCandidate(itd,itm,os,prtmode);
200  }
201 
202  // Fill in DEdigi collection
203  if(prtmode==0) {
204  if(de_utils.de_equal_loc(*itd,*itm)) {
205  deDigiColl_.push_back( de_utils.DEDigi(itd,itm,1) );
206  } else {
207  deDigiColl_.push_back( de_utils.DEDigi(itd,itm,2) );
208  }
209  } else if (prtmode==1) {
210  deDigiColl_.push_back( de_utils.DEDigi(itd,itd,3) );
211  } else if (prtmode==2) {
212  deDigiColl_.push_back( de_utils.DEDigi(itm,itm,4) );
213  }
214 
215  itd++; itm++;
216  }
217 
219 
220  itd = data_good.begin();
221  itm = emul_good.begin();
222 
223  assert(data_good.size()==emul_good.size());
224  if(dump==-1)
225  os << " matched (" << data_good.size() << ")\n";
226 
227  for(col_sz i=0; i<data_good.size(); i++) {
228  assert(de_utils.de_equal(*itd,*itm));
229  if(dump==-1)
230  DumpCandidate(itd,itm,os,prtmode);
231  deDigiColl_.push_back( de_utils.DEDigi(itd,itm,0) );
232  itd++; itm++;
233  }
234 
235  if(debug_)
236  std::cout << "DEcompare<T>::CompareCollections end.\n"<< std::flush;
237 
238  return match;
239 }
static const int debug_
Definition: DEcompare.h:92
typeT data_
Definition: DEcompare.h:96
int get_ncand(typeT) const
Definition: DEcompare.h:121
bool SortCollections(cand_vec &dg, cand_vec &eg, cand_vec &db, cand_vec &eb)
Definition: DEcompare.h:243
Abs< T >::type abs(const T &t)
Definition: Abs.h:22
std::vector< cand_type > cand_vec
Definition: DEcompare.h:28
T::size_type col_sz
Definition: DEcompare.h:22
bool DumpCandidate(col_cit itd, col_cit itm, std::ofstream &, int mode=0)
Definition: DEcompare.h:311
T::const_iterator col_cit
Definition: DEcompare.h:23
std::pair< typename Association::data_type::first_type, double > match(Reference key, Association association, bool bestMatchByMaxValue)
Generic matching function.
Definition: Utils.h:10
DEutils< T > de_utils
Definition: DEcompare.h:98
typeT emul_
Definition: DEcompare.h:97
L1DEDigiCollection deDigiColl_
Definition: DEcompare.h:101
template<typename T>
int DEcompare< T >::de_type ( ) const
inline

Definition at line 76 of file DEcompare.h.

Referenced by L1Comparator::process().

76 {return de_trait::de_type();}
template<typename T >
bool DEcompare< T >::do_compare ( std::ofstream &  os,
int  dump = 0 
)

Definition at line 106 of file DEcompare.h.

References DEcompare< T >::CompareCollections(), gather_cfg::cout, DEcompare< T >::debug_, DEcompare< T >::GetName(), convertSQLiteXML::ok, AlCaHLTBitMon_QueryRunRegistry::string, and DEcompare< T >::t_match.

Referenced by DEcompare< T >::DEcompare(), and L1Comparator::process().

106  {
107  if(debug_)
108  std::cout << " DEcompare::do_compare... "
109  << GetName() << "\n" << std::flush;
111  std::string ok;
112  if(t_match) ok="successful";
113  else ok="failed";
114  if(dump==-1 || (dump==1 && !t_match))
115  os << " ..." << GetName()
116  << " data and emulator comparison: " << ok.c_str() << std::endl;
117  return t_match;
118 }
bool CompareCollections(std::ofstream &, int dump=0)
Definition: DEcompare.h:132
static const int debug_
Definition: DEcompare.h:92
std::string GetName(int i=0) const
Definition: DEcompare.h:73
bool t_match
Definition: DEcompare.h:99
template<typename T >
bool DEcompare< T >::DumpCandidate ( col_cit  itd,
col_cit  itm,
std::ofstream &  os,
int  mode = 0 
)

Definition at line 311 of file DEcompare.h.

References DEcompare< T >::de_utils, and DEcompare< T >::print().

Referenced by DEcompare< T >::CompareCollections(), and DEcompare< T >::DEcompare().

311  {
312  if(mode!=2)
313  os << " data: " << print(itd);
314  if(mode!=1)
315  os << " emul: " << print(itm) << std::endl;
316  if(mode==0)
317  if( !de_utils.de_equal(*itd,*itm) )
318  return false;
319  return true;
320 }
std::string print() const
Definition: DEcompare.h:81
DEutils< T > de_utils
Definition: DEcompare.h:98
template<typename T>
bool DEcompare< T >::get_match ( ) const
inline

Definition at line 77 of file DEcompare.h.

References DEcompare< T >::t_match.

77 {return t_match;}
bool t_match
Definition: DEcompare.h:99
template<typename T >
int DEcompare< T >::get_ncand ( typeT  col) const

Definition at line 121 of file DEcompare.h.

References DEcompare< T >::is_empty().

Referenced by DEcompare< T >::CompareCollections(), DEcompare< T >::DEcompare(), L1Comparator::process(), and DEcompare< T >::SortCollections().

121  {
122  int ncand=0;
123  for (col_cit it = col->begin(); it!=col->end(); it++) {
124  if(!is_empty(it)) {
125  ncand++;
126  }
127  }
128  return ncand;
129 }
bool is_empty(col_cit it) const
Definition: DEcompare.h:75
T::const_iterator col_cit
Definition: DEcompare.h:23
col
Definition: cuy.py:1008
template<typename T>
int DEcompare< T >::get_ncand ( int  i) const
inline

Definition at line 66 of file DEcompare.h.

References DEcompare< T >::debug_, mps_fire::i, LogDebug, and DEcompare< T >::ncand_.

66  {
67  if(debug_ && (i<0 || i>2) )
68  LogDebug("DEcompare")
69  << "DEcompare illegal number of candidates request flag:"<<i<<"\n";
70  return ncand_[i];
71  }
#define LogDebug(id)
static const int debug_
Definition: DEcompare.h:92
int ncand_[2]
Definition: DEcompare.h:100
template<typename T>
L1DEDigiCollection DEcompare< T >::getDEDigis ( ) const
inline

Definition at line 79 of file DEcompare.h.

References DEcompare< T >::deDigiColl_.

Referenced by L1Comparator::process().

79 {return deDigiColl_;}
L1DEDigiCollection deDigiColl_
Definition: DEcompare.h:101
template<typename T>
std::string DEcompare< T >::GetName ( int  i = 0) const
inline

Definition at line 73 of file DEcompare.h.

References DEcompare< T >::de_utils, and mps_fire::i.

Referenced by DEcompare< T >::DEcompare(), DEcompare< T >::do_compare(), and L1Comparator::process().

73 {return de_utils.GetName(i);}
DEutils< T > de_utils
Definition: DEcompare.h:98
template<typename T>
bool DEcompare< T >::is_empty ( col_cit  it) const
inline
template<typename T>
std::string DEcompare< T >::print ( col_cit  it) const
inline

Definition at line 74 of file DEcompare.h.

References DEcompare< T >::de_utils.

Referenced by L1Comparator::process().

74 {return de_utils.print(it);}
DEutils< T > de_utils
Definition: DEcompare.h:98
template<typename T>
std::string DEcompare< T >::print ( void  ) const
inline

Definition at line 81 of file DEcompare.h.

References DEcompare< T >::data_, DEcompare< T >::emul_, and DEcompare< T >::is_empty().

Referenced by DEcompare< T >::DumpCandidate().

81  {
82  std::stringstream ss("");
83  for(col_cit itd=data_->begin();itd!=data_->end();itd++)
84  if(!is_empty(itd)) ss << " data: " << print(itd);
85  for(col_cit itm=emul_->begin();itm!=emul_->end();itm++)
86  if(!is_empty(itm)) ss << " emul: " << print(itm);
87  return ss.str();
88  }
typeT data_
Definition: DEcompare.h:96
std::string print() const
Definition: DEcompare.h:81
bool is_empty(col_cit it) const
Definition: DEcompare.h:75
T::const_iterator col_cit
Definition: DEcompare.h:23
typeT emul_
Definition: DEcompare.h:97
template<typename T >
bool DEcompare< T >::SortCollections ( cand_vec dg,
cand_vec eg,
cand_vec db,
cand_vec eb 
)

Definition at line 243 of file DEcompare.h.

References gather_cfg::cout, DEcompare< T >::data_, DEcompare< T >::de_utils, DEcompare< T >::debug_, DEcompare< T >::emul_, DEcompare< T >::get_ncand(), DEcompare< T >::is_empty(), and match().

Referenced by DEcompare< T >::CompareCollections(), and DEcompare< T >::DEcompare().

244  {
245  if(debug_)
246  std::cout << " DEcompare::SortCollections...\n"<< std::flush;
247 
248  bool match = true;
249  cand_vec data_tmp, emul_tmp;
250 
251  data_good.clear();
252  emul_good.clear();
253  data_bad .clear();
254  emul_bad .clear();
255  data_tmp .clear();
256  emul_tmp .clear();
257 
258  for(col_cit ite = emul_->begin(); ite != emul_->end(); ite++) {
259  if(!is_empty(ite)) {
260  emul_tmp.push_back(*ite);
261  }
262  }
263 
264  for(col_cit itd = data_->begin(); itd != data_->end(); itd++) {
265  if(is_empty(itd)) continue;
266  col_it ite = emul_tmp.end();
267  ite = de_utils.de_find(emul_tmp.begin(),emul_tmp.end(),*itd);
268  if(ite!=emul_tmp.end()) {
269  data_good.push_back(*itd);
270  emul_good.push_back(*ite);
271  ite=emul_tmp.erase(ite);
272  } else {
273  data_tmp.push_back(*itd);
274  match &= false;
275  }
276  }
277 
278  for(col_it itd = data_tmp.begin(); itd != data_tmp.end(); itd++) {
279  for(col_it ite = emul_tmp.begin(); ite != emul_tmp.end(); ite++) {
280  if(de_utils.de_equal_loc(*itd,*ite)) {
281  data_bad.push_back(*itd);
282  emul_bad.push_back(*ite);
283  itd = data_tmp.erase(itd)-1;
284  ite = emul_tmp.erase(ite)-1;
285  break;
286  }
287  }
288  }
289 
290  sort(data_tmp.begin(), data_tmp.end(),de_rank<coll_type>());
291  sort(emul_tmp.begin(), emul_tmp.end(),de_rank<coll_type>());
292 
293  data_bad.insert(data_bad.end(),data_tmp.begin(),data_tmp.end());
294  emul_bad.insert(emul_bad.end(),emul_tmp.begin(),emul_tmp.end());
295 
296  if(debug_)
297  std::cout << "\tDEcompare stats1:"
298  << " data_bad:" << data_bad .size()
299  << " emul_bad:" << emul_bad .size()
300  << " data_good:" << data_good.size()
301  << " emul_good:" << emul_good.size()
302  << " data: " << get_ncand(data_)
303  << " emul: " << get_ncand(emul_)
304  << "\n" << std::flush;
305  if(debug_)
306  std::cout << "DEcompare<T>::SortCollections end.\n"<< std::flush;
307  return match;
308 }
— order candidates —
Definition: DEcompare.h:15
static const int debug_
Definition: DEcompare.h:92
typeT data_
Definition: DEcompare.h:96
int get_ncand(typeT) const
Definition: DEcompare.h:121
std::vector< cand_type > cand_vec
Definition: DEcompare.h:28
bool is_empty(col_cit it) const
Definition: DEcompare.h:75
T::const_iterator col_cit
Definition: DEcompare.h:23
std::pair< typename Association::data_type::first_type, double > match(Reference key, Association association, bool bestMatchByMaxValue)
Generic matching function.
Definition: Utils.h:10
DEutils< T > de_utils
Definition: DEcompare.h:98
T::iterator col_it
Definition: DEcompare.h:24
typeT emul_
Definition: DEcompare.h:97

Member Data Documentation

template<typename T>
typeT DEcompare< T >::data_
private
template<typename T>
DEutils<T> DEcompare< T >::de_utils
private
template<typename T>
const int DEcompare< T >::debug_ =0
static
template<typename T>
L1DEDigiCollection DEcompare< T >::deDigiColl_
private
template<typename T>
typeT DEcompare< T >::emul_
private
template<typename T>
int DEcompare< T >::ncand_[2]
private

Definition at line 100 of file DEcompare.h.

Referenced by DEcompare< T >::DEcompare(), and DEcompare< T >::get_ncand().

template<typename T>
bool DEcompare< T >::t_match
private

Definition at line 99 of file DEcompare.h.

Referenced by DEcompare< T >::do_compare(), and DEcompare< T >::get_match().