[Haskell] [ANNOUNCE]: Ranged Sets

[Martin Erwig]

On Dec 12, 2005, at 12:06 PM, Tomasz Zielonka wrote:

> On Sun, Dec 11, 2005 at 11:14:46PM +0000, Paul Johnson wrote:
>> From the README:
>>
>>    Ranged sets allow programming with sets of values that are  
>> described
>> by a
>>    list of ranges.  A value is a member of the set if it lies  
>> within one of
>>    the ranges.  The ranges in a set are ordered and non- 
>> overlapping, so the
>>    standard set operations can be implemented by merge algorithms in
>> O(n) time.
>
> I was thinking about writing such a library myself. Now I won't  
> have to
> :-)

For discrete value domains, you might also want to take a look at:

   http://eecs.oregonstate.edu/~erwig/diet/
   http://eecs.oregonstate.edu/~erwig/papers/abstracts.html#JFP98

--
Martin