[−][src]Crate permute
permute
Generate permutations of a slice in a memory-efficient and deterministic manner, using Heap's algorithm.
Modules
| arbitrary_tandem_control_iter | An iterator over a slice that uses another iterator to control the next element in the sequence. |
Functions
| permutations_of | Produce an iterator over iterators, each one of which yields one permutation of the provided slice. No copying of elements of the slice occurs. |
| permute | Generate permutations of a given |