The range-set-list package

[Tags: library, mit]

Memory efficient sets with continuous ranges of elements. List based implementation. Interface mimics Data.Set interface 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.9) [details]
AuthorOleg Grenrus <>
MaintainerOleg Grenrus <>
Home page
Bug tracker
Source repositoryhead: git clone
UploadedSat Sep 19 12:41:00 UTC 2015 by phadej
Downloads1000 total (63 in last 30 days)
0 []
StatusDocs available [build log]
Last success reported on 2015-09-19 [all 1 reports]




Maintainers' corner

For package maintainers and hackage trustees

Readme for range-set-list-


Build Status

A trivial implementation of range sets.

You can find the package (and it's 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

The implementation of RSet is based on list.

Compared to Data.Set, this module imposes also Enum restriction 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.