mace::hash_map< Key, Data, Serial, HashFcn, EqualKey, Alloc > Class Template Reference
[Collections]
#include <mhash_map.h>
Inheritance diagram for mace::hash_map< Key, Data, Serial, HashFcn, EqualKey, Alloc >:
Collaboration diagram for mace::hash_map< Key, Data, Serial, HashFcn, EqualKey, Alloc >:
Detailed Description
template<class Key, class Data, class Serial = SerializeMap<Key, Data>, class HashFcn = __gnu_cxx::hash<Key>, class EqualKey = std::equal_to<Key>, class Alloc = std::allocator<Data>>
class mace::hash_map< Key, Data, Serial, HashFcn, EqualKey, Alloc >
mace::hash_map extends std::hash_map, but provides Serialiable (optional), Printable, containsKey, get, and random
For most documentation, you should refer to the SGI STL documentation http://www.sgi.com/tech/stl
Definition at line 70 of file mhash_map.h.
Public Member Functions | |
| void | clear () |
| remove all elements from the map. | |
| size_t | size () const |
| number of elements in the map. | |
| bool | containsKey (const Key &k) const |
whether key k is in the map. Equivalent to find(k) != end() (Mace extension) | |
| const Data & | get (const Key &k) const |
retrieve data from key k. Requires k already in map | |
| Data & | get (const Key &k) |
retrieve data from key k. Requires k already in map | |
| const_iterator | lower_bound (const Key &k) const |
| hash_map doesn't support lower_bound | |
| const_iterator | random () const |
| return a random element, or end() if none. (Mace extension) | |
| const std::string & | getTypeName () const |
| Return the template parameter string Key->Data for actual template parameters. (Mace extension). | |
The documentation for this class was generated from the following file:
- /home/elb/work/cs590n/mace/mace/lib/mhash_map.h
