On Tuesday 05 June 2007 02:42:15 Jon Harrop wrote:
> On Monday 04 June 2007 23:44:13 Pierre Etchemaïté wrote:
> > The VList looks interesting too: O(1) operations (amortized), and
> > functional; Someone even already wrote a pure OCaml implementation:
>
> Looks like a skip list with arrays instead of trees.

Incidentally, I should probably explain that I like the idea of a functional 
array based upon balanced binary trees because it allows fast concatenation 
and subarrays.

-- 
Dr Jon D Harrop, Flying Frog Consultancy Ltd.
OCaml for Scientists
http://www.ffconsultancy.com/products/ocaml_for_scientists/?e