arrangements (1.1.5)

0 users

Fast Generators and Iterators for Permutations, Combinations and Partitions.

https://randy3k.github.io/arrangements
http://cran.r-project.org/web/packages/arrangements

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 .

Maintainer: Randy Lai
Author(s): Randy Lai [aut, cre]

License: MIT + file LICENSE

Uses: gmp, R6, foreach, testthat, knitr, rmarkdown
Reverse depends: sindyr

Released 9 days ago.


9 previous versions

Ratings

Overall:

  (0 votes)

Documentation:

  (0 votes)

Log in to vote.

Reviews

No one has written a review of arrangements yet. Want to be the first? Write one now.


Related packages: Brobdingnag, Matrix, R.matlab, Rserve, Ryacas, SparseM, akima, combinat, elliptic, gmp, gsl, magic, matlab, matrixcalc, numDeriv, onion, orthopolynom, partitions, polynom, signal(20 best matches, based on common tags.)


Search for arrangements on google, google scholar, r-help, r-devel.

Visit arrangements on R Graphical Manual.