Struct eytzinger::permutation::SparseHeapPermutator

pub struct SparseHeapPermutator { /* fields omitted */ }

Permutator that uses an auxiliary heap buffer to ensure linear runtime.

Worst-case runtime is O(n), worst-case memory usage is also O(n). The difference to HeapPermutator is that this implementation uses a HashMap instead of a Vec for storage. Hence, the exact the memory usage can no longer be predicted - but in return, it should be lower in most cases. This is a decent permutator for large permutations.

Trait Implementations

impl Debug for SparseHeapPermutator

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for SparseHeapPermutator

fn default() -> SparseHeapPermutator

Returns the “default value” for a type.

impl<T, P: ?Sized + Permutation> Permutator<T, P> for SparseHeapPermutator

fn permute(&mut self, data: &mut [T], permutation: &P)

Applies the given permutation to the given array.