arrangements (1.1.0)

Fast Generators and Iterators for Permutations, Combinations and Partitions.

Fast generators and iterators for permutations, combinations and partitions. The iterators allow users to generate arrangements in a memory efficient manner and the generated arrangements are in lexicographical (dictionary) order. Permutations and combinations can be drawn with/without replacement and support multisets. It has been demonstrated that 'arrangements' outperforms most of the existing packages of similar kind. Some benchmarks could be found at .

Maintainer: Randy Lai
Author(s): Randy Lai [aut, cre]

License: MIT + file LICENSE

Uses: gmp, R6, foreach, testthat, knitr, rmarkdown
Reverse depends: sindyr
Reverse suggests: colorSpec

Released over 1 year ago.