Crate permutohedron [−] [src]

Structs

Heap	Heap's algorithm for generating permutations.

Constants

Maximum number of elements we can generate permutations for using Heap's algorithm (iterative version).

Traits

LexicalPermutation

Permute a slice into its next or previous permutation (in lexical order).

Functions

factorial	Compute n! (n factorial)
heap_recursive	Heap's algorithm for generating permutations, recursive version.

Keyboard Shortcuts

?: Show this help dialog
S: Focus the search field
⇤: Move up in search results
⇥: Move down in search results
⏎: Go to active search result
+: Collapse/expand all sections

Search Tricks

Prefix searches with a type followed by a colon (e.g. fn:) to restrict the search to a given type.

Accepted types are: fn, mod, struct, enum, trait, type, macro, and const.

Search functions by type signature (e.g. vec -> usize or * -> vec)