Count, enumerate, rank and unrank combinatorial objects
|LTS Haskell 20.15:||0.1.1|
|Stackage Nightly 2023-03-23:||0.1.1|
|Latest on Hackage:||0.1.1|
Module documentation for 0.1.1
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.
exact-combinatorics: Efficient computations of large combinatoric numbers.
combinat: Library for a similar purpose with a different structure and selection of problems.
Change log for the
added explicit export lists, thus hide some helper functions and alternative implementations
use alternative implementations in tests
chooseFromIndex -> chooseUnrank
(==>)and custom cardinal types by
extracted from HTam package