forked from argotorg/fe
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathgraph.rs
More file actions
386 lines (343 loc) · 12.5 KB
/
Copy pathgraph.rs
File metadata and controls
386 lines (343 loc) · 12.5 KB
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
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
use std::{collections::HashMap, fmt, marker::PhantomData};
use indexmap::IndexMap;
pub use petgraph::graph::{DiGraph, NodeIndex};
pub use petgraph;
use crate::Resolver;
type BackEdges<E> = Vec<(NodeIndex, E)>;
type UnresolvedMap<D, P, E> = IndexMap<D, (P, BackEdges<E>)>;
#[derive(Debug, Clone)]
pub struct GraphNodeOutcome<P, D, E> {
/// The canonical node description to use in the resolved graph.
pub canonical_description: D,
/// Any additional descriptions that should be treated as aliases of `canonical_description`.
pub aliases: Vec<D>,
/// The forward edges for the node.
pub forward_nodes: Vec<UnresolvedNode<P, D, E>>,
}
pub trait GraphNodeResolution<P, D, E, Err> {
fn into_outcome(self, original: &D) -> Result<GraphNodeOutcome<P, D, E>, Err>;
}
impl<P, D, E, Err> GraphNodeResolution<P, D, E, Err> for Vec<UnresolvedNode<P, D, E>>
where
D: Clone,
{
fn into_outcome(self, original: &D) -> Result<GraphNodeOutcome<P, D, E>, Err> {
Ok(GraphNodeOutcome {
canonical_description: original.clone(),
aliases: Vec::new(),
forward_nodes: self,
})
}
}
impl<P, D, E, Err> GraphNodeResolution<P, D, E, Err> for GraphNodeOutcome<P, D, E> {
fn into_outcome(self, _original: &D) -> Result<GraphNodeOutcome<P, D, E>, Err> {
Ok(self)
}
}
impl<P, D, E, Err> GraphNodeResolution<P, D, E, Err> for Result<GraphNodeOutcome<P, D, E>, Err> {
fn into_outcome(self, _original: &D) -> Result<GraphNodeOutcome<P, D, E>, Err> {
self
}
}
pub trait GraphResolutionHandler<D, R> {
type Item;
fn handle_graph_resolution(&mut self, description: &D, resource: R) -> Self::Item;
}
pub trait GraphResolver<NR, H, E>: Sized
where
NR: Resolver,
H: GraphResolutionHandler<NR::Description, DiGraph<NR::Description, E>>
+ crate::ResolutionHandler<NR>,
<H as crate::ResolutionHandler<NR>>::Item:
GraphNodeResolution<Self::Priority, NR::Description, E, NR::Error>,
NR::Description: Eq + std::hash::Hash + Clone,
E: Clone,
{
type Priority: Ord + Clone + Default;
#[allow(clippy::type_complexity)]
fn graph_resolve(
&mut self,
handler: &mut H,
root_node: &NR::Description,
) -> Result<
<H as GraphResolutionHandler<NR::Description, DiGraph<NR::Description, E>>>::Item,
UnresolvableRootNode,
>;
}
impl<NR, H, E, P> GraphResolver<NR, H, E> for GraphResolverImpl<NR, H, E, P>
where
NR: Resolver,
H: GraphResolutionHandler<NR::Description, DiGraph<NR::Description, E>>
+ crate::ResolutionHandler<NR>,
<H as crate::ResolutionHandler<NR>>::Item:
GraphNodeResolution<P, NR::Description, E, NR::Error>,
NR::Description: Eq + std::hash::Hash + Clone,
E: Clone,
P: Ord + Clone + Default,
{
type Priority = P;
fn graph_resolve(
&mut self,
handler: &mut H,
root_node: &NR::Description,
) -> Result<
<H as GraphResolutionHandler<NR::Description, DiGraph<NR::Description, E>>>::Item,
UnresolvableRootNode,
> {
tracing::info!(target: "resolver", "Starting graph resolution");
let mut graph = DiGraph::default();
let mut nodes: IndexMap<NR::Description, NodeIndex> = IndexMap::new();
let mut unresolved_nodes: UnresolvedMap<NR::Description, P, E> = IndexMap::new();
let mut unresolvable_nodes: IndexMap<NR::Description, BackEdges<E>> = IndexMap::new();
let mut aliases: HashMap<NR::Description, NR::Description> = HashMap::new();
unresolved_nodes
.entry(root_node.clone())
.or_insert_with(|| (P::default(), Vec::new()));
while let Some((unresolved_node_description, priority, back_nodes)) =
take_highest_priority(&mut unresolved_nodes)
{
let canonical = canonicalize_description(&unresolved_node_description, &mut aliases);
if canonical != unresolved_node_description {
attach_back_edges(
&mut graph,
&nodes,
&mut unresolved_nodes,
&mut unresolvable_nodes,
canonical,
priority,
back_nodes,
);
continue;
}
if let Some(&resolved_node_index) = nodes.get(&canonical) {
for (back_node_index, back_edge) in back_nodes {
graph.add_edge(back_node_index, resolved_node_index, back_edge);
}
continue;
}
tracing::info!(target: "resolver", "Resolving node");
match self
.node_resolver
.resolve(handler, &unresolved_node_description)
{
Ok(item) => match item.into_outcome(&unresolved_node_description) {
Ok(outcome) => {
tracing::info!(target: "resolver", "Successfully resolved node");
let canonical_description =
canonicalize_description(&outcome.canonical_description, &mut aliases);
if canonical_description != unresolved_node_description {
aliases.insert(
unresolved_node_description.clone(),
canonical_description.clone(),
);
}
for alias in outcome.aliases {
aliases.insert(alias, canonical_description.clone());
}
let resolved_node_index =
if let Some(&existing) = nodes.get(&canonical_description) {
existing
} else {
let index = graph.add_node(canonical_description.clone());
nodes.insert(canonical_description.clone(), index);
index
};
for (back_node_index, back_edge) in back_nodes {
graph.add_edge(back_node_index, resolved_node_index, back_edge);
}
for UnresolvedNode {
priority,
description: forward_node_description,
edge: forward_edge,
} in outcome.forward_nodes
{
let forward_node_description =
canonicalize_description(&forward_node_description, &mut aliases);
attach_back_edges(
&mut graph,
&nodes,
&mut unresolved_nodes,
&mut unresolvable_nodes,
forward_node_description,
priority,
vec![(resolved_node_index, forward_edge)],
);
}
}
Err(error) => {
tracing::warn!(target: "resolver", "Node handler reported failure");
handler.on_resolution_error(&unresolved_node_description, error);
unresolvable_nodes
.entry(unresolved_node_description)
.or_default()
.extend(back_nodes);
}
},
Err(error) => {
tracing::warn!(target: "resolver", "Failed to resolve node");
handler.on_resolution_error(&unresolved_node_description, error);
unresolvable_nodes
.entry(unresolved_node_description)
.or_default()
.extend(back_nodes);
}
}
}
if graph.node_count() == 0 {
tracing::warn!(target: "resolver", "Graph resolution failed: root node is unresolvable");
Err(UnresolvableRootNode)
} else {
tracing::info!(
target: "resolver",
"Graph resolution completed successfully with {} nodes",
graph.node_count()
);
let root_node = canonicalize_description(root_node, &mut aliases);
let result = handler.handle_graph_resolution(&root_node, graph);
Ok(result)
}
}
}
impl<NR, H, E, P> Default for GraphResolverImpl<NR, H, E, P>
where
NR: Resolver + Default,
{
fn default() -> Self {
Self {
node_resolver: NR::default(),
_handler: PhantomData,
_edge: PhantomData,
_priority: PhantomData,
}
}
}
pub struct GraphResolverImpl<NR: Resolver, H, E, P> {
pub node_resolver: NR,
pub _handler: PhantomData<H>,
pub _edge: PhantomData<E>,
pub _priority: PhantomData<P>,
}
impl<NR, H, E, P> GraphResolverImpl<NR, H, E, P>
where
NR: Resolver,
{
pub fn new(node_resolver: NR) -> Self {
Self {
node_resolver,
_handler: PhantomData,
_edge: PhantomData,
_priority: PhantomData,
}
}
}
#[derive(Debug)]
pub struct UnresolvableNode<N, E>(pub N, pub E);
#[derive(Debug)]
pub struct UnresolvableRootNode;
#[derive(Debug, Clone)]
pub struct UnresolvedNode<P, D, E> {
pub priority: P,
pub description: D,
pub edge: E,
}
impl<N, E> fmt::Display for UnresolvableNode<N, E>
where
N: fmt::Display,
E: fmt::Display,
{
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
write!(f, "Unresolvable node '{}': {}", self.0, self.1)
}
}
impl<N, E> std::error::Error for UnresolvableNode<N, E>
where
N: fmt::Debug + fmt::Display,
E: fmt::Debug + fmt::Display + std::error::Error + 'static,
{
fn source(&self) -> Option<&(dyn std::error::Error + 'static)> {
Some(&self.1)
}
}
impl fmt::Display for UnresolvableRootNode {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
write!(f, "Root node is unresolvable")
}
}
impl std::error::Error for UnresolvableRootNode {}
fn take_highest_priority<D, E, P>(
unresolved_nodes: &mut UnresolvedMap<D, P, E>,
) -> Option<(D, P, BackEdges<E>)>
where
P: Ord + Clone,
{
let mut best_index = None;
let mut best_priority: Option<P> = None;
for (index, (_description, (priority, _))) in unresolved_nodes.iter().enumerate() {
let should_replace = match &best_priority {
None => true,
Some(current_best) => priority > current_best,
};
if should_replace {
best_priority = Some(priority.clone());
best_index = Some(index);
}
}
best_index.and_then(|index| {
unresolved_nodes
.shift_remove_index(index)
.map(|(description, (priority, back_nodes))| (description, priority, back_nodes))
})
}
fn canonicalize_description<D>(description: &D, aliases: &mut HashMap<D, D>) -> D
where
D: Eq + std::hash::Hash + Clone,
{
let mut current = description.clone();
let mut chain = Vec::new();
while let Some(next) = aliases.get(¤t).cloned() {
if next == current {
break;
}
chain.push(current);
current = next;
}
for link in chain {
aliases.insert(link, current.clone());
}
current
}
fn attach_back_edges<D, E, P>(
graph: &mut DiGraph<D, E>,
nodes: &IndexMap<D, NodeIndex>,
unresolved_nodes: &mut UnresolvedMap<D, P, E>,
unresolvable_nodes: &mut IndexMap<D, BackEdges<E>>,
description: D,
priority: P,
back_edges: BackEdges<E>,
) where
D: Eq + std::hash::Hash + Clone,
E: Clone,
P: Ord + Clone,
{
if let Some(&existing_index) = nodes.get(&description) {
for (back_node_index, back_edge) in back_edges {
graph.add_edge(back_node_index, existing_index, back_edge);
}
return;
}
if unresolvable_nodes.contains_key(&description) {
unresolvable_nodes
.entry(description)
.or_default()
.extend(back_edges);
return;
}
if let Some((existing_priority, existing_back_edges)) = unresolved_nodes.get_mut(&description) {
if priority > *existing_priority {
*existing_priority = priority;
}
existing_back_edges.extend(back_edges);
} else {
unresolved_nodes.insert(description, (priority, back_edges));
}
}