range-set-list: Memory efficient sets with continuous ranges of elements. List based implementation.
Memory efficient sets with continuous ranges of elements. List based implementation. Interface mimics Data.Set interface where possible.
Downloads
- range-set-list-0.0.1.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 |
|---|---|
| Dependencies | base (>=4.6 && <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-02-06T12:36:57Z |
| 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] |