range-set-list: Memory efficient sets with continuous ranges of elements.

Versions [RSS]	0.0.1, 0.0.2, 0.0.3, 0.0.4, 0.0.5, 0.0.6, 0.0.7, 0.1.0.0, 0.1.1.0, 0.1.2.0, 0.1.2.1, 0.1.3, 0.1.3.1
Change log	CHANGELOG.md
Dependencies	base (>=4.5 && <5) [details]
License	MIT
Copyright	Copyright (c) 2013 Oleg Grenrus
Author	Oleg Grenrus
Maintainer	oleg.grenrus@iki.fi
Category	Data Structures
Home page	https://github.com/phadej/range-set-list
Bug tracker	https://github.com/phadej/range-set-list/issues
Uploaded	by phadej at 2014-06-02T08:31:13Z
Distributions	LTSHaskell:0.1.3.1, NixOS:0.1.3.1, Stackage:0.1.3.1
Reverse Dependencies	2 direct, 0 indirect [details]
Downloads	12186 total (60 in the last 30 days)
Rating	(no votes yet) [estimated by Bayesian average]
Your Rating	λ λ λ
Status	Docs available [build log] Successful builds reported [all 1 reports]

Readme for range-set-list-0.0.5

[back to package description]

range-set-list

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.

Changelog

0.0.3 Bump tasty and QuickCheck versions
0.0.2 More properties & test coverage
0.0.1 Initial release