11 #include <arich/dbobjects/ARICHBadChannels.h>
20 if (i < m_hapdCutChannels.size())
return m_hapdCutChannels[i];
27 if (i < m_hapdBadChannels.size())
return m_hapdBadChannels[i];
33 m_hapdCutChannels = channels;
34 m_hapdListOfBadChannels.insert(m_hapdListOfBadChannels.end(), channels.begin(), channels.end());
35 std::sort(m_hapdListOfBadChannels.begin(), m_hapdListOfBadChannels.end());
36 m_hapdListOfBadChannels.erase(std::unique(m_hapdListOfBadChannels.begin(), m_hapdListOfBadChannels.end()),
37 m_hapdListOfBadChannels.end());
42 m_hapdBadChannels = channels;
43 m_hapdListOfBadChannels.insert(m_hapdListOfBadChannels.end(), channels.begin(), channels.end());
44 std::sort(m_hapdListOfBadChannels.begin(), m_hapdListOfBadChannels.end());
45 m_hapdListOfBadChannels.erase(std::unique(m_hapdListOfBadChannels.begin(), m_hapdListOfBadChannels.end()),
46 m_hapdListOfBadChannels.end());
52 if (i < m_hapdAllBadCHs.size())
return m_hapdAllBadCHs[i];
58 if (i < m_febDeadChannels.size())
return m_febDeadChannels[i];
65 if (i < m_asicDeadChannels.size())
return m_asicDeadChannels[i];
72 if (i < m_asicBadConnChannels.size())
return m_asicBadConnChannels[i];
79 if (i < m_asicBadOffsetChannels.size())
return m_asicBadOffsetChannels[i];
86 if (i < m_asicBadLinChannels.size())
return m_asicBadLinChannels[i];
92 m_febDeadChannels = deadChannels;
93 m_febListOfBadChannels.insert(m_febListOfBadChannels.end(), deadChannels.begin(), deadChannels.end());
94 std::sort(m_febListOfBadChannels.begin(), m_febListOfBadChannels.end());
95 m_febListOfBadChannels.erase(std::unique(m_febListOfBadChannels.begin(), m_febListOfBadChannels.end()),
96 m_febListOfBadChannels.end());
102 m_asicDeadChannels = deadChannels;
103 m_febListOfBadChannels.insert(m_febListOfBadChannels.end(), deadChannels.begin(), deadChannels.end());
104 std::sort(m_febListOfBadChannels.begin(), m_febListOfBadChannels.end());
105 m_febListOfBadChannels.erase(std::unique(m_febListOfBadChannels.begin(), m_febListOfBadChannels.end()),
106 m_febListOfBadChannels.end());
111 m_asicBadConnChannels = badConnChannels;
112 m_febListOfBadChannels.insert(m_febListOfBadChannels.end(), badConnChannels.begin(), badConnChannels.end());
113 std::sort(m_febListOfBadChannels.begin(), m_febListOfBadChannels.end());
114 m_febListOfBadChannels.erase(std::unique(m_febListOfBadChannels.begin(), m_febListOfBadChannels.end()),
115 m_febListOfBadChannels.end());
120 m_asicBadOffsetChannels = badOffsetChannels;
121 m_febListOfBadChannels.insert(m_febListOfBadChannels.end(), badOffsetChannels.begin(), badOffsetChannels.end());
122 std::sort(m_febListOfBadChannels.begin(), m_febListOfBadChannels.end());
123 m_febListOfBadChannels.erase(std::unique(m_febListOfBadChannels.begin(), m_febListOfBadChannels.end()),
124 m_febListOfBadChannels.end());
130 m_asicBadLinChannels = badLinChannels;
131 m_febListOfBadChannels.insert(m_febListOfBadChannels.end(), badLinChannels.begin(), badLinChannels.end());
132 std::sort(m_febListOfBadChannels.begin(), m_febListOfBadChannels.end());
133 m_febListOfBadChannels.erase(std::unique(m_febListOfBadChannels.begin(), m_febListOfBadChannels.end()),
134 m_febListOfBadChannels.end());
140 if (i < m_febAllBadCHs.size())
return m_febAllBadCHs[i];