* Replacement for map<> using hash tables. */
/*
- * GiNaC Copyright (C) 1999-2003 Johannes Gutenberg University Mainz, Germany
+ * GiNaC Copyright (C) 1999-2004 Johannes Gutenberg University Mainz, Germany
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
*
* 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
// 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)
{