Learn R Programming

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

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

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

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.

Installation

You can install the released version of arrangements from CRAN with:

install.packages("arrangements")

Install the latest development version using

devtools::install_github("randy3k/arrangements")

Copy Link

Version

Install

install.packages('arrangements')

Monthly Downloads

3,910

Version

1.1.9

License

MIT + file LICENSE

Issues

Pull Requests

Stars

Forks

Maintainer

Randy Lai

Last Published

September 13th, 2020

Functions in arrangements (1.1.9)

combinations

Combinations generator
Combinations

Combinations iterator
npartitions

Number of partitions
arrangements-package

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

Compositions generator
ncompositions

Number of compositions
Permutations

Permutations iterator
Partitions

Partitions iterator
Compositions

Compositions iterator
permutations

Permutations generator
npermutations

Number of permutations
partitions

Partitions generator
ncombinations

Number of combinations