sorted-insert 0.2.6

This crate provides traits to insert elements to a sorted collection and keep the order.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47

use alloc::vec::Vec;
use core::cmp::Ordering;
use std::sync::{Arc, RwLock};

use crate::{
    SortedInsertArcRwLock, SortedInsertArcRwLockBasic, SortedInsertArcRwLockBy,
    SortedInsertArcRwLockByKey, SortedInsertBinaryArcRwLock, SortedInsertBinaryArcRwLockBy,
    SortedInsertBinaryArcRwLockByKey,
};

impl<T> SortedInsertArcRwLockBasic<T> for Vec<Arc<RwLock<T>>> {
    #[inline]
    fn insert_element(&mut self, index: usize, element: Arc<RwLock<T>>) {
        self.insert(index, element);
    }
}

impl<T> SortedInsertArcRwLockBy<T> for Vec<Arc<RwLock<T>>> {
    #[inline]
    fn get_sorted_insert_index_by<F: FnMut(&Arc<RwLock<T>>) -> bool>(&self, f: F) -> usize {
        match self.iter().rposition(f) {
            Some(i) => i + 1,
            None => 0,
        }
    }
}

impl<T> SortedInsertArcRwLockByKey<T> for Vec<Arc<RwLock<T>>> {}

impl<T: Ord> SortedInsertArcRwLock<T> for Vec<Arc<RwLock<T>>> {}

impl<T> SortedInsertBinaryArcRwLockBy<T> for Vec<Arc<RwLock<T>>> {
    #[inline]
    fn get_sorted_insert_index_binary_by<F: FnMut(&Arc<RwLock<T>>) -> Ordering>(
        &mut self,
        f: F,
    ) -> usize {
        match self.binary_search_by(f) {
            Ok(i) => i + 1,
            Err(i) => i,
        }
    }
}

impl<T> SortedInsertBinaryArcRwLockByKey<T> for Vec<Arc<RwLock<T>>> {}

impl<T: Ord> SortedInsertBinaryArcRwLock<T> for Vec<Arc<RwLock<T>>> {}