combinatorial: Count, enumerate, rank and unrank combinatorial objects
This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.
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.
Properties
| Versions | 0.0, 0.1, 0.1, 0.1.0.1, 0.1.1 |
|---|---|
| Change log | Changes.md |
| Dependencies | array (>=0.4 && <0.6), base (>=4.5 && <5), containers (>=0.4.2 && <0.6), transformers (>=0.3 && <0.6), utility-ht (>=0.0.8 && <0.13) [details] |
| License | BSD-3-Clause |
| Author | Henning Thielemann <haskell@henning-thielemann.de> |
| Maintainer | Henning Thielemann <haskell@henning-thielemann.de> |
| Category | Math, Statistics |
| Home page | http://hub.darcs.net/thielema/combinatorial/ |
| Source repo | this: darcs get http://hub.darcs.net/thielema/combinatorial/ --tag 0.1 head: darcs get http://hub.darcs.net/thielema/combinatorial/ |
| Uploaded | by HenningThielemann at 2018-01-19T20:33:52Z |
Modules
[Index]
Downloads
- combinatorial-0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees