mention the "dummy()" function option

[ginac.git] / ginac / hash_map.h

diff --git a/ginac/hash_map.h b/ginac/hash_map.h
index 839b8238f8402c78ded1c0c4dea3bce19e278d0a..b161c9e358d05787d5f373e9ad9fdbdc591efb63 100644 (file)
--- a/ginac/hash_map.h
+++ b/ginac/hash_map.h
@@ -73,7 +73,6 @@ class exhashmap;
  *
  *  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
@@ -254,13 +253,6 @@ protected:
                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:
@@ -343,6 +335,11 @@ 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)
        {