Version franēaise
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

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: 2003-06-06 (16:09)
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),


  (2) a  formal proof  of  this library  is  work in  progress (to  be
      available soon).

This red-black trees implementation is available from

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 Archives:
Bug reports: FAQ:
Beginner's list: