appcui 0.4.18

A feature-rich and cross-platform TUI/CUI framework for Rust, enabling modern terminal-based applications on Windows, Linux, and macOS. Includes built-in UI components like buttons, menus, list views, tree views, checkboxes, and more. Perfect for building fast and interactive CLI tools and text-based interfaces.
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

struct StackVec<T: Copy, const N: usize> {
    buffer: [T; N],
    len: u16,
}
enum InnerTempVec<T: Copy, const N: usize> {
    StackVec(StackVec<T, N>),
    HeapVec(Vec<T>),
}
pub(crate) struct TempVec<T: Copy, const N: usize> {
    inner: InnerTempVec<T, N>,
}
impl<T: Copy + Default, const N: usize> TempVec<T, N> {
    pub(crate) fn new() -> Self {
        if N == 0 {
            panic!("N must be greater than 0");
        }
        if N > 65534 {
            panic!("N must be less than 65535");
        }
        Self { inner: InnerTempVec::StackVec(StackVec { buffer: [T::default(); N], len: 0 }) }
    }
}
impl<T: Copy, const N: usize> TempVec<T, N> {
    pub(crate) fn push(&mut self, value: T) {
        match &mut self.inner {
            InnerTempVec::StackVec(vec) => {
                if (vec.len as usize) < N {
                    vec.buffer[vec.len as usize] = value;
                    vec.len += 1;
                } else {
                    let mut heap_vec = Vec::with_capacity(N);
                    heap_vec.extend_from_slice(&vec.buffer[..vec.len as usize]);
                    heap_vec.push(value);
                    self.inner = InnerTempVec::HeapVec(heap_vec);
                }
            }
            InnerTempVec::HeapVec(vec) => {
                vec.push(value);
            }
        }
    }
    #[inline(always)]
    #[cfg(test)]
    pub(crate) fn clear(&mut self) {
        match &mut self.inner {
            InnerTempVec::StackVec(vec) => {
                vec.len = 0;
            }
            InnerTempVec::HeapVec(vec) => {
                vec.clear();
            }
        }
    }
    #[inline(always)]
    pub(crate) fn as_slice(&self) -> &[T] {
        match &self.inner {
            InnerTempVec::StackVec(vec) => &vec.buffer[..vec.len as usize],
            InnerTempVec::HeapVec(vec) => vec.as_slice(),
        }
    }
    #[inline(always)]
    #[cfg(test)]
    pub(crate) fn get(&self, index: usize) -> Option<&T> {
        match &self.inner {
            InnerTempVec::StackVec(vec) => {
                if index < (vec.len as usize) {
                    Some(&vec.buffer[index])
                } else {
                    None
                }
            }
            InnerTempVec::HeapVec(vec) => {
                vec.get(index)
            }
        }
    }
    #[inline(always)]
    #[cfg(test)]
    pub(crate) fn get_mut(&mut self, index: usize) -> Option<&mut T> {
        match &mut self.inner {
            InnerTempVec::StackVec(vec) => {
                if index < (vec.len as usize) {
                    Some(&mut vec.buffer[index])
                } else {
                    None
                }
            }
            InnerTempVec::HeapVec(vec) => {
                vec.get_mut(index)
            }
        }
    }
    #[inline(always)]
    #[cfg(test)]
    pub(crate) fn is_on_heap(&self) -> bool {
        matches!(&self.inner, InnerTempVec::HeapVec(_))
    }
    #[inline(always)]
    pub(crate) fn is_empty(&self) -> bool {
        match &self.inner {
            InnerTempVec::StackVec(vec) => vec.len == 0,
            InnerTempVec::HeapVec(vec) => vec.is_empty(),
        }
    }
    #[inline(always)]
    pub(crate) fn len(&self) -> usize {
        match &self.inner {
            InnerTempVec::StackVec(vec) => vec.len as usize,
            InnerTempVec::HeapVec(vec) => vec.len(),
        }
    }
}