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")