mirui 0.21.1

A lightweight, no_std ECS-driven UI framework for embedded, desktop, and WebAssembly
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
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
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146

use super::lookup::NodeId;

pub trait Algorithm {
    type State: Default;

    fn on_access(state: &mut Self::State, node_id: NodeId);
    fn on_insert(state: &mut Self::State, node_id: NodeId);
    fn on_remove(state: &mut Self::State, node_id: NodeId);
    fn pick_victim(state: &Self::State) -> Option<NodeId>;
}

#[derive(Default)]
pub struct Lru;

#[derive(Default)]
pub struct LruState {
    list: IntrusiveList,
}

impl Algorithm for Lru {
    type State = LruState;

    fn on_access(state: &mut LruState, node_id: NodeId) {
        state.list.move_to_front(node_id);
    }

    fn on_insert(state: &mut LruState, node_id: NodeId) {
        state.list.push_front(node_id);
    }

    fn on_remove(state: &mut LruState, node_id: NodeId) {
        state.list.remove(node_id);
    }

    fn pick_victim(state: &LruState) -> Option<NodeId> {
        state.list.back()
    }
}

// `slots` indexed by NodeId; never shrunk. Caller reuses ids via the
// cache arena, so slots tracks the id high-water mark.
#[derive(Default)]
struct IntrusiveList {
    slots: alloc::vec::Vec<Option<LinkSlot>>,
    head: Option<NodeId>,
    tail: Option<NodeId>,
}

#[derive(Clone, Copy)]
struct LinkSlot {
    prev: Option<NodeId>,
    next: Option<NodeId>,
}

impl IntrusiveList {
    fn ensure_slot(&mut self, node_id: NodeId) {
        if node_id >= self.slots.len() {
            self.slots.resize(node_id + 1, None);
        }
    }

    fn push_front(&mut self, node_id: NodeId) {
        self.ensure_slot(node_id);
        let old_head = self.head;
        self.slots[node_id] = Some(LinkSlot {
            prev: None,
            next: old_head,
        });
        if let Some(h) = old_head {
            if let Some(slot) = self.slots[h].as_mut() {
                slot.prev = Some(node_id);
            }
        } else {
            self.tail = Some(node_id);
        }
        self.head = Some(node_id);
    }

    fn remove(&mut self, node_id: NodeId) {
        if node_id >= self.slots.len() {
            return;
        }
        let Some(slot) = self.slots[node_id].take() else {
            return;
        };
        match slot.prev {
            Some(p) => {
                if let Some(p_slot) = self.slots[p].as_mut() {
                    p_slot.next = slot.next;
                }
            }
            None => self.head = slot.next,
        }
        match slot.next {
            Some(n) => {
                if let Some(n_slot) = self.slots[n].as_mut() {
                    n_slot.prev = slot.prev;
                }
            }
            None => self.tail = slot.prev,
        }
    }

    fn move_to_front(&mut self, node_id: NodeId) {
        if self.head == Some(node_id) {
            return;
        }
        self.remove(node_id);
        self.push_front(node_id);
    }

    fn back(&self) -> Option<NodeId> {
        self.tail
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn lru_picks_oldest() {
        let mut s = LruState::default();
        Lru::on_insert(&mut s, 1);
        Lru::on_insert(&mut s, 2);
        Lru::on_insert(&mut s, 3);
        assert_eq!(Lru::pick_victim(&s), Some(1));

        Lru::on_access(&mut s, 1);
        assert_eq!(Lru::pick_victim(&s), Some(2));
    }

    #[test]
    fn lru_remove_middle() {
        let mut s = LruState::default();
        Lru::on_insert(&mut s, 1);
        Lru::on_insert(&mut s, 2);
        Lru::on_insert(&mut s, 3);
        Lru::on_remove(&mut s, 2);
        assert_eq!(Lru::pick_victim(&s), Some(1));
        Lru::on_remove(&mut s, 1);
        assert_eq!(Lru::pick_victim(&s), Some(3));
        Lru::on_remove(&mut s, 3);
        assert_eq!(Lru::pick_victim(&s), None);
    }
}