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] Set/Map with intervals and/or order-related operations
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Yamagata Yoriyuki <yoriyuki@m...>
Subject: [Caml-list] Set/Map with intervals and/or order-related operations
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[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?

Yamagata Yoriyuki

To unsubscribe, mail Archives:
Bug reports: FAQ:
Beginner's list: