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

Package details

AuthorRandy Lai [aut, cre]
MaintainerRandy Lai <[email protected]>
LicenseMIT + file LICENSE
Version1.1.5
URL https://randy3k.github.io/arrangements
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:
install.packages("arrangements")

Try the arrangements package in your browser

Any scripts or data that you put into this service are public.

arrangements documentation built on Nov. 8, 2018, 5:04 p.m.