X-Git-Url: https://www.ginac.de/ginac.git//ginac.git?p=ginac.git;a=blobdiff_plain;f=ginac%2Fhash_map.h;h=9c278f2755a458cf74daf84402626a418e5e2085;hp=13facc415c403e892121a14de38a2dc8ec1f9617;hb=db52ae4c832e9a9981ecf78ecc3c9e59f461d8e4;hpb=7dfed2bf4fb42d23410332576dc9fbe14ea154f8

diff --git a/ginac/hash_map.h b/ginac/hash_map.h
index 13facc41..9c278f27 100644
--- a/ginac/hash_map.h
+++ b/ginac/hash_map.h
@@ -3,7 +3,7 @@
  *  Replacement for map<> using hash tables. */
 
 /*
- *  GiNaC Copyright (C) 1999-2003 Johannes Gutenberg University Mainz, Germany
+ *  GiNaC Copyright (C) 1999-2005 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
@@ -17,7 +17,7 @@
  *
  *  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__
@@ -337,7 +337,7 @@ public:
 
 	iterator insert(iterator pos, const value_type &x)
 	{
-		return insert(this->val).first;
+		return insert(x).first;
 	}
 
 	template <class InputIterator>
@@ -431,6 +431,7 @@ public:
 		return !(lhs == rhs);
 	}
 
+#if 0
 	void dump() const
 	{
 		std::clog << "num_entries = " << num_entries << std::endl;
@@ -441,6 +442,7 @@ public:
 			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). */