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
use crate::DeadRelay;
use crate::Sodg;
use anyhow::{anyhow, Result};
use log::trace;
use std::collections::{HashMap, HashSet};
impl Sodg {
pub fn slice(&self, loc: &str) -> Result<Self> {
let g = self.slice_some(loc, |_, _, _| true)?;
trace!(
"#slice: taken {} vertices out of {} by '{}' locator",
g.vertices.len(),
self.vertices.len(),
loc
);
Ok(g)
}
pub fn slice_some(&self, loc: &str, p: impl Fn(u32, u32, String) -> bool) -> Result<Self> {
let mut todo = HashSet::new();
let mut done = HashSet::new();
todo.insert(self.find(0, loc, &DeadRelay::default())?);
loop {
if todo.is_empty() {
break;
}
let before: Vec<u32> = todo.drain().collect();
for v in before {
done.insert(v);
let vtx = self
.vertices
.get(&v)
.ok_or_else(|| anyhow!("Can't find ν{v}"))?;
for e in &vtx.edges {
if done.contains(&e.to) {
continue;
}
if !p(v, e.to, e.a.clone()) {
continue;
}
done.insert(e.to);
todo.insert(e.to);
}
}
}
let mut new_vertices = HashMap::new();
for (v, vtx) in self.vertices.iter().filter(|(v, _)| done.contains(v)) {
let mut nv = vtx.clone();
nv.edges.retain(|e| done.contains(&e.to));
new_vertices.insert(*v, nv);
}
let g = Self {
vertices: new_vertices,
next_v: self.next_v,
alerts: self.alerts.clone(),
alerts_active: self.alerts_active,
#[cfg(feature = "sober")]
finds: HashSet::new(),
};
trace!(
"#slice_some: taken {} vertices out of {} by '{}' locator",
g.vertices.len(),
self.vertices.len(),
loc
);
Ok(g)
}
}
#[test]
fn makes_a_slice() -> Result<()> {
let mut g = Sodg::empty();
g.add(0)?;
g.add(1)?;
g.bind(0, 1, "foo")?;
g.add(2)?;
g.bind(0, 2, "bar")?;
assert_eq!(1, g.slice("foo")?.vertices.len());
assert_eq!(1, g.slice("bar")?.vertices.len());
Ok(())
}
#[test]
fn makes_a_partial_slice() -> Result<()> {
let mut g = Sodg::empty();
g.add(0)?;
g.add(1)?;
g.bind(0, 1, "foo")?;
g.add(2)?;
g.bind(1, 2, "bar")?;
let slice = g.slice_some("foo", |_v, _to, _a| false)?;
assert_eq!(1, slice.vertices.len());
Ok(())
}
#[test]
fn skips_some_vertices() -> Result<()> {
let mut g = Sodg::empty();
g.add(0)?;
g.add(1)?;
g.bind(0, 1, "foo")?;
g.add(2)?;
g.bind(0, 2, "+bar")?;
let slice = g.slice_some("ν0", |_, _, a| !a.starts_with('+'))?;
assert_eq!(2, slice.vertices.len());
assert_eq!(1, slice.kids(0)?.len());
Ok(())
}