Trait algorithms_rs::sort::Sort

pub trait Sort<T: PartialOrd + Clone> {
    fn inner(&self) -> Vec<T>;
    fn sort_by<F>(&mut self, f: F)
    where
        F: FnOnce(&T, &T) -> bool + Copy;

    fn sort(&mut self) { ... }
    fn is_sort(&self) -> bool { ... }
    fn is_sort_by<F>(&self, f: F) -> bool
    where
        F: FnOnce(&T, &T) -> bool + Copy,
    { ... }
}

Generic interface to sorting algorithms

Required Methods

fn inner(&self) -> Vec<T>

Get the internal data

fn sort_by<F>(&mut self, f: F)where
    F: FnOnce(&T, &T) -> bool + Copy,

Customizable comparison logic based on closures

Provided Methods

fn sort(&mut self)

Sort by ascending order

fn is_sort(&self) -> bool

Determine if the sort is ascending

fn is_sort_by<F>(&self, f: F) -> boolwhere
    F: FnOnce(&T, &T) -> bool + Copy,

Customized judgments are ordered

Examples found in repository

src/sort/mod.rs (line 27)

    fn is_sort(&self) -> bool {
        self.is_sort_by(|v1, v2| v1 <= v2)
    }

Implementors

impl<T> Sort<T> for MergeSort<T>where
    T: PartialOrd + Default + Copy + Infite + Debug,

impl<T: Clone + PartialOrd> Sort<T> for BubbleSort<T>

impl<T: PartialOrd + Clone> Sort<T> for InsertSort<T>

impl<T: PartialOrd + Clone> Sort<T> for SelectSort<T>