astu 0.0.0

Astu library
Documentation 
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

use internment::Intern;
use petgraph::dot::Config;
use petgraph::dot::Dot;
use petgraph::prelude::DiGraphMap;
use petgraph::visit::IntoNodeReferences;

use crate::resolve::Target;

// TODO: Consider using ArenaIntern to release targets on drop
/// Directed graph of unique targets.
#[derive(Debug, Default)]
pub struct TargetGraph {
    graph: DiGraphMap<Intern<Target>, ()>,
}

impl TargetGraph {
    /// Access the inner graph.
    #[must_use]
    pub fn inner(&self) -> &DiGraphMap<Intern<Target>, ()> {
        &self.graph
    }

    /// Access the inner graph mutably.
    pub fn inner_mut(&mut self) -> &mut DiGraphMap<Intern<Target>, ()> {
        &mut self.graph
    }

    /// Add target to the graph with no relation.
    pub fn add_node(&mut self, node: Intern<Target>) {
        self.graph.add_node(node);
    }

    /// Add target relations to the graph. Nodes will be created if they don't
    /// exist yet.
    pub fn add_edge(&mut self, parent: Intern<Target>, child: Intern<Target>) {
        self.graph.add_edge(parent, child, ());
    }

    #[must_use]
    pub fn nodes(&self) -> Vec<Intern<Target>> {
        self.graph.nodes().collect()
    }

    /// Get all of the targets that are leaf nodes (ie, targets that have no
    /// further children).
    #[must_use]
    pub fn leaf_targets(&self) -> Vec<Intern<Target>> {
        self.graph
            .node_references()
            .filter(|(node, _)| {
                self.graph
                    .neighbors_directed(*node, petgraph::Direction::Outgoing)
                    .count()
                    == 0
            })
            .map(|(node, _)| node)
            .collect()
    }

    #[must_use]
    pub fn graphviz(&self) -> String {
        format!(
            "{:?}",
            Dot::with_config(&self.graph, &[Config::EdgeNoLabel])
        )
    }
}

#[cfg(test)]
mod tests {
    use std::str::FromStr;

    use super::*;

    #[test]
    fn test_leaf_nodes() {
        let mut g = TargetGraph::default();

        let parent = Target::from_str("10.0.0.0/24").unwrap().intern();
        let child1 = Target::from_str("10.0.0.1").unwrap().intern();
        let child2 = Target::from_str("10.0.0.2").unwrap().intern();

        g.add_edge(parent, child1);
        g.add_edge(parent, child2);

        let got = g.leaf_targets();
        let should = vec![child1, child2];
        assert_eq!(got, should);
    }
}