This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug libstdc++/58358] search_n has a Complexity violation for random access iterator
- 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: Sun, 08 Sep 2013 09:12:54 +0000
- Subject: [Bug libstdc++/58358] search_n has a Complexity violation for random access iterator
- Auto-submitted: auto-generated
- References: <bug-58358-4 at http dot gcc dot gnu dot org/bugzilla/>
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=58358
Paolo Carlini <paolo.carlini at oracle dot com> changed:
What |Removed |Added
----------------------------------------------------------------------------
CC| |chris at bubblescope dot net
--- Comment #2 from Paolo Carlini <paolo.carlini at oracle dot com> ---
This isn't the original HP/SGI algorithm, and was supposed to be an
optimization, probably often is, but we can't violate the requirements so
easily. Luckily Chris is around, let's ask him to look into this.