Name: IntervalMap Version: 0.3.0.3 Stability: experimental Synopsis: Maps from Intervals to values, with efficient search. Homepage: http://www.chr-breitkopf.de/comp/IntervalMap License: BSD3 License-file: LICENSE Author: Christoph Breitkopf Maintainer: Christoph Breitkopf bug-reports: mailto:chbreitkopf@gmail.com Copyright: 2011-2014 Christoph Breitkopf Category: Data Build-type: Simple Cabal-version: >= 1.8 Tested-With: GHC==7.8.3, GHC==7.6.3, GHC==7.4.2, GHC==7.0.4, GHC==6.12.1 Description: 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. extra-source-files: README.md test/*.hs examples/*.lhs Library Exposed-modules: Data.IntervalMap, Data.IntervalMap.Lazy, Data.IntervalMap.Strict, Data.IntervalMap.Interval other-modules: Data.IntervalMap.Base Build-depends: base >= 4 && < 5, containers, deepseq ghc-options: -Wall if impl(ghc >= 6.8) ghc-options: -fwarn-tabs Test-Suite TestInterval type: exitcode-stdio-1.0 main-is: IntervalTests.hs hs-source-dirs: . test build-depends: base >= 4 && < 5, containers, deepseq, QuickCheck, Cabal >= 1.9.2 Test-Suite TestIntervalMap type: exitcode-stdio-1.0 main-is: IntervalMapTests.hs hs-source-dirs: . test build-depends: base >= 4 && < 5, containers, deepseq, QuickCheck, Cabal >= 1.9.2 benchmark bench-all type: exitcode-stdio-1.0 hs-source-dirs: . bench main-is: BenchAll.hs Build-depends: base >= 4 && < 5, containers, random, deepseq, criterion >= 1.0 ghc-options: -Wall source-repository head type: darcs location: http://hub.darcs.net/bokesan/IntervalMap