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 (10:44)
From: Daniel Andor <da209@c...>
Subject: Re: [Caml-list] looping recursion
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.  To me, this 
just proves that there's no such thing as universal optimisation (yet!).  
One's got to actually think about the problem at hand. Damn. ;)


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