Haskell Interval ContainersAn implementation of sets of intervals and maps from intervals to values. The intervals may overlap, and the implementation supports efficient queries for all intervals containing a point or intersecting a given interval.
You should normally install it from Hackage with
cabal install IntervalMapI try to keep the interface stable between minor releases, so if you have this as a dependency in a cabal project, use constraints like this:
Build-depends: IntervalMap >= 0.5 < 0.6
API docs on Hackage.
Minor performance tweaks.
|0.4.0.1||2014-08-29||Documentation updated and portability info fixed.|
|0.4.0.0||2014-08-29||Major update. It is now possible to use any type as key interval by
making it an instance
|0.3.0.3||2014-08-11||Updated benchmark to use Criterion 1.0; tested with ghc 7.8.3.|
|0.3.0.2||2013-08-08||Dropped upper constraint on criterion; tested with ghc 7.6.3; migrated repo to Darcs Hub.|
|0.3.0.1||2012-08-07||Bugfixes: Lazy was too strict, Strict too lazy.|
|0.3.0.0||2012-08-03||Split into Lazy and Strict modules, following containers.|
Fixed error when building benchmarks with ghc 7.4.1.
Improved performance of
Added benchmarks for
Reduced benchmark data size for more reasonable run times.
|0.2.3.2||2012-04-20||Added benchmarks, including a benchmark section in the
cabal spec, so you can use
to run the benchmark. Here is a sample report.
Fixed cabal spec so that the test suites no longer require installing the package first.
Removed ineffective INLINE pragmas.
|0.2.3||2012-01-09||Added minView... family of functions.
Added isSubmap... family of functions.
Rewrote mapKeysMonotonic te be O(n).
|0.2.2||2012-01-05||Improved performance of insert... and fromList... functions.
Added some example code.
|0.2.1||2012-01-03||Documentation update: Added Big-O annotations.|
|0.2.0||2011-12-14||Changed argument order and name:
searchPoint -> containing,
searchInterval -> intersecting.
Added functions: within, findLast, updateMin/Max....