IntervalMap: Containers for intervals, with efficient search.
Ordered containers of intervals, with efficient search for all keys containing a point or overlapping an interval. See the example code on the home page for a quick introduction.
[Skip to Readme]
Modules
[Index]
Flags
Automatic Flags
| Name | Description | Default |
|---|---|---|
| hpc | Enable HPC test coverage support | Disabled |
Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info
Downloads
- IntervalMap-0.5.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.2.0, 0.2.1, 0.2.2, 0.2.3, 0.2.3.1, 0.2.3.2, 0.2.3.3, 0.3.0.0, 0.3.0.1, 0.3.0.2, 0.3.0.3, 0.4.0.0, 0.4.0.1, 0.4.1.0, 0.4.1.1, 0.5.0.0, 0.5.0.1, 0.5.1.0, 0.5.1.1, 0.5.2.0, 0.5.3.1, 0.6.0.0, 0.6.1.0, 0.6.1.1, 0.6.1.2, 0.6.2.0, 0.6.2.1 |
|---|---|
| Change log | changelog |
| Dependencies | base (>=4 && <5), containers, deepseq [details] |
| License | BSD-3-Clause |
| Copyright | 2011-2016 Christoph Breitkopf |
| Author | Christoph Breitkopf |
| Maintainer | Christoph Breitkopf <chbreitkopf@gmail.com> |
| Category | Data |
| Home page | http://www.chr-breitkopf.de/comp/IntervalMap |
| Bug tracker | mailto:chbreitkopf@gmail.com |
| Source repo | head: git clone https://github.com/bokesan/IntervalMap |
| Uploaded | by ChristophBreitkopf at 2016-06-01T15:50:32Z |
| Distributions | LTSHaskell:0.6.2.1, NixOS:0.6.2.1, Stackage:0.6.2.1 |
| Reverse Dependencies | 7 direct, 3 indirect [details] |
| Downloads | 26717 total (175 in the last 30 days) |
| Rating | 2.0 (votes: 1) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2016-06-01 [all 1 reports] |
Readme for IntervalMap-0.5.1.0
[back to package description]IntervalMap 
@GitHub users: please base pull requests on the develop branch. Thanks.
Containers for intervals. Like Data.Set and Data.Map with
Intervals as keys and functions for efficiently getting the subset
of all intervals containing a point, intersecting an interval, and more.
Home page and documentation: http://www.chr-breitkopf.de/comp/IntervalMap/index.html
Install from hackage with cabal install.
To run the tests, extract the archive, and do
$ cabal configure --enable-tests
$ cabal build
$ cabal test