Description
Provides ranged sets for Haskell. A ranged set represents groups of values as intervals, which can be more compact and efficient than storing every individual value.
It is useful for calendars, numeric ranges, validation rules, IP-like ranges, scheduling, and algorithms that reason about intervals. It is a data-structure library and has no standalone interface.