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

Version: 1.1.7
Depends: R (≥ 3.4.0)
Imports: gmp, methods, R6
Suggests: foreach, knitr, rmarkdown, testthat
Published: 2019-11-02
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.7.tar.gz
Windows binaries: r-devel:, r-devel-gcc8:, r-release:, r-oldrel:
OS X binaries: r-release: arrangements_1.1.7.tgz, r-oldrel: arrangements_1.1.7.tgz
Old sources: arrangements archive

Reverse dependencies:

Reverse depends: sindyr
Reverse imports: distantia, iterpc, MOLHD
Reverse suggests: colorSpec


Please use the canonical form to link to this page.