sorted_insert/collections/
vec.rs

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