IntervalMap: Maps from Intervals to values, with efficient search.

[ bsd3, data, library ] [ Propose Tags ]

A map from intervals to values, with efficient search for all keys containing a point or overlapping an interval.


[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
Dependencies base (>=4 && <5), containers, deepseq [details]
License BSD-3-Clause
Copyright Copyright 2011 Christoph Breitkopf
Author Christoph Breitkopf
Maintainer Christoph Breitkopf <chbreitkopf@googlemail.com>
Category Data
Home page http://www.chr-breitkopf.de/comp/IntervalMap
Bug tracker mailto:chbreitkopf@googlemail.com
Uploaded by ChristophBreitkopf at 2012-01-03T16:23: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 26576 total (111 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]

Readme for IntervalMap-0.2.1

[back to package description]
Maps with intervals as keys offering efficient search.

Home page:
http://www.chr-breitkopf.de/comp/haskell/index.html#IntervalMap


Install from hackage with cabal install.

To run the tests, do extract the archive, and do

$ cabal configure --enable-tests
$ cabal build
$ cabal test

--
Christoph Breitkopf <chbreitkopf@googlemail.com>
Last edit: 2011-12-09