Trait IArraySortHelper_2Methods 

pub trait IArraySortHelper_2Methods<T0: ClassIdentity, T1: ClassIdentity>: ClassIdentity {
    // Provided methods
    fn get_default() -> ArraySortHelper_2<T0, T1> { ... }
    fn create_array_sort_helper() -> ArraySortHelper_2<T0, T1> { ... }
    fn sort(
        self,
        keys: Array<T0>,
        values: Array<T1>,
        index: i32,
        length: i32,
        comparer: IComparer_1_Interface<T0>,
    )
       where Self: Sized { ... }
    fn swap_if_greater_with_items(
        keys: Array<T0>,
        values: Array<T1>,
        comparer: IComparer_1_Interface<T0>,
        a: i32,
        b: i32,
    ) { ... }
    fn swap(keys: Array<T0>, values: Array<T1>, i: i32, j: i32) { ... }
    fn introspective_sort(
        keys: Array<T0>,
        values: Array<T1>,
        left: i32,
        length: i32,
        comparer: IComparer_1_Interface<T0>,
    ) { ... }
    fn intro_sort(
        keys: Array<T0>,
        values: Array<T1>,
        lo: i32,
        hi: i32,
        depth_limit: i32,
        comparer: IComparer_1_Interface<T0>,
    ) { ... }
    fn pick_pivot_and_partition(
        keys: Array<T0>,
        values: Array<T1>,
        lo: i32,
        hi: i32,
        comparer: IComparer_1_Interface<T0>,
    ) -> i32 { ... }
    fn heapsort(
        keys: Array<T0>,
        values: Array<T1>,
        lo: i32,
        hi: i32,
        comparer: IComparer_1_Interface<T0>,
    ) { ... }
    fn down_heap(
        keys: Array<T0>,
        values: Array<T1>,
        i: i32,
        n: i32,
        lo: i32,
        comparer: IComparer_1_Interface<T0>,
    ) { ... }
    fn insertion_sort(
        keys: Array<T0>,
        values: Array<T1>,
        lo: i32,
        hi: i32,
        comparer: IComparer_1_Interface<T0>,
    ) { ... }
    fn ctor(self)
       where Self: Sized { ... }
}

Provided Methods

fn get_default() -> ArraySortHelper_2<T0, T1>

fn create_array_sort_helper() -> ArraySortHelper_2<T0, T1>

fn sort( self, keys: Array<T0>, values: Array<T1>, index: i32, length: i32, comparer: IComparer_1_Interface<T0>, )

where Self: Sized,

fn swap_if_greater_with_items( keys: Array<T0>, values: Array<T1>, comparer: IComparer_1_Interface<T0>, a: i32, b: i32, )

fn swap(keys: Array<T0>, values: Array<T1>, i: i32, j: i32)

fn introspective_sort( keys: Array<T0>, values: Array<T1>, left: i32, length: i32, comparer: IComparer_1_Interface<T0>, )

fn intro_sort( keys: Array<T0>, values: Array<T1>, lo: i32, hi: i32, depth_limit: i32, comparer: IComparer_1_Interface<T0>, )

fn pick_pivot_and_partition( keys: Array<T0>, values: Array<T1>, lo: i32, hi: i32, comparer: IComparer_1_Interface<T0>, ) -> i32

fn heapsort( keys: Array<T0>, values: Array<T1>, lo: i32, hi: i32, comparer: IComparer_1_Interface<T0>, )

fn down_heap( keys: Array<T0>, values: Array<T1>, i: i32, n: i32, lo: i32, comparer: IComparer_1_Interface<T0>, )

fn insertion_sort( keys: Array<T0>, values: Array<T1>, lo: i32, hi: i32, comparer: IComparer_1_Interface<T0>, )

fn ctor(self)

where Self: Sized,

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.

Implementors

impl<T0: ClassIdentity, T1: ClassIdentity, __U: IArraySortHelper_2<T0, T1> + ClassIdentity> IArraySortHelper_2Methods<T0, T1> for __U