IntervalMap

Containers for intervals, with efficient search.

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

Version on this page:	0.5.1.0
LTS Haskell 24.18:	0.6.2.1
Stackage Nightly 2025-11-04:	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.1.0@sha256:46b8b07177007a70ba7c61819b8f8a3f63fde3477d618fba37dfdf219f7a3edd,5000

Module documentation for 0.5.1.0

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

@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