hash_map(size_type n, const hasher& h) | Hashed Associative Container | Creates an empty hash_map with at least n buckets, using h as the hash function. |
hash_map(size_type n, const hasher& h, const key_equal& k) | Hashed Associative Container | Creates an empty hash_map with at least n buckets, using h as the hash function and k as the key equal function. |
template <class InputIterator> hash_map(InputIterator f, InputIterator l) [2] | Unique Hashed Associative Container | Creates a hash_map with a copy of a range. |
template <class InputIterator> hash_map(InputIterator f, InputIterator l, size_type n) [2] | Unique Hashed Associative Container | Creates a hash_map with a copy of a range and a bucket count of at least n. |
template <class InputIterator> hash_map(InputIterator f, InputIterator l, size_type n, const hasher& h) [2] | Unique Hashed Associative Container | Creates a hash_map with a copy of a range and a bucket count of at least n , using h as the hash function. |
template <class InputIterator> hash_map(InputIterator f, InputIterator l, size_type n, const hasher& h, const key_equal& k) [2] | Unique Hashed Associative Container | Creates a hash_map with a copy of a range and a bucket count of at least n , using h as the hash function and k as the key equal function. |
hash_map(const hash_map&) | Container | The copy constructor. |
hash_map& operator=(const hash_map&) | Container | The assignment operator |
void swap(hash_map&) | Container | Swaps the contents of two hash_maps. |
pair<iterator, bool> insert(const value_type& x) | Unique Associative Container | Inserts x into the hash_map. |
template <class InputIterator> void insert(InputIterator f, InputIterator l) [2] | Unique Associative Container | Inserts a range into the hash_map. |
void erase(iterator pos) | Associative Container | Erases the element pointed to by pos. |
size_type erase(const key_type& k) | Associative Container | Erases the element whose key is k. |
void erase(iterator first, iterator last) | Associative Container | Erases all elements in a range. |
void clear() | Associative Container | Erases all of the elements. |
const_iterator find(const key_type& k) const | Associative Container | Finds an element whose key is k. |
iterator find(const key_type& k) | Associative Container | Finds an element whose key is k. |
