name: range-set-list
version: 0.0.1
synopsis: Memory efficient sets with continuous ranges of elements. List based implementation.
description: Memory efficient sets with continuous ranges of elements. List based implementation. Interface mimics "Data.Set" interface where possible.
homepage: https://github.com/phadej/range-set-list
bug-reports: https://github.com/phadej/range-set-list/issues
license: MIT
license-file: LICENSE
stability: experimental
author: Oleg Grenrus
maintainer: oleg.grenrus@iki.fi
copyright: Copyright (c) 2013 Oleg Grenrus
category: Data Structures
build-type: Simple
cabal-version: >=1.10
library
exposed-modules: Data.RangeSet.List
build-depends: base >=4.6 && <5
default-language: Haskell98
ghc-options: -Wall
test-suite test
default-language: Haskell2010
type: exitcode-stdio-1.0
hs-source-dirs: tests
main-is: Tests.hs
ghc-options: -Wall
build-depends: base >=4.6 && <5,
containers >= 0.5 && <0.6,
tasty >= 0.7,
tasty-quickcheck >= 0.3,
range-set-list