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 overload)
- From: "paolo.carlini at oracle dot com" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: Wed, 31 Aug 2011 00:04:36 +0000
- Subject: [Bug libstdc++/50160] vector<bool> comparison very slow (no overload)
- Auto-submitted: auto-generated
- References: <bug-50160-4@http.gcc.gnu.org/bugzilla/>
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=50160
--- Comment #19 from Paolo Carlini <paolo.carlini at oracle dot com> 2011-08-31 00:04:36 UTC ---
I'm wondering if processing an unsigned long at a time wouldn't be a step in
the right direction. Then, a compiler intrinsics would be the right place for
that, would naturally fit in the set of builtins fiddling with bits of integer
types. On top of that the library-proper code would become very simple, in
particular no ugly reinterpret_cast & co (by the way, Ch. 7 of "Hacker's
Delight" has some info about such operations). Assuming indeed, we *do* have to
revert the order, I'm not 101% sure.