grouped-list-0.1.2.0: grouped-list.cabal

name:                grouped-list
version:             0.1.2.0
synopsis:            Grouped lists. Equal consecutive elements are grouped.
description:
  Grouped lists work like regular lists, except for two conditions:
  .
  * Grouped lists are always finite. Attempting to construct an infinite
    grouped list will result in an infinite loop.
  .
  * Grouped lists internally represent consecutive equal elements as only
    one, hence the name of /grouped lists/.
  .
  This mean that grouped lists are ideal for cases where the list has many
  repetitions (like @[1,1,1,1,7,7,7,7,7,7,7,7,2,2,2,2,2]@, although they might
  present some deficiencies in the absent of repetitions.
  .
  /Warning: this library is in early development./
license:             BSD3
license-file:        LICENSE
author:              Daniel Díaz
maintainer:          dhelta.diaz@gmail.com
category:            Data
build-type:          Simple
cabal-version:       >=1.10
bug-reports: https://github.com/Daniel-Diaz/grouped-list/issues
homepage: https://github.com/Daniel-Diaz/grouped-list/blob/master/README.md
extra-source-files: README.md, CHANGELOG.md

library
  default-language: Haskell2010
  exposed-modules: Data.GroupedList
  build-depends:
      base >= 4.8 && < 5
    , containers
    , pointed
    , deepseq
  ghc-options: -O2 -Wall

benchmark grouped-list-bench
  default-language: Haskell2010
  type: exitcode-stdio-1.0
  hs-source-dirs: bench
  main-is: Main.hs
  ghc-options: -O2 -Wall
  build-depends: base >= 4.8, grouped-list, criterion

source-repository head
  type: git
  location: https://github.com/Daniel-Diaz/grouped-list.git