|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
|
#include "Geometry/MuonNumbering/interface/MuonBaseNumber.h"
#include "FWCore/MessageLogger/interface/MessageLogger.h"
//#define EDM_ML_DEBUG
void MuonBaseNumber::addBase(const LevelBaseNumber& num) {
basenumber_type::iterator cur = sortedBaseNumber.begin();
basenumber_type::iterator end = sortedBaseNumber.end();
// do a small check if level is already occupied
while (cur != end) {
if (num.level() == (*cur).level()) {
#ifdef EDM_ML_DEBUG
edm::LogVerbatim("MuonGeom") << "MuonBaseNumber::addBase was asked to add " << num.level() << " " << num.super()
<< " " << num.base() << " to existing level " << (*cur).level() << " "
<< (*cur).super() << " " << (*cur).base() << " but refused.";
#endif
return; // don't overwrite current volume stored
}
cur++;
}
cur = sortedBaseNumber.begin();
while (cur != end) {
if (num.level() < (*cur).level())
break;
cur++;
}
sortedBaseNumber.insert(cur, num);
#ifdef EDM_ML_DEBUG
cur = sortedBaseNumber.begin();
end = sortedBaseNumber.end();
edm::LogVerbatim("MuonGeom") << "MuonBaseNumber::AddBase ";
unsigned int k(0);
while (cur != end) {
edm::LogVerbatim("MuonGeom") << "[" << k << "] " << (*cur).level() << " " << (*cur).super() << " " << (*cur).base();
cur++;
++k;
}
#endif
}
void MuonBaseNumber::addBase(const int level, const int super, const int base) {
LevelBaseNumber num(level, super, base);
addBase(num);
}
int MuonBaseNumber::getLevels() const { return sortedBaseNumber.size(); }
int MuonBaseNumber::getSuperNo(int level) const {
basenumber_type::const_iterator cur = sortedBaseNumber.begin();
basenumber_type::const_iterator end = sortedBaseNumber.end();
while (cur != end) {
if ((*cur).level() == level) {
return (*cur).super();
}
cur++;
}
return 0;
}
int MuonBaseNumber::getBaseNo(int level) const {
basenumber_type::const_iterator cur = sortedBaseNumber.begin();
basenumber_type::const_iterator end = sortedBaseNumber.end();
while (cur != end) {
if ((*cur).level() == level) {
return (*cur).base();
}
cur++;
}
return 0;
}
|