arrangements: Fast Generators and Iterators for Permutations, Combinations, Integer Partitions and Compositions

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 <>.

Version: 1.1.9
Depends: R (≥ 3.4.0)
Imports: gmp, methods, R6
Suggests: foreach, knitr, rmarkdown, testthat
Published: 2020-09-13
Author: Randy Lai [aut, cre]
Maintainer: Randy Lai <randy.cs.lai at>
License: MIT + file LICENSE
NeedsCompilation: yes
SystemRequirements: gmp (>= 4.2.3)
Materials: README
In views: NumericalMathematics
CRAN checks: arrangements results


Reference manual: arrangements.pdf
Package source: arrangements_1.1.9.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
macOS binaries: r-release: arrangements_1.1.9.tgz, r-oldrel: arrangements_1.1.9.tgz
Old sources: arrangements archive

Reverse dependencies:

Reverse depends: sindyr
Reverse imports: distantia, iterpc, MKinfer, MOLHD, skedastic, SymbolicDeterminants
Reverse suggests: colorSpec


Please use the canonical form to link to this page.