cabal-version:      2.2
name:               range-set-list
version:            0.1.4
x-revision:         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 ==8.6.5
   || ==8.8.4
   || ==8.10.7
   || ==9.0.2
   || ==9.2.8
   || ==9.4.8
   || ==9.6.6
   || ==9.8.2
   || ==9.10.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.12.0.0 && <4.21
    , containers  >=0.6.0.1  && <0.8
    , deepseq     >=1.4.4.0  && <1.6
    , hashable    >=1.4.7.0  && <1.6

  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
    , range-set-list
    , tasty             >=0.8 && <1.6
    , tasty-quickcheck  >=0.8 && <0.12

  if !impl(ghc >=8.0)
    build-depends: semigroups

  other-modules:
    IntMap
    List
    Map
    SetAction

  default-language: Haskell2010