Oleg a écrit :

> P.S. BTW, one could have identical interfaces for a) resizable arrays, b) 
> doubly-linked lists and c) deques, the only difference being the efficiency 
> of various operations. It could be convenient for a programmer, because final 
> data representation can be chosen after the program has been profiled and 
> without changing much code. Has anyone tackled this problem?

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.

        Diego Olivier

-------------------
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