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 < https://randy3k.github.io/arrangements/articles/benchmark.html>.


CRAN_Status_Badge

Github: https://github.com/randy3k/arrangements

Documentation: http://randy3k.github.io/arrangements

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.

Installation

Install the latest development version using

devtools::install_github("randy3k/arrangements")

News

Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.

install.packages("arrangements")

1.1.5 by Randy Lai, 8 months ago


https://randy3k.github.io/arrangements


Browse source code at https://github.com/cran/arrangements


Authors: Randy Lai [aut, cre]


Documentation:   PDF Manual  


Task views: Numerical Mathematics


MIT + file LICENSE license


Imports methods, R6, gmp

Suggests foreach, testthat, knitr, rmarkdown

System requirements: gmp (>= 4.2.3)


Imported by MOLHD, iterpc.

Depended on by sindyr.

Suggested by colorSpec.


See at CRAN