The range-set-list package

[Tags: library, mit]

Memory efficient sets with continuous ranges of discrete, bounded elements. List- and map-based implementations. Interface mimics Data.Set where possible.

[Skip to ReadMe]


Versions0.0.1, 0.0.2, 0.0.3, 0.0.4, 0.0.5, 0.0.6, 0.0.7,,,
Dependenciesbase (>=4.5 && <4.10), containers (>=0.5.3 && <0.6), deepseq (>= && <1.5), hashable (>= && <1.3), semigroups (>= && <0.19) [details]
AuthorOleg Grenrus <>
MaintainerOleg Grenrus <>
Home page
Bug tracker
Source repositoryhead: git clone
UploadedThu Jan 21 15:52:53 UTC 2016 by phadej
DistributionsLTSHaskell:, NixOS:, Stackage:
Downloads1173 total (43 in last 30 days)
0 []
StatusDocs available [build log]
Last success reported on 2016-01-21 [all 1 reports]




Maintainers' corner

For package maintainers and hackage trustees

Readme for range-set-list-


Build Status Hackage Stackage LTS 2 Stackage LTS 3 Stackage Nightly

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:

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.