sorted_insert/collections/
vec.rs

1use core::cmp::Ordering;
2
3use alloc::vec::Vec;
4
5use crate::{
6    SortedInsert, SortedInsertBasic, SortedInsertBinary, SortedInsertBinaryBy,
7    SortedInsertBinaryByKey, SortedInsertBy, SortedInsertByKey,
8};
9
10impl<T> SortedInsertBasic<T> for Vec<T> {
11    #[inline]
12    fn insert_element(&mut self, index: usize, element: T) {
13        self.insert(index, element);
14    }
15}
16
17impl<T> SortedInsertBy<T> for Vec<T> {
18    #[inline]
19    fn get_sorted_insert_index_by<F: FnMut(&T) -> bool>(&self, f: F) -> usize {
20        match self.iter().rposition(f) {
21            Some(i) => i + 1,
22            None => 0,
23        }
24    }
25}
26
27impl<T> SortedInsertByKey<T> for Vec<T> {}
28
29impl<T: Ord> SortedInsert<T> for Vec<T> {}
30
31impl<T> SortedInsertBinaryBy<T> for Vec<T> {
32    #[inline]
33    fn get_sorted_insert_index_binary_by<F: FnMut(&T) -> Ordering>(&mut self, f: F) -> usize {
34        match self.binary_search_by(f) {
35            Ok(i) => i + 1,
36            Err(i) => i,
37        }
38    }
39}
40
41impl<T> SortedInsertBinaryByKey<T> for Vec<T> {}
42
43impl<T: Ord> SortedInsertBinary<T> for Vec<T> {}