Trait ISortedSet_1Methods 

pub trait ISortedSet_1Methods<T0: ClassIdentity>: ClassIdentity {
    // Provided methods
    fn ctor(self)
       where Self: Sized { ... }
    fn ctor_2(self, comparer: IComparer_1_Interface<T0>)
       where Self: Sized { ... }
    fn in_order_tree_walk(self, action: TreeWalkPredicate_1<T0>) -> bool
       where Self: Sized { ... }
    fn get_count(self) -> i32
       where Self: Sized { ... }
    fn system_collections_i_collection_get_is_synchronized(self) -> bool
       where Self: Sized { ... }
    fn system_collections_i_collection_get_sync_root(self) -> Object
       where Self: Sized { ... }
    fn version_check(self)
       where Self: Sized { ... }
    fn is_within_range(self, item: T0) -> bool
       where Self: Sized { ... }
    fn add(self, item: T0) -> bool
       where Self: Sized { ... }
    fn add_if_not_present(self, item: T0) -> bool
       where Self: Sized { ... }
    fn remove(self, item: T0) -> bool
       where Self: Sized { ... }
    fn do_remove(self, item: T0) -> bool
       where Self: Sized { ... }
    fn clear(self)
       where Self: Sized { ... }
    fn contains(self, item: T0) -> bool
       where Self: Sized { ... }
    fn copy_to(self, array: Array<T0>, index: i32)
       where Self: Sized { ... }
    fn copy_to_2(self, array: Array<T0>, index: i32, count: i32)
       where Self: Sized { ... }
    fn system_collections_i_collection_copy_to(
        self,
        array: IlInstance,
        index: i32,
    )
       where Self: Sized { ... }
    fn get_enumerator(self) -> SortedSet_1_Enumerator<T0>
       where Self: Sized { ... }
    fn system_collections_i_enumerable_get_enumerator(self) -> IEnumerator
       where Self: Sized { ... }
    fn insertion_balance(
        self,
        current: SortedSet_1_Node<T0>,
        grand_parent: SortedSet_1_Node<T0>,
        great_grand_parent: SortedSet_1_Node<T0>,
    ) -> ((), SortedSet_1_Node<T0>)
       where Self: Sized { ... }
    fn replace_child_or_root(
        self,
        parent: SortedSet_1_Node<T0>,
        child: SortedSet_1_Node<T0>,
        new_child: SortedSet_1_Node<T0>,
    )
       where Self: Sized { ... }
    fn replace_node(
        self,
        match: SortedSet_1_Node<T0>,
        parent_of_match: SortedSet_1_Node<T0>,
        successor: SortedSet_1_Node<T0>,
        parent_of_successor: SortedSet_1_Node<T0>,
    )
       where Self: Sized { ... }
    fn find_node(self, item: T0) -> SortedSet_1_Node<T0>
       where Self: Sized { ... }
    fn update_version(self)
       where Self: Sized { ... }
    fn system_runtime_serialization_i_deserialization_callback_on_deserialization(
        self,
        sender: Object,
    )
       where Self: Sized { ... }
    fn on_deserialization(self, sender: Object)
       where Self: Sized { ... }
    fn log2(value: i32) -> i32 { ... }
}

Provided Methods

fn ctor(self)

where Self: Sized,

fn ctor_2(self, comparer: IComparer_1_Interface<T0>)

where Self: Sized,

fn in_order_tree_walk(self, action: TreeWalkPredicate_1<T0>) -> bool

where Self: Sized,

fn get_count(self) -> i32

where Self: Sized,

fn system_collections_i_collection_get_is_synchronized(self) -> bool

where Self: Sized,

fn system_collections_i_collection_get_sync_root(self) -> Object

where Self: Sized,

fn version_check(self)

where Self: Sized,

fn is_within_range(self, item: T0) -> bool

where Self: Sized,

fn add(self, item: T0) -> bool

where Self: Sized,

fn add_if_not_present(self, item: T0) -> bool

where Self: Sized,

fn remove(self, item: T0) -> bool

where Self: Sized,

fn do_remove(self, item: T0) -> bool

where Self: Sized,

fn clear(self)

where Self: Sized,

fn contains(self, item: T0) -> bool

where Self: Sized,

fn copy_to(self, array: Array<T0>, index: i32)

where Self: Sized,

fn copy_to_2(self, array: Array<T0>, index: i32, count: i32)

where Self: Sized,

fn system_collections_i_collection_copy_to(self, array: IlInstance, index: i32)

where Self: Sized,

fn get_enumerator(self) -> SortedSet_1_Enumerator<T0>

where Self: Sized,

fn system_collections_i_enumerable_get_enumerator(self) -> IEnumerator

where Self: Sized,

fn insertion_balance( self, current: SortedSet_1_Node<T0>, grand_parent: SortedSet_1_Node<T0>, great_grand_parent: SortedSet_1_Node<T0>, ) -> ((), SortedSet_1_Node<T0>)

where Self: Sized,

fn replace_child_or_root( self, parent: SortedSet_1_Node<T0>, child: SortedSet_1_Node<T0>, new_child: SortedSet_1_Node<T0>, )

where Self: Sized,

fn replace_node( self, match: SortedSet_1_Node<T0>, parent_of_match: SortedSet_1_Node<T0>, successor: SortedSet_1_Node<T0>, parent_of_successor: SortedSet_1_Node<T0>, )

where Self: Sized,

fn find_node(self, item: T0) -> SortedSet_1_Node<T0>

where Self: Sized,

fn update_version(self)

where Self: Sized,

fn system_runtime_serialization_i_deserialization_callback_on_deserialization( self, sender: Object, )

where Self: Sized,

fn on_deserialization(self, sender: Object)

where Self: Sized,

fn log2(value: i32) -> i32

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, __U: ISortedSet_1<T0> + ClassIdentity> ISortedSet_1Methods<T0> for __U