23 template<
class KeyType,
class ValueType>
33 using BoxEntry = std::pair<KeyType, ValueType>;
37 using Iterator =
typename std::vector<BoxEntry>::iterator;
45 ValueType*
find(
const KeyType& aKey)
51 { return entry.first == aKey; }
53 return (foundPos ==
m_container.end() ?
nullptr : &foundPos->second);
Minimal container storing a pair of < KeyType, ValueType>
void push_back(std::pair< std::string, ValueType > newPair)
std::pair< KeyType, ValueType > BoxEntry
typedef for readable entry-type
ValueType * find(const std::string &aKey)
unsigned int size() const
ConstIterator end() const
typename std::vector< BoxEntry >::iterator Iterator
typedef for more readable iterator-type
ConstIterator begin() const
void push_back(std::pair< std::string, ValueType > &newPair)
std::vector< std::pair< std::string, ValueType > > m_container
typename std::vector< BoxEntry >::const_iterator ConstIterator
typedef for more readable iterator-type
Abstract base class for different kinds of events.