HashMap class based on the STL map (containing serveral convenience functions) More...
#include <BALL/DATATYPE/hashMap.h>
Inheritance diagram for BALL::HashMap< Key, T >:
Classes | |
| class | IllegalKey |
| HashMap illegal key exception. More... | |
OpenMS style typedefs | |
| typedef boost::unordered_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 |
| 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 | operator== (const HashMap< Key, T > &rhs) const |
| Equality operator. Check whether two two hashmaps contain the same elements. O(n) runtime. More... | |
| Size | size () const |
Detailed Description
template<class Key, class T>
class BALL::HashMap< Key, T >
HashMap class based on the STL map (containing serveral convenience functions)
Member Typedef Documentation
◆ Base
template<class Key , class T >
| typedef boost::unordered_map<Key, T> BALL::HashMap< Key, T >::Base |
◆ ConstIterator
template<class Key , class T >
| typedef Base::const_iterator BALL::HashMap< Key, T >::ConstIterator |
◆ Iterator
template<class Key , class T >
| typedef Base::iterator BALL::HashMap< Key, T >::Iterator |
◆ KeyType
template<class Key , class T >
| typedef Key BALL::HashMap< Key, T >::KeyType |
◆ PointerType
template<class Key , class T >
| typedef Base::value_type* BALL::HashMap< Key, T >::PointerType |
◆ ValueType
template<class Key , class T >
| typedef Base::value_type BALL::HashMap< Key, T >::ValueType |
Member Function Documentation
◆ has()
template<class Key , class T >
|
inline |
◆ operator==()
template<class Key , class T >
| bool BALL::HashMap< Key, T >::operator== | ( | const HashMap< Key, T > & | rhs | ) | const |
◆ operator[]() [1/2]
template<class Key , class T >
| T & BALL::HashMap< Key, T >::operator[] | ( | const Key & | key | ) |
◆ operator[]() [2/2]
template<class Key , class T >
| const T & BALL::HashMap< Key, T >::operator[] | ( | const Key & | key | ) | const |
Return a constant reference to the element whose key is key.
- Exceptions
-
IllegalKey if the given key does not exist
◆ size()
template<class Key , class T >
|
inline |
