Version française
Home     About     Download     Resources     Contact us    
Browse thread
Comparison of OCaml and MLton for numerics
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Pierre Etchemaïté <petchema@c...>
Subject: Re: [Caml-list] Comparison of OCaml and MLton for numerics
Le Tue, 05 Jun 2007 04:08:08 +1000, skaller <skaller@users.sourceforge.net> a écrit :

> On Mon, 2007-06-04 at 15:39 +0100, Jon Harrop wrote:
> 
> > A functional array implemented as a balanced binary tree needs the number of 
> > elements (size) of a sub tree just to index into the tree. 
> 
> It might be worth considering a functional version of Judy arrays:
> 
> http://judy.sourceforge.net/

The VList looks interesting too: O(1) operations (amortized), and
functional; Someone even already wrote a pure OCaml implementation:

http://www.imada.sdu.dk/~bardur/personal/45-programs/