veloren_network_protocol/
util.rs1#[derive(Debug)]
3pub struct SortedVec<K, V> {
4 pub data: Vec<(K, V)>,
5}
6
7impl<K, V> Default for SortedVec<K, V> {
8 fn default() -> Self { Self { data: vec![] } }
9}
10
11impl<K, V> SortedVec<K, V>
12where
13 K: Ord + Copy,
14{
15 pub fn insert(&mut self, k: K, v: V) {
16 self.data.push((k, v));
17 self.data.sort_by_key(|&(k, _)| k);
18 }
19
20 pub fn delete(&mut self, k: &K) -> Option<V> {
21 if let Ok(i) = self.data.binary_search_by_key(k, |&(k, _)| k) {
22 Some(self.data.remove(i).1)
23 } else {
24 None
25 }
26 }
27
28 pub fn get(&self, k: &K) -> Option<&V> {
29 if let Ok(i) = self.data.binary_search_by_key(k, |&(k, _)| k) {
30 Some(&self.data[i].1)
31 } else {
32 None
33 }
34 }
35
36 pub fn get_mut(&mut self, k: &K) -> Option<&mut V> {
37 if let Ok(i) = self.data.binary_search_by_key(k, |&(k, _)| k) {
38 Some(&mut self.data[i].1)
39 } else {
40 None
41 }
42 }
43}
44
45#[cfg(test)]
46mod tests {
47 use super::*;
48
49 #[test]
50 fn sorted_vec() {
51 let mut vec = SortedVec::default();
52 vec.insert(10, "Hello");
53 println!("{:?}", vec.data);
54 vec.insert(30, "World");
55 println!("{:?}", vec.data);
56 vec.insert(20, " ");
57 println!("{:?}", vec.data);
58 assert_eq!(vec.data[0].1, "Hello");
59 assert_eq!(vec.data[1].1, " ");
60 assert_eq!(vec.data[2].1, "World");
61 assert_eq!(vec.get(&30), Some(&"World"));
62 assert_eq!(vec.get_mut(&20), Some(&mut " "));
63 assert_eq!(vec.get(&10), Some(&"Hello"));
64 assert_eq!(vec.delete(&40), None);
65 assert_eq!(vec.delete(&10), Some("Hello"));
66 assert_eq!(vec.delete(&10), None);
67 assert_eq!(vec.get(&30), Some(&"World"));
68 assert_eq!(vec.get_mut(&20), Some(&mut " "));
69 assert_eq!(vec.get(&10), None);
70 }
71}