name: folds category: Data, Comonads, Enumerator version: 0.7.8 x-revision: 2 license: BSD3 cabal-version: >= 1.10 license-file: LICENSE author: Edward A. Kmett maintainer: Edward A. Kmett stability: experimental homepage: http://github.com/ekmett/folds bug-reports: http://github.com/ekmett/folds/issues copyright: Copyright (C) 2009-2013 Edward A. Kmett build-type: Simple synopsis: Beautiful Folding tested-with: GHC == 8.0.2 , GHC == 8.2.2 , GHC == 8.4.4 , GHC == 8.6.5 , GHC == 8.8.4 , GHC == 8.10.7 , GHC == 9.0.2 , GHC == 9.2.2 extra-source-files: .gitignore .hlint.yaml .vim.custom CHANGELOG.markdown README.markdown description: This package is a playground full of comonadic folds. . This style of fold is documented in . This package can be seen as what happens if you chase Max Rabkin's to its logical conclusion. . More information on this approach can be found in the and posts by Conal Elliott, as well as in Gabriel Gonzales' source-repository head type: git location: git://github.com/ekmett/folds.git -- You can disable the optimizations -f-optimize for faster builds flag optimize default: True manual: True library build-depends: adjunctions >= 4.2 && < 5, base >= 4.9 && < 5, bifunctors >= 4 && < 6, comonad >= 4 && < 6, constraints >= 0.4 && < 1, contravariant >= 0.4.2 && < 2, data-reify >= 0.6 && < 0.7, distributive >= 0.3 && < 1, lens >= 4 && < 6, mtl >= 2.0.1 && < 2.4, pointed >= 4 && < 6, profunctors >= 5 && < 6, reflection >= 1.3 && < 3, semigroupoids >= 4 && < 7, transformers >= 0.3 && < 0.7, unordered-containers >= 0.2 && < 0.3, vector >= 0.10 && < 0.14 if impl(ghc < 7.8) build-depends: tagged >= 0.7 && < 1 if impl(ghc < 7.11) build-depends: semigroups >= 0.8 && < 1 hs-source-dirs: src exposed-modules: Data.Fold Data.Fold.Class Data.Fold.Internal Data.Fold.L Data.Fold.L' Data.Fold.L1 Data.Fold.L1' Data.Fold.M Data.Fold.M1 Data.Fold.R Data.Fold.R1 ghc-options: -Wall if flag(optimize) ghc-options: -O2 default-language: Haskell2010