oxihuman-core 0.1.2

Core data structures, algorithms, and asset management for OxiHuman
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

// Copyright (C) 2026 COOLJAPAN OU (Team KitaSan) / SPDX-License-Identifier: Apache-2.0
#![allow(dead_code)]

/// A read-only lookup table built from a sorted list of key-value pairs.
#[allow(dead_code)]
#[derive(Debug, Clone)]
pub struct ConstTable<V: Clone> {
    entries: Vec<(String, V)>,
}

#[allow(dead_code)]
impl<V: Clone> ConstTable<V> {
    pub fn from_pairs(mut pairs: Vec<(String, V)>) -> Self {
        pairs.sort_by(|a, b| a.0.cmp(&b.0));
        Self { entries: pairs }
    }

    pub fn get(&self, key: &str) -> Option<&V> {
        self.entries
            .binary_search_by(|e| e.0.as_str().cmp(key))
            .ok()
            .map(|i| &self.entries[i].1)
    }

    pub fn contains_key(&self, key: &str) -> bool {
        self.entries
            .binary_search_by(|e| e.0.as_str().cmp(key))
            .is_ok()
    }

    pub fn len(&self) -> usize {
        self.entries.len()
    }

    pub fn is_empty(&self) -> bool {
        self.entries.is_empty()
    }

    pub fn keys(&self) -> Vec<&str> {
        self.entries.iter().map(|e| e.0.as_str()).collect()
    }

    pub fn values(&self) -> Vec<&V> {
        self.entries.iter().map(|e| &e.1).collect()
    }

    pub fn iter(&self) -> impl Iterator<Item = (&str, &V)> {
        self.entries.iter().map(|(k, v)| (k.as_str(), v))
    }

    pub fn get_index(&self, index: usize) -> Option<(&str, &V)> {
        self.entries.get(index).map(|(k, v)| (k.as_str(), v))
    }

    pub fn first(&self) -> Option<(&str, &V)> {
        self.entries.first().map(|(k, v)| (k.as_str(), v))
    }

    pub fn last(&self) -> Option<(&str, &V)> {
        self.entries.last().map(|(k, v)| (k.as_str(), v))
    }
}

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

    fn sample_table() -> ConstTable<i32> {
        ConstTable::from_pairs(vec![
            ("cherry".to_string(), 3),
            ("apple".to_string(), 1),
            ("banana".to_string(), 2),
        ])
    }

    #[test]
    fn test_get_existing() {
        let t = sample_table();
        assert_eq!(t.get("banana"), Some(&2));
    }

    #[test]
    fn test_get_missing() {
        let t = sample_table();
        assert!(t.get("date").is_none());
    }

    #[test]
    fn test_contains_key() {
        let t = sample_table();
        assert!(t.contains_key("apple"));
        assert!(!t.contains_key("mango"));
    }

    #[test]
    fn test_len() {
        let t = sample_table();
        assert_eq!(t.len(), 3);
    }

    #[test]
    fn test_empty() {
        let t: ConstTable<i32> = ConstTable::from_pairs(vec![]);
        assert!(t.is_empty());
    }

    #[test]
    fn test_keys_sorted() {
        let t = sample_table();
        let keys = t.keys();
        assert_eq!(keys, vec!["apple", "banana", "cherry"]);
    }

    #[test]
    fn test_values() {
        let t = sample_table();
        let vals = t.values();
        assert_eq!(vals, vec![&1, &2, &3]);
    }

    #[test]
    fn test_first_last() {
        let t = sample_table();
        assert_eq!(t.first().expect("should succeed").0, "apple");
        assert_eq!(t.last().expect("should succeed").0, "cherry");
    }

    #[test]
    fn test_get_index() {
        let t = sample_table();
        let (k, v) = t.get_index(1).expect("should succeed");
        assert_eq!(k, "banana");
        assert_eq!(*v, 2);
    }

    #[test]
    fn test_iter() {
        let t = sample_table();
        let collected: Vec<_> = t.iter().collect();
        assert_eq!(collected.len(), 3);
    }
}