|
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.
|
|
const T & | operator[] (const Key &key) const |
| Return a constant reference to the element whose key is key .
|
|
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.
|
|
bool | operator== (const HashMap< Key, T > &rhs) const |
| Equality operator. Check whether two two hashmaps contain the same elements. O(n) runtime.
|
|
Size | size () const |
|
template<typename Key, typename T>
class BALL::HashMap< Key, T >
HashMap class based on the STL map (containing serveral convenience functions)
Definition at line 29 of file numericalSAS.h.