Name:                IntervalMap
Version:             0.2.1
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 <chbreitkopf@googlemail.com>
bug-reports:         mailto:chbreitkopf@googlemail.com
Copyright:           Copyright 2011 Christoph Breitkopf
Category:            Data
Build-type:          Simple
Cabal-version:       >= 1.8
Tested-With:         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.

extra-source-files:
  README
  test/*.hs
  examples/*.hs

Library
  Exposed-modules:     Data.IntervalMap, Data.IntervalMap.Interval
  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:      IntervalMap, base, QuickCheck, Cabal >= 1.9.2

Test-Suite TestIntervalMap
  type:               exitcode-stdio-1.0
  main-is:            IntervalMapTests.hs
  hs-source-dirs:     test
  build-depends:      IntervalMap, base, QuickCheck, Cabal >= 1.9.2