keebrs 0.3.0

Keyboard firmware building blocks
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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99

#![allow(dead_code)]

use core::borrow::{
    Borrow,
    BorrowMut,
};

use alloc::vec::Vec;

// Simple linear map
//
// Lookups, insertions, and removals are all O(n).
// Mainly optimized for code size since BTreeMap is
// rather large.
#[derive(Debug, Clone)]
pub struct VecMap<K, V>(Vec<Option<(K, V)>>);

impl<K, V> Default for VecMap<K, V>
where
    K: Eq,
{
    fn default() -> Self {
        Self::new()
    }
}

impl<K, V> VecMap<K, V>
where
    K: Eq,
{
    pub fn new() -> Self {
        VecMap(Default::default())
    }

    pub fn get<T>(&self, key: &T) -> Option<&V>
    where
        K: Borrow<T>,
        T: Eq,
    {
        self.0
            .iter()
            .filter_map(|cell| {
                if let Some((cellkey, value)) = cell {
                    if key == cellkey.borrow() {
                        return Some(value);
                    }
                }
                None
            })
            .next()
    }
    pub fn get_mut<T>(&mut self, key: &T) -> Option<&mut V>
    where
        K: BorrowMut<T>,
        T: Eq,
    {
        self.0
            .iter_mut()
            .filter_map(|cell| {
                if let Some((cellkey, value)) = cell {
                    if key == cellkey.borrow_mut() {
                        return Some(value);
                    }
                }
                None
            })
            .next()
    }

    pub fn take<T>(&mut self, key: &T) -> Option<V>
    where
        K: Borrow<T>,
        T: Eq,
    {
        self.0
            .iter_mut()
            .find(|cell| {
                if let Some((cellkey, _)) = cell {
                    key == cellkey.borrow()
                } else {
                    false
                }
            })
            .and_then(|cell| cell.take())
            .map(|(_, value)| value)
    }

    pub fn insert(&mut self, key: K, value: V) {
        if let Some(cell) = self.0.iter_mut().find(|cell| cell.is_none()) {
            cell.replace((key, value));
        } else {
            self.0.push(Some((key, value)))
        }
    }

    pub fn inner(&self) -> &Vec<Option<(K, V)>> {
        &self.0
    }
}