Version franēaise
Home     About     Download     Resources     Contact us    
Browse thread
[Caml-list] red-black trees
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Jean-Christophe Filliatre <Jean-Christophe.Filliatre@l...>
Subject: [Caml-list] red-black trees

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