arrangements: Fast Generators and Iterators for Permutations, Combinations, Integer Partitions and Compositions (original) (raw)
Fast generators and iterators for permutations, combinations, integer partitions and compositions. The arrangements are in lexicographical order and generated iteratively in a memory efficient manner. It has been demonstrated that 'arrangements' outperforms most existing packages of similar kind. Benchmarks could be found at <https://randy3k.github.io/arrangements/articles/benchmark.html>.
Version: | 1.1.9 |
---|---|
Depends: | R (≥ 3.4.0) |
Imports: | gmp, methods, R6 |
Suggests: | foreach, knitr, rmarkdown, testthat |
Published: | 2020-09-13 |
DOI: | 10.32614/CRAN.package.arrangements |
Author: | Randy Lai [aut, cre] |
Maintainer: | Randy Lai <randy.cs.lai at gmail.com> |
License: | MIT + file |
URL: | https://github.com/randy3k/arrangements |
NeedsCompilation: | yes |
SystemRequirements: | gmp (>= 4.2.3) |
Materials: | README |
In views: | NumericalMathematics |
CRAN checks: | arrangements results |
Documentation:
Downloads:
Reverse dependencies:
Reverse depends: | sindyr |
---|---|
Reverse imports: | baskexact, basksim, CARM, cia, exhaustiveRasch, gasmodel, iterpc, lancor, MKinfer, MOLHD, MultiStatM, NetFACS, SymbolicDeterminants |
Reverse suggests: | colorSpec, DiceView, gyro, skedastic, zonohedra |
Linking:
Please use the canonical formhttps://CRAN.R-project.org/package=arrangementsto link to this page.