stdx::HashMap Class Template Reference
template<typename Key, typename Data>
class stdx::HashMap< Key, Data >
A simple wrapper class which represents a hash table. The key advantage of this class is that if it is used on older systems it will wrap a standard STL map, but on newer systems with the STL hash_map extension, it will wrap a hash_map creating a true hash table. It uses the default hash function and equality function for hash_maps and the default comparison function for STL maps so if you want to use anything other than these you will need to explicitly choose a hash_map or a map.
Public Types
Public Methods
- HashMap ()
- begin ()
- begin () const
- end ()
- end () const
- find (const key_type &key)
- find (const key_type &key) const
- hasKey (const key_type &key) const
- operator[] (const key_type &k)
- size () const
- empty () const
- force_find (const key_type &key)
- force_find (const key_type &key) const
- erase (const iterator &itr)
- erase (iterator first, iterator last)
- erase (const const_iterator &itr)
- erase (const_iterator first, const_iterator last)
- clear ()