Struct rdx::TrySortWith

pub struct TrySortWith<S>(pub S);

Treat a function as a try sort function. Assumes that: true is returned if and only if the input array is sorted The input array can be permuted arbitrarily, but no elements may be changed If force is true, then the input array must always be sorted

Trait Implementations

impl<S: Clone> Clone for TrySortWith<S>

fn clone(&self) -> TrySortWith<S>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<S: Copy> Copy for TrySortWith<S>

impl<S: Debug> Debug for TrySortWith<S>

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

Formats the value using the given formatter.

impl<S, K> TrySorter<K> for TrySortWith<S> where
    S: FnMut(&mut [K], isize, usize, bool) -> bool, 

fn try_sort(
    &mut self,
    arr: &mut [K],
    depth: isize,
    iteration: usize,
    force: bool
) -> bool

Try to sort arr, assuming we're at a given depth and iteration. Return whether the array was sorted. If force is true, then should always sort.