fn sorted_insert_binary_by<F: FnMut(&T, &T) -> Ordering>(
        &mut self,
        element: T,
        mut f: F,
    ) -> usize {
        let index = self.get_sorted_insert_index_binary_by(|e| f(e, &element));

        self.insert_element(index, element);

        index
    }
/// 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.
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.
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 .
fn sorted_insert_binary_by<F: FnMut(&T, &T) -> Ordering>(
        &mut self,
        element: T,
        mut f: F,
    ) -> usize {
        let index = self.get_sorted_insert_index_binary_by(|e| f(e, &element));
        self.insert_element(index, element);
        index
    }
fn sorted_insert_binary_by < F : FnMut ( & T , & T ) -> Ordering > ( & mut self , element : T , mut f : F , ) -> usize { let index = self . get_sorted_insert_index_binary_by ( | e | f ( e , & element ) ) ; self . insert_element ( index , element ) ; index }
Insert elements to this sorted collection by a specific comparator and return the inserted index.
Insert elements to this sorted collection by a specific comparator and return the inserted index .
&mut self
element
T
f
F
&mut self
element
T
f
F