range-set-list: Memory efficient sets with continuous ranges of elements.
Memory efficient sets with continuous ranges of elements. List based implementation. Interface mimics Data.Set interface where possible.
[Skip to Readme]
Downloads
- range-set-list-0.1.1.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
| 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 && <4.9), deepseq (>=1.3.0.0 && <1.5), hashable (>=1.2.3.3 && <1.3), semigroups (>=0.16.2.2 && <0.19) [details] |
| License | MIT |
| Author | Oleg Grenrus <oleg.grenrus@iki.fi> |
| Maintainer | Oleg Grenrus <oleg.grenrus@iki.fi> |
| Category | Data |
| Home page | https://github.com/phadej/range-set-list#readme |
| Bug tracker | https://github.com/phadej/range-set-list/issues |
| Source repo | head: git clone https://github.com/phadej/range-set-list |
| Uploaded | by phadej at 2015-11-03T05:14:14Z |
| Distributions | LTSHaskell:0.1.3.1, NixOS:0.1.3.1, Stackage:0.1.3.1 |
| Reverse Dependencies | 2 direct, 0 indirect [details] |
| Downloads | 12190 total (60 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2015-11-13 [all 2 reports] |
Readme for range-set-list-0.1.1.0
[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.