Browse thread
[Caml-list] Loop times
[
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: | oliver@f... |
| Subject: | Re: [Caml-list] Loop times |
On Mon, Mar 17, 2003 at 02:01:21PM -0800, Daniel M. Albro wrote: > > Sorry, I just meant that the version that puts the > exception into a variable outside of the loop is a win over > the one that creates the exception inside the loop. The > fastest loop routine overall was the tail recursive loop, > i.e. the functional/recursive. However, this latest > imperative version has timing that's very close -- the > imperative version that pre-builds the exception takes > just over 28 seconds, and the tail-recursive version > takes just under 27 seconds. Well, I recently found an older article on tail-recursion and try-with statements: It's from John prevost, from April 24th, 2002. He said there, that exception handling blocks tail-calls, and that this means, to avoid try-with around tail-calls. So, confusion takes over control..... Ciao, Oliver ------------------- 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