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
use std::collections::HashMap;
use table::Table;
#[derive(Debug)]
pub struct MutableTable<T>(HashMap<String, T>);
impl<T> MutableTable<T> {
pub fn new() ->MutableTable<T> {
MutableTable(HashMap::new())
}
}
impl<T> Table for MutableTable<T> {
type Item = T;
fn insert(&mut self, name: &str, value: T) {
let name = String::from(name);
self.0.insert(name, value);
}
fn is_empty(&self) -> bool {
self.0.is_empty()
}
fn contains_key(&self, name: &str) -> bool {
self.0.contains_key(name)
}
fn get(&self, name: &str) -> Option<&T> {
self.0.get(name)
}
}
#[cfg(test)]
mod test {
use table::Table;
use super::*;
#[test]
fn new() {
let mutable_table: MutableTable<usize> = MutableTable::new();
assert!(mutable_table.is_empty())
}
#[test]
fn insert() {
let mut mutable_table: MutableTable<usize> = MutableTable::new();
mutable_table.insert("example", 13);
assert!(!mutable_table.is_empty());
assert_eq!(*mutable_table.get("example").unwrap(), 13);
}
#[test]
fn insert_is_mutable() {
let mut mutable_table:MutableTable<usize> = MutableTable::new();
mutable_table.insert("example", 13);
assert_eq!(*mutable_table.get("example").unwrap(), 13);
mutable_table.insert("example", 14);
assert_eq!(*mutable_table.get("example").unwrap(), 14);
}
}