*
* Differences to map<>:
* - no lower_bound()/upper_bound()
- * - no "insert with a hint" insert(iterator, key_type)
* - no reverse iterators, no rbegin()/rend()
* - no operator<()
* - comparison functor is hardcoded to ex_is_less
return num_buckets - (num_buckets >> 2);
}
- /** Empty all buckets in the table. */
- void empty_all_buckets()
- {
- for (table_iterator i = hashtab.begin(); i != hashtab.end(); ++i)
- i->first = EMPTY;
- }
-
void grow();
public:
// Modifiers
std::pair<iterator, bool> insert(const value_type &x);
+ iterator insert(iterator pos, const value_type &x)
+ {
+ return insert(x).first;
+ }
+
template <class InputIterator>
void insert(InputIterator first, InputIterator last)
{