Cabal revisions of lattices-1.4
Hackage metadata revisions edit the .cabal file after upload; each diff below is one revision.
revision 1
-name: lattices-version: 1.4-cabal-version: >= 1.10-category: Math-license: BSD3-license-File: LICENSE-author: Maximilian Bolingbroke <batterseapower@hotmail.com>-maintainer: Oleg Grenrus <oleg.grenrus@iki.fi>-homepage: http://github.com/phadej/lattices/-bug-reports: http://github.com/phadej/lattices.git/issues-copyright: (C) 2010-2015 Maximilian Bolingbroke-build-type: Simple-extra-source-files: README.md CHANGELOG.md-tested-with: GHC==7.4.2, GHC==7.6.3, GHC==7.8.4, GHC==7.10.2-synopsis: Fine-grained library for constructing and manipulating lattices-description:- In mathematics, a lattice is a partially ordered set in which every two elements have a unique supremum (also called a least upper bound or @join@) and a unique infimum (also called a greatest lower bound or @meet@).--source-repository head- type: git- location: git://github.com/phadej/lattices.git--library- exposed-modules: Algebra.Enumerable,- Algebra.Lattice,- Algebra.Lattice.Dropped,- Algebra.Lattice.Levitated,- Algebra.Lattice.Lifted,- Algebra.PartialOrd-- build-depends: base >= 4.5 && < 4.9,- containers >= 0.3 && < 0.6,- deepseq >= 1.1 && < 1.5,- hashable >= 1.2 && < 1.3,- semigroups >= 0.16 && < 0.18,- tagged >= 0.7 && < 0.8,- void >= 0.7 && < 0.8,- unordered-containers >= 0.2 && < 0.3,- universe-base >= 1.0 && < 1.1,- universe-reverse-instances >= 1.0 && < 1.1- ghc-options: -Wall- default-language: Haskell2010-- if impl(ghc >= 7.4 && < 7.5)- build-depends: ghc-prim--test-suite test- type: exitcode-stdio-1.0- main-is: Tests.hs- hs-source-dirs: test- ghc-options: -Wall- default-language: Haskell2010- build-depends: base >= 4.5 && < 4.9,- tasty >= 0.10 && < 0.12,- tasty-quickcheck >= 0.8 && < 0.9,- lattices,- transformers,- QuickCheck+name: lattices +version: 1.4 +x-revision: 1 +cabal-version: >= 1.10 +category: Math +license: BSD3 +license-File: LICENSE +author: Maximilian Bolingbroke <batterseapower@hotmail.com> +maintainer: Oleg Grenrus <oleg.grenrus@iki.fi> +homepage: http://github.com/phadej/lattices/ +bug-reports: http://github.com/phadej/lattices.git/issues +copyright: (C) 2010-2015 Maximilian Bolingbroke +build-type: Simple +extra-source-files: README.md CHANGELOG.md +tested-with: GHC==7.4.2, GHC==7.6.3, GHC==7.8.4, GHC==7.10.2 +synopsis: Fine-grained library for constructing and manipulating lattices +description: + In mathematics, a lattice is a partially ordered set in which every two elements have a unique supremum (also called a least upper bound or @join@) and a unique infimum (also called a greatest lower bound or @meet@). + +source-repository head + type: git + location: git://github.com/phadej/lattices.git + +library + exposed-modules: Algebra.Enumerable, + Algebra.Lattice, + Algebra.Lattice.Dropped, + Algebra.Lattice.Levitated, + Algebra.Lattice.Lifted, + Algebra.PartialOrd + + build-depends: base >= 4.5 && < 4.9, + containers >= 0.3 && < 0.6, + deepseq >= 1.1 && < 1.5, + hashable >= 1.2 && < 1.3, + semigroups >= 0.16 && < 0.18, + tagged >= 0.7 && < 0.9, + void >= 0.7 && < 0.8, + unordered-containers >= 0.2 && < 0.3, + universe-base >= 1.0 && < 1.1, + universe-reverse-instances >= 1.0 && < 1.1 + ghc-options: -Wall + default-language: Haskell2010 + + if impl(ghc >= 7.4 && < 7.5) + build-depends: ghc-prim + +test-suite test + type: exitcode-stdio-1.0 + main-is: Tests.hs + hs-source-dirs: test + ghc-options: -Wall + default-language: Haskell2010 + build-depends: base >= 4.5 && < 4.9, + tasty >= 0.10 && < 0.12, + tasty-quickcheck >= 0.8 && < 0.9, + lattices, + transformers, + QuickCheck