OpenMS
2.6.0
|
Map class based on the STL map (containing several convenience functions) More...
#include <OpenMS/DATASTRUCTURES/Map.h>
Classes | |
class | IllegalKey |
Map illegal key exception. More... | |
Public Types | |
OpenMS style typedefs | |
typedef std::map< Key, T > | Base |
typedef Base::value_type | ValueType |
typedef Key | KeyType |
typedef Base::value_type * | PointerType |
typedef Base::iterator | Iterator |
typedef Base::const_iterator | ConstIterator |
typedef Base::reverse_iterator | ReverseIterator |
typedef Base::const_reverse_iterator | ConstReverseIterator |
Public Member Functions | |
Export methods from private base std::vector<Acquisition> | |
bool | has (const Key &key) const |
Test whether the map contains the given key. More... | |
const T & | operator[] (const Key &key) const |
Return a constant reference to the element whose key is key . More... | |
T & | operator[] (const Key &key) |
Return a mutable reference to the element whose key is key . If an element with the key key does not exist, it is inserted. More... | |
bool | equals (const Map< Key, T > &other) const |
Map class based on the STL map (containing several convenience functions)
typedef std::map<Key, T> Base |
typedef Base::const_iterator ConstIterator |
typedef Base::const_reverse_iterator ConstReverseIterator |
typedef Base::iterator Iterator |
typedef Key KeyType |
typedef Base::value_type* PointerType |
typedef Base::reverse_iterator ReverseIterator |
typedef Base::value_type ValueType |
|
inline |
|
inline |
Test whether the map contains the given key.
Referenced by PeptideIndexing::run().
T & operator[] | ( | const Key & | key | ) |
Return a mutable reference to the element whose key is key
. If an element with the key key
does not exist, it is inserted.
const T & operator[] | ( | const Key & | key | ) | const |
Return a constant reference to the element whose key is key
.
IllegalKey | if the given key does not exist |