arrangements: Fast Generators and Iterators for Permutations, Combinations,
Integer Partitions and Compositions
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
||baskexact, CARM, distantia, gasmodel, iterpc, MKinfer, MOLHD, MultiStatM, NetFACS, SymbolicDeterminants
||colorSpec, gyro, skedastic
Please use the canonical form
to link to this page.