[−][src]Trait rdx::TrySorter
A sorting function for small arrays of a given type.
Required methods
fn try_sort(
&mut self,
arr: &mut [K],
depth: isize,
iteration: usize,
force: bool
) -> bool
&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.
Implementations on Foreign Types
impl<'_, K, T> TrySorter<K> for &'_ mut T where
T: TrySorter<K>,
[src]
Loading content...
T: TrySorter<K>,
Implementors
impl<B, S, K> TrySorter<K> for RadixSortStrategyWith<B, S> where
S: TrySorter<K>,
[src]
S: TrySorter<K>,
impl<C, T> TrySorter<T> for ComparatorSort<C> where
C: FnMut(&T, &T) -> Ordering,
[src]
C: FnMut(&T, &T) -> Ordering,
impl<F, T, K> TrySorter<T> for KeyStrategy<F, T, K> where
F: FnMut(&T) -> K,
K: RadixSortKey,
[src]
F: FnMut(&T) -> K,
K: RadixSortKey,
impl<K: RadixSortKey> TrySorter<K> for DefaultStrategy
[src]
fn try_sort(
&mut self,
arr: &mut [K],
depth: isize,
_iteration: usize,
force: bool
) -> bool
[src]
&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.
impl<S, K> TrySorter<K> for TrySortWith<S> where
S: FnMut(&mut [K], isize, usize, bool) -> bool,
[src]
S: FnMut(&mut [K], isize, usize, bool) -> bool,