* Replacement for map<> using hash tables. */
/*
- * GiNaC Copyright (C) 1999-2003 Johannes Gutenberg University Mainz, Germany
+ * GiNaC Copyright (C) 1999-2015 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
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
-#ifndef __GINAC_HASH_MAP_H__
-#define __GINAC_HASH_MAP_H__
+#ifndef GINAC_HASH_MAP_H
+#define GINAC_HASH_MAP_H
-#include <list>
-#include <iterator>
#include <algorithm>
#include <functional>
+#include <iterator>
+#include <list>
#include <utility>
-
namespace GiNaC {
/*
iterator insert(iterator pos, const value_type &x)
{
- return insert(this->val).first;
+ return insert(x).first;
}
template <class InputIterator>
return !(lhs == rhs);
}
+#if 0
void dump() const
{
std::clog << "num_entries = " << num_entries << std::endl;
std::clog << (it->first == EMPTY ? "free" : (it->first == USED ? "used" : "erased")) << ", " << it->second.first << " -> " << it->second.second << std::endl;
}
}
+#endif
};
/** Return pointer to bucket corresponding to key (or first empty bucket). */
} // namespace std
-#endif // ndef __GINAC_HASH_MAP_H__
+#endif // ndef GINAC_HASH_MAP_H