Trait sorted_insert::SortedInsert

pub trait SortedInsert<T: Ord> {
    fn sorted_insert_asc(&mut self, element: T) -> usize;
    fn sorted_insert_desc(&mut self, element: T) -> usize;
}

Required methods

fn sorted_insert_asc(&mut self, element: T) -> usize

Insert elements to this sorted collection in ascending order and return the inserted index. Use linear search to find the index where a matching element could be inserted.

fn sorted_insert_desc(&mut self, element: T) -> usize

Insert elements to this sorted collection in descending order and return the inserted index. Use linear search to find the index where a matching element could be inserted.

Loading content...

Implementations on Foreign Types

impl<T: Ord> SortedInsert<T> for Vec<T>

fn sorted_insert_asc(&mut self, element: T) -> usize

fn sorted_insert_desc(&mut self, element: T) -> usize

impl<T: Ord> SortedInsert<T> for VecDeque<T>

fn sorted_insert_asc(&mut self, element: T) -> usize

fn sorted_insert_desc(&mut self, element: T) -> usize

Loading content...

Implementors

Loading content...