range-set-list-0.1.3.1: range-set-list.cabal

cabal-version:       >= 1.10
name:                range-set-list
version:             0.1.3.1

synopsis:            Memory efficient sets with ranges of elements.
category:            Data
description:         Memory efficient sets with continuous ranges of discrete, bounded elements. List- and map-based implementations. Interface mimics 'Data.Set' where possible.

homepage:            https://github.com/phadej/range-set-list#readme
bug-reports:         https://github.com/phadej/range-set-list/issues
license:             MIT
license-file:        LICENSE
author:              Oleg Grenrus <oleg.grenrus@iki.fi>
maintainer:          Oleg Grenrus <oleg.grenrus@iki.fi>
tested-with:         GHC==7.4.2, GHC==7.6.3, GHC==7.8.4, GHC==7.10.3, GHC==8.0.2, GHC==8.2.2, GHC==8.4.4, GHC==8.6.5, GHC==8.8.1
build-type:          Simple

extra-source-files:
  CHANGELOG.md
  README.md

source-repository head
  type: git
  location: https://github.com/phadej/range-set-list

library
  hs-source-dirs:
    src
  other-extensions: DeriveDataTypeable Safe
  ghc-options: -Wall -fwarn-tabs
  build-depends:
    base        >=4.5      && <4.14,
    containers  >=0.5.3    && <0.7,
    deepseq     >=1.3.0.0  && <1.5,
    hashable    >=1.2.3.3  && <1.4
  if !impl(ghc >= 8.0)
    build-depends:
      semigroups  >=0.16.2.2 && <0.20
  exposed-modules:
    Data.RangeSet.Internal
    Data.RangeSet.IntMap
    Data.RangeSet.List
    Data.RangeSet.Map
  default-language: Haskell2010

test-suite test
  type: exitcode-stdio-1.0
  main-is: Tests.hs
  hs-source-dirs:
    tests
  ghc-options: -Wall -fwarn-tabs
  build-depends:
    base,
    containers,
    deepseq,
    hashable,
    containers,
    tasty             >=0.8 && <1.3,
    tasty-quickcheck  >=0.8 && <0.11,
    range-set-list
  if !impl(ghc >= 8.0)
    build-depends:
      semigroups
  other-modules:
    IntMap
    List
    Map
    SetAction
  default-language: Haskell2010