Hi, folks,

I'm looking for the Set/Map like data-structures which can efficiently
add and remove large intervals over integers, and support
intersections, unions and compliments.  Does anybody make such
libraries?  Baire contains interval.ml[i] but misses these
functionalities.  Is it easy to add them to Baire, or are Baire's
intervals something different than I thought?

Failing that, is there Set/Map with order-related operations?
Actually I have one but if there is one actively developed, I would
like to use it.

By the way, I have a library for arbitrary orders on (finite sets of)
integers.  I think comparison of two integer is O(log n ^ 2)
time. (n for the size of the finite set.)  Do you think it is worth to
make public?

Cheers,
--
Yamagata Yoriyuki

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