104 vector<const L1MuBMTrackSegEta*>::iterator iter =
m_tseta.begin();
105 while (iter !=
m_tseta.end()) {
115 for (
int i = 0;
i < 12;
i++) {
134 for (
int i = 0;
i < 15;
i++) {
139 for (
int i = 0;
i < 12;
i++) {
143 if (!empty1 || !empty2) {
144 cout <<
"Eta processor " <<
m_epid <<
" : " << endl;
148 cout <<
"Local pattern : " << endl;
149 for (
int i = 0;
i < 15;
i++) {
150 if ((
i + 5) % 5 == 0)
154 for (
int j = 6;
j >= 0;
j--) {
158 if ((
i + 1) % 5 == 0)
161 cout <<
"Found patterns :" << endl;
162 vector<int>::const_iterator iter;
165 int qualitycode =
p.quality();
166 cout <<
"ID = " << setw(4) <<
p.id() <<
" " 167 <<
"eta = " << setw(3) <<
p.eta() <<
" " 168 <<
"quality = " << setw(2) << qualitycode <<
" (" <<
quality(qualitycode, 1) <<
" " 169 <<
quality(qualitycode, 2) <<
" " <<
quality(qualitycode, 3) <<
")";
170 for (
int i = 0;
i < 12;
i++) {
178 cout <<
"Received addresses : " << endl;
179 for (
int i = 0;
i < 12;
i++)
184 cout <<
"Matched patterns : " << endl;
185 for (
int i = 0;
i < 12;
i++) {
188 int fineeta =
p.eta();
190 cout <<
"Index = " << setw(2) <<
i <<
", " 191 <<
"address = " << setw(2) <<
m_address[
i] <<
" --> " 192 <<
"pattern = " << setw(4) <<
m_pattern[
i] <<
" " 193 <<
"eta (coarse) = " << setw(3) << coarseeta <<
" " 194 <<
"eta (fine) = " << setw(3) << fineeta <<
" " 195 <<
"quality = " << setw(2) <<
p.quality() << endl;
200 cout <<
"Eta values and fine bits : " << endl;
201 for (
int i = 0;
i < 12;
i++)
204 for (
int i = 0;
i < 12;
i++)
235 int lwheel =
wheel + 1;
250 if (tseta && !masked) {
253 for (
int i = 0;
i < 7;
i++) {
260 for (
int i = 0;
i < 7;
i++) {
295 if (!
cand->empty()) {
313 for (
int i = 0;
i < 15;
i++) {
325 int qualitycode =
pattern.quality();
358 for (
int i = 0;
i < 12;
i++) {
374 vector<short>::const_iterator iter;
375 vector<int>::const_iterator f_iter;
376 for (iter = qualifiedPatterns.begin(); iter != qualifiedPatterns.end(); iter++) {
395 for (
int i = 0;
i < 6;
i++) {
397 int idx2 = 2 *
i + 1;
400 if (adr1 == 0 || adr2 == 0)
402 if (adr1 == adr2 && !
m_mask) {
419 for (
int i = 0;
i < 12;
i++) {
432 vector<const L1MuBMTrackSegEta*> TSeta;
435 int wh =
p.wheel(
stat + 1);
462 const int qualcode[27][3] = {{0, 0, 0}, {1, 0, 0}, {0, 1, 0}, {0, 0, 1}, {2, 0, 0}, {0, 2, 0}, {0, 0, 2},
463 {1, 1, 0}, {1, 0, 1}, {0, 1, 1}, {2, 1, 0}, {1, 2, 0}, {2, 0, 1}, {1, 0, 2},
464 {0, 2, 1}, {0, 1, 2}, {2, 2, 0}, {2, 0, 2}, {0, 2, 2}, {1, 1, 1}, {2, 1, 1},
465 {1, 2, 1}, {1, 1, 2}, {2, 2, 1}, {2, 1, 2}, {1, 2, 2}, {2, 2, 2}};
467 return qualcode[
id][
stat - 1];
const L1MuBMSectorProcessor * sp(const L1MuBMSecProcId &) const
get a pointer to a Sector Processor
auto const good
min quality of good
L1MuDTChambThDigi const * chThetaSegm(int wheel, int stat, int sect, int bx) const
bool get_etsoc_chdis_st2(int wh, int sc) const
L1MuBMTrack * track(int id) const
return pointer to muon candidate, index [0,1]
int getCoarseEta(int sp, int adr) const
get coarse eta value for a given sector processor [1-6] and address [1-22]
const std::vector< short > & getQualifiedPatterns(int sp, int adr) const
get list of qualified patterns for a given sector processor [1-6] and address [1-22] ...
L1MuDTEtaPattern getPattern(int id) const
get pattern with a given ID
int position(const int i) const
ETFLut_iter begin() const
return iterator which points to the first entry of the LUT
void find(edm::Handle< EcalRecHitCollection > &hits, DetId thisDet, std::vector< EcalRecHitCollection::const_iterator > &hit, bool debug=false)
bool get_etsoc_chdis_st1(int wh, int sc) const
L1MuDTTFMasks l1mudttfmasks
ETFLut_iter end() const
return iterator which points to the one-past-last entry of the LUT
void setTSeta(const std::vector< const L1MuBMTrackSegEta *> &tsList)
set eta track segments used to form the muon candidate
bool get_etsoc_chdis_st3(int wh, int sc) const
void setFineEtaBit()
set fine eta bit
L1MuBMTrack * tracK(int id) const
return pointer to muon candidate, index [0,1]
void setEta(int eta)
set eta-code of muon candidate
static int position[264][3]
int quality(const int i) const
LUT::const_iterator ETFLut_iter