Cabal revisions of mono-traversable-1.0.0.1
Hackage metadata revisions edit the .cabal file after upload; each diff below is one revision.
revision 1
-name: mono-traversable-version: 1.0.0.1-synopsis: Type classes for mapping, folding, and traversing monomorphic containers-description: Monomorphic variants of the Functor, Foldable, and Traversable typeclasses. If you understand Haskell's basic typeclasses, you understand mono-traversable. In addition to what you are used to, it adds on an IsSequence typeclass and has code for marking data structures as non-empty.-homepage: https://github.com/snoyberg/mono-traversable-license: MIT-license-file: LICENSE-author: Michael Snoyman, John Wiegley, Greg Weber-maintainer: michael@snoyman.com-category: Data-build-type: Simple-extra-source-files: README.md- ChangeLog.md-cabal-version: >=1.10--library- ghc-options: -Wall- exposed-modules: Data.MonoTraversable- Data.MonoTraversable.Unprefixed- Data.Containers- Data.Sequences- Data.NonNull- build-depends: base >= 4.5 && < 5- , containers >= 0.4- , unordered-containers >=0.2- , hashable- , bytestring >= 0.9- , text >=0.11- , transformers >=0.3- , vector >=0.10- , vector-algorithms >= 0.6- , split >= 0.2-- if impl(ghc < 8.0)- build-depends: semigroups >= 0.10-- hs-source-dirs: src- default-language: Haskell2010--test-suite test- main-is: main.hs- type: exitcode-stdio-1.0- hs-source-dirs: test- other-modules: Spec- default-language: Haskell2010- ghc-options: -O0- build-depends: base- , mono-traversable- , bytestring- , text- , hspec- , HUnit- , transformers- , vector- , QuickCheck- , semigroups- , containers- , unordered-containers- , foldl--benchmark sorting- type: exitcode-stdio-1.0- hs-source-dirs: bench- build-depends: base- , criterion- , mono-traversable- , vector- , mwc-random- main-is: sorting.hs- ghc-options: -Wall -O2- default-language: Haskell2010--source-repository head- type: git- location: git://github.com/snoyberg/mono-traversable.git+name: mono-traversable +version: 1.0.0.1 +x-revision: 1 +synopsis: Type classes for mapping, folding, and traversing monomorphic containers +description: Monomorphic variants of the Functor, Foldable, and Traversable typeclasses. If you understand Haskell's basic typeclasses, you understand mono-traversable. In addition to what you are used to, it adds on an IsSequence typeclass and has code for marking data structures as non-empty. +homepage: https://github.com/snoyberg/mono-traversable +license: MIT +license-file: LICENSE +author: Michael Snoyman, John Wiegley, Greg Weber +maintainer: michael@snoyman.com +category: Data +build-type: Simple +extra-source-files: README.md + ChangeLog.md +cabal-version: >=1.10 + +library + ghc-options: -Wall + exposed-modules: Data.MonoTraversable + Data.MonoTraversable.Unprefixed + Data.Containers + Data.Sequences + Data.NonNull + build-depends: base >= 4.7 && < 5 + , containers >= 0.4 + , unordered-containers >=0.2 + , hashable + , bytestring >= 0.9 + , text >=0.11 + , transformers >=0.3 + , vector >=0.10 + , vector-algorithms >= 0.6 + , split >= 0.2 + + if impl(ghc < 8.0) + build-depends: semigroups >= 0.10 + + hs-source-dirs: src + default-language: Haskell2010 + +test-suite test + main-is: main.hs + type: exitcode-stdio-1.0 + hs-source-dirs: test + other-modules: Spec + default-language: Haskell2010 + ghc-options: -O0 + build-depends: base + , mono-traversable + , bytestring + , text + , hspec + , HUnit + , transformers + , vector + , QuickCheck + , semigroups + , containers + , unordered-containers + , foldl + +benchmark sorting + type: exitcode-stdio-1.0 + hs-source-dirs: bench + build-depends: base + , criterion + , mono-traversable + , vector + , mwc-random + main-is: sorting.hs + ghc-options: -Wall -O2 + default-language: Haskell2010 + +source-repository head + type: git + location: git://github.com/snoyberg/mono-traversable.git
revision 2
name: mono-traversable version: 1.0.0.1 -x-revision: 1 +x-revision: 2 synopsis: Type classes for mapping, folding, and traversing monomorphic containers description: Monomorphic variants of the Functor, Foldable, and Traversable typeclasses. If you understand Haskell's basic typeclasses, you understand mono-traversable. In addition to what you are used to, it adds on an IsSequence typeclass and has code for marking data structures as non-empty. homepage: https://github.com/snoyberg/mono-traversable Data.Containers Data.Sequences Data.NonNull - build-depends: base >= 4.7 && < 5 + build-depends: base >= 4.7 && < 4.10 , containers >= 0.4 , unordered-containers >=0.2 , hashable
revision 3
name: mono-traversable version: 1.0.0.1 -x-revision: 2 +x-revision: 3 synopsis: Type classes for mapping, folding, and traversing monomorphic containers description: Monomorphic variants of the Functor, Foldable, and Traversable typeclasses. If you understand Haskell's basic typeclasses, you understand mono-traversable. In addition to what you are used to, it adds on an IsSequence typeclass and has code for marking data structures as non-empty. homepage: https://github.com/snoyberg/mono-traversable , hashable , bytestring >= 0.9 , text >=0.11 - , transformers >=0.3 + , transformers >=0.3 && <0.6 , vector >=0.10 , vector-algorithms >= 0.6 , split >= 0.2