How many HOFs in Phobos?

[Andrei Alexandrescu]

On 2/1/11 2:27 PM, bearophile wrote:
> Walter:
>
>> It's exponentially bad performance makes it short, not useful.
>
> A program with high complexity is not a problem if you run it only on
> few very short examples. There is a place to care for performance
> (like when you design a function for Phobos) and there are places
> where you care for other things.
>
> I suggest top stop focusing only on a fault of a program that was not
> designed for performance (and if you want to start looking at the
> numerous good things present in Haskell. Haskell language and its
> implementation contains tens of good ideas).
>
> Bye, bearophile

I agree in spirit but only weakly. Cute and complexity corrupt examples 
such as the exponential Fibonacci, the linear space factorial, and the 
quicksort that is not quick and not quicksort have long misrepresented 
what's good about functional programming.

Andrei