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
use std::collections::HashMap;
use std::fmt::Debug;
use serde::{de::DeserializeOwned, Deserialize, Serialize};
use serde_json::Value;
#[derive(Debug, Clone, Default, Serialize, Deserialize, PartialEq, Eq)]
pub struct StatesTree {
pub data: MaybeState,
pub cursor: Vec<String>,
pub branches: HashMap<String, Box<StatesTree>>,
}
impl StatesTree {
pub fn path(&self) -> Vec<String> {
self.cursor.clone()
}
pub fn pick(&self, name: &str) -> StatesTree {
let mut next_cursor = self.cursor.clone();
next_cursor.push(name.to_owned());
if self.branches.contains_key(name) {
let prev = &self.branches[name];
Self {
data: prev.data.clone(),
cursor: next_cursor,
branches: prev.branches.clone(),
}
} else {
Self {
data: MaybeState::new(None),
cursor: next_cursor,
branches: HashMap::new(),
}
}
}
pub fn set_in_mut(&mut self, path: &[String], new_state: MaybeState) {
if path.is_empty() {
(*self).data = new_state;
} else {
let (p_head, p_rest) = path.split_at(1);
let p0 = p_head[0].to_owned();
if let Some(branch) = self.branches.get_mut(&p0) {
branch.set_in_mut(p_rest, new_state);
} else {
let mut branch = self.pick(&p0);
branch.set_in_mut(p_rest, new_state);
self.branches.insert(p0, Box::new(branch));
}
}
}
}
#[derive(Debug, Clone, Default, PartialEq, Eq, Serialize, Deserialize)]
pub struct MaybeState(Option<Value>);
impl MaybeState {
pub fn new(state: Option<Value>) -> Self {
Self(state)
}
pub fn none() -> Self {
Self(None)
}
pub fn cast_or_default<T>(&self) -> Result<T, String>
where
T: DeserializeOwned + Default,
{
match &self.0 {
Some(v) => serde_json::from_value(v.to_owned()).map_err(|e| e.to_string()),
None => Ok(T::default()),
}
}
}