[Bug libstdc++/58358] [4.7/4.8/4.9 Regression] search_n has a Complexity violation for random access iterator
glisse at gcc dot gnu.org
gcc-bugzilla@gcc.gnu.org
Sun Sep 8 19:26:00 GMT 2013
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=58358
--- Comment #12 from Marc Glisse <glisse at gcc dot gnu.org> ---
Chris, did you consider applying this optimized code to bidirectional iterators
and not just random access iterators? We may end up doing a few more ++/-- than
necessary, but not by more than a factor 2 I believe, and we would often save
many calls to the predicate. Something may also be doable for forward
iterators, but that's more complicated for less gain and couldn't share the
same code.
More information about the Gcc-bugs
mailing list