IntervalMap

Containers for intervals, with efficient search.

http://www.chr-breitkopf.de/comp/IntervalMap

Version on this page:	0.5.3.1
LTS Haskell 22.37:	0.6.2.1
Stackage Nightly 2024-10-07:	0.6.2.1
Latest on Hackage:	0.6.2.1

See all snapshots IntervalMap appears in

BSD-3-Clause licensed by Christoph Breitkopf

Maintained by Christoph Breitkopf

This version can be pinned in stack with:IntervalMap-0.5.3.1@sha256:4f57e8e6fb8bdc1c16cc485d17e90aceab4453dbba62d2c0b3ee3289aedf50cb,4629

Module documentation for 0.5.3.1

Data
- Data.IntervalMap
  - Data.IntervalMap.Generic
  - Data.IntervalMap.Interval
  - Data.IntervalMap.Lazy
  - Data.IntervalMap.Strict
- Data.IntervalSet

Depends on 3 packages(full list with versions):

base, containers, deepseq

IntervalMap

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