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

The IntervalMap package

[ Tags: benchmark, bsd3, data, library ] [ Propose Tags ]

A map from intervals to values, 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]

Properties

Versions 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
Dependencies base (==4.*), containers, deepseq [details]
License BSD3
Copyright Copyright 2011 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 repository head: darcs get http://hub.darcs.net/bokesan/IntervalMap
Uploaded Thu Aug 8 13:21:28 UTC 2013 by ChristophBreitkopf
Distributions LTSHaskell:0.5.2.0, NixOS:0.5.2.0, Stackage:0.5.2.0, Tumbleweed:0.5.2.0
Downloads 5067 total (34 in the last 30 days)
Rating 0.0 (0 ratings) [clear rating]
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Readme for IntervalMap-0.3.0.2

[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@gmail.com>
Last edit: 2011-12-09