This is the mail archive of the
libstdc++@gcc.gnu.org
mailing list for the libstdc++ project.
Re: Implementing normal algorithms using predicate versions
Gabriel Dos Reis wrote:
Paolo Carlini <pcarlini@suse.de> writes:
| Nathan Myers wrote:
|
| >On Sun, Nov 28, 2004 at 03:00:31PM +0000, caj wrote:
| >
| >> Many algorithms have a predicated version, and a version which
| >> simply uses operator<. Why not implement the operator< versions
| >> using the predicated versions? This would seem to half the size of
| >> the algorithm heaader, remove lots of redundant code, and on -O2
| >> seems to produce identical code...
Caj is right. And I remember Benjamin and I discussed this stuff back
in 2002.
Yes, I also remember very vaguely something about you and Benjamin and
"less"...
But in my mind remained quite mysterious 'til today!
Thanks for your feedback,
Paolo.