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-28 (07:21)
From: Alex Baretta <alex@b...>
Subject: Re: [Caml-list] looping recursion
brogoff wrote:
> Sometimes lists are best. If lists are OK for 100, 1_000, or 10_000 items,
> why not 100_000 or 1_000_000? Map and friends shouldn't blow stack.
> -- Brian

Actually, it's not that bad.

Sometimes I design an algorithm in terms of basic data structures, such 
as lists, and transformations applied through higher order iterators. 
Such "featurs" as the stack overflow in or the Linux 
out-of-memory SIGKILL give me a clear indication of the simplemindedness 
of such algorithms and force me to rethink them in terms of more 
efficient structures and techniques, typically streams and laziness.


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