homepage: http://hub.darcs.net/thielema/combinatorial/
changelog-type: markdown
hash: 626b3e4837e6ed0f9bdb795b88f7b36b30a050c063fa15467a85968a5b835786
test-bench-deps:
  base: -any
  utility-ht: -any
  combinatorial: -any
  QuickCheck: ! '>=2.5 && <3.0'
maintainer: Henning Thielemann <haskell@henning-thielemann.de>
synopsis: Count, enumerate, rank and unrank combinatorial objects
changelog: ! '# Change log for the `combinatorial` package


  ## 0.0


  * Tests: replaced `(==>)` and custom cardinal types by `QC.forAll`.


  * extracted from HTam package

'
basic-deps:
  base: ! '>=4.5 && <5'
  array: ! '>=0.4 && <0.6'
  utility-ht: ! '>=0.0.8 && <0.13'
  containers: ! '>=0.4.2 && <0.6'
  transformers: ! '>=0.3 && <0.6'
all-versions:
- '0.0'
author: Henning Thielemann <haskell@henning-thielemann.de>
latest: '0.0'
description-type: haddock
description: ! 'Counting, enumerating, ranking and unranking of combinatorial objects.

  Well-known and less well-known basic combinatoric problems and examples.


  The functions are not implemented in obviously stupid ways,

  but they are also not optimized to the maximum extent.

  The package is plain Haskell 98.


  See also:


  * @exact-combinatorics@:

  Efficient computations of large combinatoric numbers.


  * @combinat@:

  Library for a similar purpose

  with a different structure and selection of problems.'
license-name: BSD3

Update from Hackage at 2017-12-16T11:39:08Z
Update from Hackage at 2017-12-16T11:39:08Z
