This is the mail archive of the
libstdc++@gcc.gnu.org
mailing list for the libstdc++ project.
Re: Is std::search coding fast enough?
- From: "Chris Jefferson" <chris at bubblescope dot net>
- To: "Dimitris Xochellis" <jimxoch at yahoo dot gr>
- Cc: "Paolo Carlini" <pcarlini at suse dot de>, libstdc++ at gcc dot gnu dot org
- Date: Wed, 4 Jul 2007 19:34:54 +0100
- Subject: Re: Is std::search coding fast enough?
- References: <468BCEDD.2050300@suse.de> <770840.20095.qm@web23112.mail.ird.yahoo.com>
On 04/07/07, Dimitris Xochellis <jimxoch@yahoo.gr> wrote:
Hi Paolo,
The code of the predicate version seems even less efficient to me. I am rather tired and maybe I
am not thinking straight right now, but what is the reasoning behind of the two loops *A* & *B*
that seems to do the same thing?
This code is indeed a mess. I 'fixed' in the libstdc++-v7 branch by
deleting it, where the predicate and non-predicate versions got
merged. I believe (although I can't remember which ones off the top of
my head) that a few of the other functions have this strange behaviour
of the predicate and non-predicate versions being unexpectedly
different. As you say, the predicate and non-predicate versions should
really be basically the same.
Chris