Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
[Caml-list] looping recursion
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2004-07-29 (12:56)
From: brogoff <brogoff@s...>
Subject: Re: [Caml-list] looping recursion
On Thu, 29 Jul 2004, Daniel Andor wrote:

> On Thursday 29 July 2004 10:57 am, Xavier Leroy wrote:
> > Because for smaller list the "vanilla way" is more efficient.
> A little benchmarking with short lists shows that for lists that are near or
> smaller than my cache size (skaller's point), the stack map performs better;
> especially in the byte-code case.
> However, the thread was originally about long lists, and for that it is clear
> that algorithms other than the vanilla map are better suited.

It's not at all clear to me. Better how? Faster? Less coding effort? Clearer
to others maintaining the code?

> To me, this  just proves that there's no such thing as universal optimisation (yet!).

I agree with that. And I agree with Xavier's prioritization of a clean fix
to this as a "nice to have but not critical". For now, use ExtLib or roll your

> One's got to actually think about the problem at hand. Damn. ;)

Yes. I'm going back to C and assembly code now, thanks to these arguments :-)

-- Brian

To unsubscribe, mail Archives:
Bug reports: FAQ:
Beginner's list: