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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69

use std::collections::VecDeque;

use crate::SortedInsert;

#[cfg(feature = "nightly")]
use crate::SortedInsertBinary;

impl<T: Ord> SortedInsert<T> for VecDeque<T> {
    #[inline]
    fn sorted_insert_asc(&mut self, element: T) -> usize {
        match self.iter().rposition(|e| e <= &element) {
            Some(mut i) => {
                i += 1;

                self.insert(i, element);

                i
            }
            None => {
                self.insert(0, element);

                0
            }
        }
    }

    #[inline]
    fn sorted_insert_desc(&mut self, element: T) -> usize {
        match self.iter().rposition(|e| e >= &element) {
            Some(mut i) => {
                i += 1;

                self.insert(i, element);

                i
            }
            None => {
                self.insert(0, element);

                0
            }
        }
    }
}

#[cfg(feature = "nightly")]
impl<T: Ord> SortedInsertBinary<T> for VecDeque<T> {
    #[inline]
    fn sorted_insert_asc_binary(&mut self, element: T) -> usize {
        let i = match self.make_contiguous().binary_search(&element) {
            Ok(i) | Err(i) => i,
        };

        self.insert(i, element);

        i
    }

    #[inline]
    fn sorted_insert_desc_binary(&mut self, element: T) -> usize {
        let i = match self.make_contiguous().binary_search_by(|e| element.cmp(e)) {
            Ok(i) | Err(i) => i,
        };

        self.insert(i, element);

        i
    }
}