This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug libstdc++/50160] vector<bool> comparison very slow (no specialisation)
- From: "devel at the-user dot org" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: Tue, 23 Aug 2011 19:04:25 +0000
- Subject: [Bug libstdc++/50160] vector<bool> comparison very slow (no specialisation)
- Auto-submitted: auto-generated
- References: <bug-50160-4@http.gcc.gnu.org/bugzilla/>
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=50160
--- Comment #8 from Jonathan Schmidt-Dominà <devel@the-user.org> 2011-08-23 19:04:25 UTC ---
For my application I should simply use an unordered_map and all the overhead
has gone. :D But operator< simply should not be that slow.
âI haven't thought about the potential drawbacks of implementing vector<bool>
backwards.â
What do you mean? Chunk wise backwards?
âbut I don't think it can be exposed.â
Well, that would not be portable.