* [Caml-list] red-black trees
@ 2003-06-06 15:59 Jean-Christophe Filliatre
0 siblings, 0 replies; only message in thread
From: Jean-Christophe Filliatre @ 2003-06-06 15:59 UTC (permalink / raw)
To: caml-list
Hello Caml riders,
I've implemented sets using red-black trees, with the same interface
as Ocaml's sets (that is Set.S). This implementation is not better
than Ocaml's sets but
(1) it uses a little less space (20% less to be precise),
and
(2) a formal proof of this library is work in progress (to be
available soon).
This red-black trees implementation is available from
http://www.lri.fr/~filliatr/software.en.html
PS: please note that another implementation of red-black trees is
contained in Baire, which is more optimized with some respects but
does not provide exactly the same interface as Ocaml sets.
--
Jean-Christophe Filliâtre
-------------------
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
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~2003-06-06 16:09 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2003-06-06 15:59 [Caml-list] red-black trees Jean-Christophe Filliatre
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox