Trait indxvec::Mutops

source · [−]
pub trait Mutops<T> {
    fn mutquicksort(self)
    where
        T: PartialOrd;
    fn mutrevs(self);
    fn mutsorttwo(self, i0: usize, i1: usize) -> bool
    where
        T: PartialOrd;
    fn mutsortthree(self, i0: usize, i1: usize, i2: usize)
    where
        T: PartialOrd;
    fn muthashsort(self)
    where
        T: PartialOrd + Clone,
        f64: From<T>;
    fn muthashsortslice(self, i: usize, n: usize, min: T, max: T)
    where
        T: PartialOrd + Clone,
        f64: From<T>;
}
Expand description

Mutable Operators on &mut[T]

Required Methods

Sorts a mutable slice in place.

mutable reversal, general utility

utility that mutably swaps two indexed items into ascending order

utility that mutably bubble sorts three indexed items into ascending order

Possibly the fastest sort for long lists. Wrapper for muthashsortslice.

Sorts n items from i in self. Used by muthashsort.

Implementations on Foreign Types

Sorts a mutable slice in place. The fastest default Rust sort
It is the responsibility of the user to ensure that there are no NaNs etc.

Destructive reversal by swapping

sort two slice items if they are out of ascending order

sort three slice items if they are out of ascending order

N recursive hash sort. Sorts mutable first argument in place

Does the work for muthashsort Requires [min,max], the data range, that must enclose all its values. If the range is known in advance, use this in preference to muthashsort to save finding it

Implementors