Trait indxvec::Mutsort

source · [−]
pub trait Mutsort<T> {
    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, min: f64, max: f64)
    where
        T: PartialOrd + Copy,
        f64: From<T>;
    fn muthashsortslice(self, i: usize, n: usize, min: f64, max: f64)
    where
        T: PartialOrd + Copy,
        f64: From<T>;
}

Required Methods

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

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 (slice) in place Requires [min,max], the data range, that must enclose all its values. The range is often known in advance. If not, it can be obtained with minmaxt().

Does the work for muthashsort

Implementors