31 for (
unsigned int i=0; i<
m_enumVec.size(); i++) {
49 std::pair<bool, LArBadFebEnum::ProblemType>
52 std::map<std::string, ProblemType>::const_iterator i =
m_nameMap.find(
str);
53 if (i !=
m_nameMap.end()) {
return std::make_pair(
true,i->second);}
61 if (value) word |= mask;
66 BitWord& word,
bool value)
const
89 for (
unsigned int i=0; i<
m_enumVec.size(); ++i) {
91 if (!
res.empty())
res +=
" ";
std::pair< std::vector< unsigned int >, bool > res
std::map< std::string, ProblemType > m_nameMap
std::vector< int > m_index
std::vector< std::string > m_nameVec
std::vector< ProblemType > m_enumVec
const std::string & stringName(ProblemType pb) const
PosType bitPosition(ProblemType pb) const
std::pair< bool, ProblemType > enumName(const std::string &str) const
void setBit(ProblemType pb, BitWord &word, bool value=true) const
std::string stringStatus(const LArBadFeb &bc) const
void addBit(ProblemType pb, const std::string &name)
BitWord & packedDataRef()
bool statusOK(ProblemType pb) const
Returns true if there is no problem in corresponding status bit.