Trait sorted_insert::SortedInsertBinaryBy [−][src]
pub trait SortedInsertBinaryBy<T>: SortedInsertBy<T> { fn sorted_insert_binary_by<F: FnMut(&T, &T) -> Ordering>(
&mut self,
element: T,
f: F
) -> usize { ... } }
Provided methods
fn sorted_insert_binary_by<F: FnMut(&T, &T) -> Ordering>(
&mut self,
element: T,
f: F
) -> usize[src]
&mut self,
element: T,
f: F
) -> usize
Insert elements to this sorted collection by a specific comparator and return the inserted index. Use binary search to find the index where a matching element could be inserted.