Implementing normal algorithms using predicate versions

[caj]

Hi!

I apologise, as I'm sure this question has a simple answer, but I can't 
find it...

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...

Chris