template<class Key, class T, class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>
class dlinear::ScopedUnorderedMap< Key, T, Hash, KeyEqual, Allocator >
Definition at line 26 of file ScopedUnorderedMap.hpp.
template<class Key , class T , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>
Action to perform on the scoped unordered map.
Enumerator |
---|
INSERT | Insert(k, v) means that (k, v) is inserted.
|
UPDATE | Update(k, v) means that (k, v) was replaced by a new value.
|
Definition at line 37 of file ScopedUnorderedMap.hpp.
template<class Key , class T , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>
Lookup the value for the given key.
- Parameters
-
key | key to use for the lookup |
- Exceptions
-
runtime_error | if the key does not exist |
- Returns
- element with the given key, if it exists
Definition at line 109 of file ScopedUnorderedMap.hpp.
template<class Key , class T , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>
template<class Key , class T , class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<std::pair<const Key, T>>>
Lookup the value for the given key.
- Parameters
-
key | key to use for the lookup |
- Exceptions
-
runtime_error | if the key does not exist |
- Returns
- element with the given key, if it exists
Definition at line 95 of file ScopedUnorderedMap.hpp.