range-set-list
Memory efficient sets with ranges of elements.
https://github.com/phadej/range-set-list#readme
| Version on this page: | 0.1.3@rev:1 |
| LTS Haskell 24.18: | 0.1.4@rev:1 |
| Stackage Nightly 2025-07-14: | 0.1.4@rev:1 |
| Latest on Hackage: | 0.1.4@rev:1 |
range-set-list-0.1.3@sha256:b96da80267f23021c477a29d0f1fe34d9750a9265520c48ac39951e4e291ad01,1931Module documentation for 0.1.3
- Data
- Data.RangeSet
- Data.RangeSet.IntMap
- Data.RangeSet.Internal
- Data.RangeSet.List
- Data.RangeSet.Map
- Data.RangeSet
range-set-list
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.
Compared to Data.Set,
this module also imposes an Enum
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 Float and Double).
Also succ and pred are never called for largest or smallest value respectively.