This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug libstdc++/54075] [4.7.1] unordered_map insert 3x slower than 4.6.2
- From: "fdumont at gcc dot gnu.org" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: Fri, 27 Jul 2012 07:57:59 +0000
- Subject: [Bug libstdc++/54075] [4.7.1] unordered_map insert 3x slower than 4.6.2
- Auto-submitted: auto-generated
- References: <bug-54075-4@http.gcc.gnu.org/bugzilla/>
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=54075
--- Comment #21 from FranÃois Dumont <fdumont at gcc dot gnu.org> 2012-07-27 07:57:59 UTC ---
I haven't touch the grow speed for the moment. I prefer to fix the reserve
Standard conformity first.
Now I can restore the 4.6 grow speed as it seems to be a relatively correct
one. Note that 3x slower with so many more rehash operations doesn't seem so
bad ! Of course growing faster will also induce higher memory consumption which
is not shown by the simple benchmark proposed here.