The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.
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>.
Version: | 1.1.9 |
Depends: | R (≥ 3.4.0) |
Imports: | gmp, methods, R6 |
Suggests: | foreach, knitr, rmarkdown, testthat |
Published: | 2020-09-13 |
DOI: | 10.32614/CRAN.package.arrangements |
Author: | Randy Lai [aut, cre] |
Maintainer: | Randy Lai <randy.cs.lai at gmail.com> |
License: | MIT + file LICENSE |
URL: | https://github.com/randy3k/arrangements |
NeedsCompilation: | yes |
SystemRequirements: | gmp (>= 4.2.3) |
Materials: | README |
In views: | NumericalMathematics |
CRAN checks: | arrangements results |
Reference manual: | arrangements.pdf |
Package source: | arrangements_1.1.9.tar.gz |
Windows binaries: | r-devel: arrangements_1.1.9.zip, r-release: arrangements_1.1.9.zip, r-oldrel: arrangements_1.1.9.zip |
macOS binaries: | r-release (arm64): arrangements_1.1.9.tgz, r-oldrel (arm64): arrangements_1.1.9.tgz, r-release (x86_64): arrangements_1.1.9.tgz, r-oldrel (x86_64): arrangements_1.1.9.tgz |
Old sources: | arrangements archive |
Reverse depends: | sindyr |
Reverse imports: | baskexact, basksim, CARM, cia, distantia, exhaustiveRasch, gasmodel, iterpc, lancor, MKinfer, MOLHD, MultiStatM, NetFACS, SymbolicDeterminants |
Reverse suggests: | colorSpec, DiceView, gyro, skedastic, zonohedra |
Please use the canonical form https://CRAN.R-project.org/package=arrangements to link to this page.
These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.