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>.

Total

3,698

Last month

597

Last week

103

Average per day

20

Daily downloads

Total downloads

Description file content

Package
arrangements
Type
Package
Title
Fast Generators and Iterators for Permutations, Combinations and Partitions
Version
1.0.2
Date
2018-01-18
Description
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 .
URL
License
MIT + file LICENSE
Depends
R (>= 3.4.0)
Imports
methods, R6, gmp
Suggests
foreach, testthat, knitr, rmarkdown
NeedsCompilation
yes
SystemRequirements
gmp (>= 4.2.3)
ByteCompile
yes
RoxygenNote
6.0.1
Packaged
2018-01-19 01:34:12 UTC; randy
Author
Randy Lai [aut, cre]
Maintainer
Randy Lai
Repository
CRAN
Date/Publication
2018-01-19 04:23:18 UTC

install.packages('arrangements')

1.0.2

5 months ago

https://randy3k.github.io/arrangements

Randy Lai

MIT + file LICENSE

Depends on

R (>= 3.4.0)

Imports

methods, R6, gmp

Suggests

foreach, testthat, knitr, rmarkdown

Discussions