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: -- (:)
From: brogoff <brogoff@s...>
Subject: Re: [Caml-list] kaplan-okasaki-tarjan deque (was "looping recursion")
On Fri, 30 Jul 2004, james woodyatt wrote:
> On 30 Jul 2004, at 10:07, brogoff wrote:
> >
> > I would like to see an implementation of the catenable deques only
> > using simple list ops (not laziness) described by Kaplan and Tarjan,
> > in OCaml.
> Sure.  Here is the basic implementation I did for performance
> comparisons.

Thanks. I emailed you back a version with the magic gone, using the recursive
module extension to bulldozer over your abuse of the type system ;-). It's the
least offensive (IMO of course) of the current workarounds. I wonder if the
implementors can tell us if there is any hope that we'll see some better
solutions in the near future?

BTW, what did your comparisons tell you?

-- Brian

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