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 3x slower than 4.6.2
- From: "likan_999.student at sina dot com" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: Tue, 24 Jul 2012 00:42:57 +0000
- Subject: [Bug libstdc++/54075] [4.7.1] unordered_map 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 #7 from likan_999.student at sina dot com 2012-07-24 00:42:57 UTC ---
@Paolo Carlini: the problem is, with different max_load_factor in range
[0.2-5], the *best* result of 4.7.1 is still 2x slower than the *worst* of
4.6.2.
I printed out the average load factor during the insertion. Looks like 4.7.1's
load factor is very close to the max_load_factor, and the average for 4.6.2 is
about 1/4 of the max_load_factor. But what conclusion can we get from this
result?