Markus Mottle a écrit :

> Yes, you'll probably want Patricia trees. You can get them from
> Jean-Christophe Filliatre's page:
> 
>   http://www.lri.fr/~filliatr/software.en.html
> 
> They support very fast set operations (union, difference, intersection).

Patricia Trees are tries in dimension 2.

In fact, one could try tries in dimension 30 with the leafs being
integers (a kind of mix between bitvectors and tries).

I have been doing a few test, a very simple implementation should be
avaible in the pre-release of the data structure library. But I don't
know yet if it is faster than Patricia trees or not. At least it
should save some space

        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