Browse thread
[Caml-list] yet another benchmark: List.map vs tail recursive map
[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
| Date: | -- (:) |
| From: | Alan Post <apost@r...> |
| Subject: | [Caml-list] Re: yet another benchmark: List.map vs tail recursive map |
In article <3EDE572C.2010707@quasar.ipa.nw.ru>, Alexander V. Voinov wrote: > > A year ago I 'benchmarked' almost exactly the alternatives you discuss > within some real application. The difference was substantial, and I had > to work with 'lots of elements'. List.rev took significant time, you > can't neglect this. I even thought about implementing List.map as a C > extension which calls the first argument as a callback and use pointer > operations to build the list without consuming the stack. Not sure if > it's a _proper-way-to-go_ :-). Have you seen the List.map provided by the extlib guys? http://cvs.sourceforge.net/cgi-bin/viewcvs.cgi/ocaml-lib/extlib-dev/extList.ml ------------------- To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ Beginner's list: http://groups.yahoo.com/group/ocaml_beginners