Name: combinatorial Version: 0.0 License: BSD3 License-File: LICENSE Author: Henning Thielemann Maintainer: Henning Thielemann Homepage: http://hub.darcs.net/thielema/combinatorial/ Category: Math, Statistics Synopsis: Count, enumerate, rank and unrank combinatorial objects 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. Tested-With: GHC==7.4.2, GHC==7.8.4, GHC==8.0.1 Cabal-Version: >=1.14 Build-Type: Simple Extra-Source-Files: Changes.md Source-Repository this Tag: 0.0 Type: darcs Location: http://hub.darcs.net/thielema/combinatorial/ Source-Repository head Type: darcs Location: http://hub.darcs.net/thielema/combinatorial/ Library Build-Depends: containers >=0.4.2 && <0.6, array >=0.4 && <0.6, transformers >=0.3 && <0.6, utility-ht >=0.0.8 && <0.13, base >=4.5 && <5 GHC-Options: -Wall -fwarn-missing-import-lists Hs-Source-Dirs: src Default-Language: Haskell98 Exposed-Modules: Combinatorics Combinatorics.Mastermind Combinatorics.PaperStripGame Combinatorics.CardPairs Combinatorics.MaxNim Combinatorics.TreeDepth Combinatorics.BellNumbers Combinatorics.Coin Combinatorics.Partitions Combinatorics.Permutation.WithoutSomeFixpoints Other-Modules: Combinatorics.Utility PowerSeries Polynomial Test-Suite combinatorial-test Type: exitcode-stdio-1.0 Build-Depends: combinatorial, QuickCheck >=2.5 && <3.0, utility-ht, base Main-Is: test/Test.hs GHC-Options: -Wall Default-Language: Haskell98