Trait sorted_insert::SortedInsertBinary
source · [−]pub trait SortedInsertBinary<T: Ord>: SortedInsertBinaryByKey<T> {
fn sorted_insert_asc_binary(&mut self, element: T) -> usize { ... }
fn sorted_insert_desc_binary(&mut self, element: T) -> usize { ... }
}Provided methods
fn sorted_insert_asc_binary(&mut self, element: T) -> usize
fn sorted_insert_asc_binary(&mut self, element: T) -> usize
Insert elements to this sorted collection in ascending order and return the inserted index. Use binary search to find the index where a matching element could be inserted.
fn sorted_insert_desc_binary(&mut self, element: T) -> usize
fn sorted_insert_desc_binary(&mut self, element: T) -> usize
Insert elements to this sorted collection in descending order and return the inserted index. Use binary search to find the index where a matching element could be inserted.