range-set-list: Memory efficient sets with ranges of elements.
Memory efficient sets with continuous ranges of discrete, bounded elements. List- and map-based implementations. Interface mimics Data.Set
where possible.
[Skip to Readme]
Modules
[Index] [Quick Jump]
Downloads
- range-set-list-0.1.4.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.
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, 0.1.4 |
---|---|
Change log | CHANGELOG.md |
Dependencies | base (>=4.12.0.0 && <4.21), containers (>=0.6.0.1 && <0.8), deepseq (>=1.4.4.0 && <1.6), hashable (>=1.4.7.0 && <1.6) [details] |
Tested with | ghc ==8.6.5 || ==8.8.4 || ==8.10.7 || ==9.0.2 || ==9.2.8 || ==9.4.8 || ==9.6.6 || ==9.8.2 || ==9.10.1 |
License | MIT |
Author | Oleg Grenrus <oleg.grenrus@iki.fi> |
Maintainer | Oleg Grenrus <oleg.grenrus@iki.fi> |
Revised | Revision 1 made by phadej at 2024-08-02T16:19:36Z |
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 2024-07-03T14:39:47Z |
Distributions | LTSHaskell:0.1.4, NixOS:0.1.3.1, Stackage:0.1.4 |
Reverse Dependencies | 2 direct, 0 indirect [details] |
Downloads | 12623 total (40 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs available [build log] Last success reported on 2024-07-03 [all 1 reports] |