Generate permutations iteratively without recursion in O(n) time.
A Rust library for iterating over random permutations using O(1) (i.e. constant) space.
Get a lexicographic cartesian product and lexicographic permutation at any specific index from data. Generate complete lexicographic cartesian product from single or multiple set of data. Generate complete lexicographic combination from data. Generate non-lexicographic permutation and k-permutation.
Extra iterator adaptors, iterator methods, free functions, and macros that work in parallel conexts.
An iterator following a space-filling pattern over a given range
...
Generate derangements of an iterable
Permutations iterator
Boost C++ library boost_compute packaged using Zanbil
Iterator types for output permutations from a function combining multiple discrete factors
High-performance pseudo-random permutations using Feistel networks with O(1) memory and O(1) time per element
Pure-Rust AV1 codec — orphan-rebuild scaffold pending clean-room re-implementation.