Memory efficient sets with ranges of elements.
|Version on this page:||0.1.3.1@rev:4|
|LTS Haskell 20.15:||0.1.3.1@rev:4|
|Stackage Nightly 2023-03-22:||0.1.3.1@rev:5|
|Latest on Hackage:||0.1.3.1@rev:5|
Module documentation for 0.1.3.1
A few trivial implementations of range sets.
You can find the package (and its documentation) on hackage.
This module is intended to be imported qualified, to avoid name clashes with Prelude functions, e.g.,
import Data.RangeSet.List (RSet) import qualified Data.RangeSet.List as RSet
This package contains two implementations of exactly the same interface, plus one specialization, all of which provide exactly the same behavior:
- “Data.RangeSet.List” implements the simplest
RSetbased on list. Set construction and manipulation is most efficient for this version, but lookups may require a full list traversal.
- “Data.RangeSet.Map” implements a slightly less simple
RSetbased on map. Construction and manipulation have more overhead in this version, but lookups are significantly faster, especially for large sets.
- “Data.RangeSet.IntMap” is simply a specialization of “Data.RangeSet.Map” to Ints based on IntMap.
this module also imposes an
constraint for many functions.
We must be able to identify consecutive elements to be able to glue and split ranges properly.
The implementation assumes that
x < succ x pred x < x
and there aren’t elements in between (not true for
pred are never called for largest or smallest value respectively.
- Show instance print parens around
- Data.RangeSet.Map.member doesn’t require Enum
- Map implementations:
- Consider API stable
- Complement sets (require
- Dependencies update
- More quickcheck properties
- Initial release