combinatorial: Count, enumerate, rank and unrank combinatorial objects
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.
Modules
[Index] [Quick Jump]
Downloads
- combinatorial-0.1.0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
| Versions [RSS] | 0.0, 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.7), transformers (>=0.3 && <0.6), utility-ht (>=0.0.8 && <0.1) [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.0.1 head: darcs get http://hub.darcs.net/thielema/combinatorial/ |
| Uploaded | by HenningThielemann at 2018-08-31T15:57:26Z |
| Distributions | LTSHaskell:0.1.1, NixOS:0.1.1, Stackage:0.1.1 |
| Reverse Dependencies | 2 direct, 1 indirect [details] |
| Downloads | 2715 total (23 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2018-08-31 [all 1 reports] |