IntervalMap: Containers for intervals, with efficient search.

[ bsd3, data, library ] [ Propose Tags ]

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]

Downloads

Maintainer's Corner

Package maintainers

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-2017 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 2017-11-05T13:21:47Z
Distributions LTSHaskell:0.6.2.1, NixOS:0.6.2.1, Stackage:0.6.2.1
Reverse Dependencies 7 direct, 3 indirect [details]
Downloads 26053 total (96 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 2017-11-05 [all 1 reports]

Readme for IntervalMap-0.5.3.1

[back to package description]

IntervalMap Hackage Build Status

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