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>.
Documentation: Downloads: Reverse dependencies: Reverse depends: sindyr Reverse imports: baskexact, basksim, budgetIVr, CARM, cia, exhaustiveRasch, gasmodel, iterpc, lancor, MKinfer, MOLHD, MultiStatM, QRscore, SymbolicDeterminants, voice Reverse suggests: colorSpec, DiceView, skedastic, zonohedra Linking:Please use the canonical form https://CRAN.R-project.org/package=arrangements to link to this page.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4