Skip to main content

IArraySortHelper_1Methods

engage::system::collections::generic::arraysorthelper_1

Trait IArraySortHelper_1Methods 

Source 
pub trait IArraySortHelper_1Methods<T0: ClassIdentity>: ClassIdentity {
    // Provided methods
    fn sort(
        keys: Array<T0>,
        index: i32,
        length: i32,
        comparer: IComparer_1_Interface<T0>,
    ) { ... }
    fn binary_search(
        array: Array<T0>,
        index: i32,
        length: i32,
        value: T0,
        comparer: IComparer_1_Interface<T0>,
    ) -> i32 { ... }
    fn sort_2(
        keys: Array<T0>,
        index: i32,
        length: i32,
        comparer: Comparison_1<T0>,
    ) { ... }
    fn internal_binary_search(
        array: Array<T0>,
        index: i32,
        length: i32,
        value: T0,
        comparer: IComparer_1_Interface<T0>,
    ) -> i32 { ... }
    fn swap_if_greater(
        keys: Array<T0>,
        comparer: Comparison_1<T0>,
        a: i32,
        b: i32,
    ) { ... }
    fn swap(a: Array<T0>, i: i32, j: i32) { ... }
    fn introspective_sort(
        keys: Array<T0>,
        left: i32,
        length: i32,
        comparer: Comparison_1<T0>,
    ) { ... }
    fn intro_sort(
        keys: Array<T0>,
        lo: i32,
        hi: i32,
        depth_limit: i32,
        comparer: Comparison_1<T0>,
    ) { ... }
    fn pick_pivot_and_partition(
        keys: Array<T0>,
        lo: i32,
        hi: i32,
        comparer: Comparison_1<T0>,
    ) -> i32 { ... }
    fn heapsort(keys: Array<T0>, lo: i32, hi: i32, comparer: Comparison_1<T0>) { ... }
    fn down_heap(
        keys: Array<T0>,
        i: i32,
        n: i32,
        lo: i32,
        comparer: Comparison_1<T0>,
    ) { ... }
    fn insertion_sort(
        keys: Array<T0>,
        lo: i32,
        hi: i32,
        comparer: Comparison_1<T0>,
    ) { ... }
}

Provided Methods§

Source

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

Source

fn sort_2(keys: Array<T0>, index: i32, length: i32, comparer: Comparison_1<T0>)

Source

fn swap_if_greater(keys: Array<T0>, comparer: Comparison_1<T0>, a: i32, b: i32)

Source

fn swap(a: Array<T0>, i: i32, j: i32)

Source

fn introspective_sort( keys: Array<T0>, left: i32, length: i32, comparer: Comparison_1<T0>, )

Source

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

Source

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

Source

fn heapsort(keys: Array<T0>, lo: i32, hi: i32, comparer: Comparison_1<T0>)

Source

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

Source

fn insertion_sort(keys: Array<T0>, lo: i32, hi: i32, comparer: Comparison_1<T0>)

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§