On Tuesday 13 August 2002 07:00 am, Diego Olivier Fernandez Pons wrote:
> I will be soon releasing a data structure library (september) which
> includes a port of EDiSon (GHC/hslibs/data/Edison in the GHC CVS), all
> data structures that were in Okasaki's purely functional data
> structures book and some more (weight balanced trees, cartesian trees,
> priority search queues, ...)
>
> It uses an uniform data representation for the programmer to chose
> after the program has been profiled and without changing much code.

Will it include imperative doubly-linked list or are all data types going to 
be purely functional? It's hard for me to think of an efficient purely 
functional doubly-linked list.

Regards,
Oleg
-------------------
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