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
|Author||Randy Lai [aut, cre]|
|Date of publication||2018-09-16 04:30:15 UTC|
|Maintainer||Randy Lai <[email protected]>|
|License||MIT + file LICENSE|
|Package repository||View on CRAN|
Install the latest version of this package by entering the following in R:
Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.