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 <https://randy3k.github.io/arrangements/articles/benchmark.html>.
| Version: | 1.0.2 |
| Depends: | R (≥ 3.4.0) |
| Imports: | methods, R6, gmp |
| Suggests: | foreach, testthat, knitr, rmarkdown |
| Published: | 2018-01-19 |
| Author: | Randy Lai [aut, cre] |
| Maintainer: | Randy Lai <randy.cs.lai at gmail.com> |
| License: | MIT + file LICENSE |
| URL: | https://randy3k.github.io/arrangements |
| NeedsCompilation: | yes |
| SystemRequirements: | gmp (>= 4.2.3) |
| Materials: | README |
| In views: | NumericalMathematics |
| CRAN checks: | arrangements results |
| Reference manual: | arrangements.pdf |
| Package source: | arrangements_1.0.2.tar.gz |
| Windows binaries: | r-devel: arrangements_1.0.2.zip, r-release: arrangements_1.0.2.zip, r-oldrel: not available |
| OS X El Capitan binaries: | r-release: arrangements_1.0.2.tgz |
| OS X Mavericks binaries: | r-oldrel: not available |
| Old sources: | arrangements archive |
Please use the canonical form https://CRAN.R-project.org/package=arrangements to link to this page.