IntervalMap: Containers for intervals, with efficient search.



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]


Versions0.2.0, 0.2.1, 0.2.2, 0.2.3,,,,,,,,,,,,,,,,,,,,,
Change logchangelog
Dependenciesbase (==4.*), containers, deepseq [details]
Copyright2011-2018 Christoph Breitkopf
AuthorChristoph Breitkopf
MaintainerChristoph Breitkopf <>
Home page
Source repositoryhead: git clone
UploadedFri Apr 5 08:37:57 UTC 2019 by ChristophBreitkopf




Maintainers' corner

For package maintainers and hackage trustees

Readme for IntervalMap-

[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:

Getting started

Enable necessary language extensions:

{-# LANGUAGE MultiParamTypeClasses, FlexibleInstances #-}

In most cases, you should use the value-strict version:

import qualified Data.IntervalMap.Generic.Strict as IM

Make tuples an instance of Interval:

instance Ord e => IM.Interval (e,e) e where
    lowerBound (a,_) = a
    upperBound (_,b) = b
    rightClosed _ = False

By using rightClosed _ = False we have defined tuples to be half-open intervals - they include the starting value, but not the end value.

Let's create a map from (Int,Int) intervals to strings:

type MyMap = IM.IntervalMap (Int,Int) String

sample :: MyMap
sample = IM.fromList [((1,6), "Foo"), ((2,4), "Bar"), ((4,7), "Baz")]

Lookup intervals containing a given point ("stabbing query"):

> IM.toAscList (sample `IM.containing` 3)
> IM.toAscList (sample `IM.containing` 4)