name:         rational-list
version:      1.0.0.0
license:      BSD3
license-file: LICENSE
author:       Ross Paterson
maintainer:   Ross Paterson <R.Paterson@city.ac.uk>
bug-reports:  http://hub.darcs.net/ross/rational-list/issues
category:     Data Structures
synopsis:     finite or repeating lists
description:
    A rational list is a list that is either finite or of the form
    @xs ++ cycle ys@ where @xs@ and @ys@ are finite lists and @ys@
    is non-empty.  Such lists have a finite representation, supporting
    list operations that terminate even for infinite lists, and are
    often more efficient.
build-type: Simple
cabal-version: >= 1.10
extra-source-files:
    changelog.md

source-repository head
  type: darcs
  location: http://hub.darcs.net/ross/rational-list

library
  build-depends: base >= 4.11 && < 6, containers
  hs-source-dirs: .
  default-language: Haskell2010
  exposed-modules:
    Data.RationalList

test-suite properties
  type: exitcode-stdio-1.0
  main-is: properties.hs
  default-language: Haskell2010
  build-depends:
    base >= 4.11 && < 6,
    QuickCheck,
    test-framework,
    test-framework-quickcheck2