Implementing normal algorithms using predicate versions

[Paolo Carlini]

Nathan Myers wrote:

>On Mon, Nov 29, 2004 at 06:29:32AM -0800, Nathan Myers wrote:
>  
>
>>Since, by the policy, it doesn't matter for -O2 or better which choice 
>>we make, the question just is whether it's worth the effort to maintain 
>>all the extra source code (equated to complexity) just for the sake of 
>>-O.  That raises the question of just how much source code, and how 
>>much performance, is involved.  If the performance cost is not huge, 
>>and the amount of code is not trivial, then I think the policy favors 
>>making the change.
>>    
>>
>One other consideration: suppose we didn't have the extra code in
>the library already, and were offered a well-tested patch to add it.
>Would we accept such a patch?  I would guess almost certainly not.
>That argues for accepting this change.
>  
>
Exactly, I think we are basically just taking the occasion to discuss a 
bit those
issues, that apparently nobody ever touches... Trade-offs are 
disagreable, aren't it? ;)

At this point (by the way, thanks Chris for the additional encouraging 
data about
-O1) we should just ask Chris to start actually implementing the idea!

Thanks again for your responses,
Paolo.