rsplug-dag 0.2.3

Directed acyclic graph (DAG) data structure 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
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

use dag::*;
use std::collections::{HashMap, HashSet};

struct Node {
    id: &'static str,
    depends: &'static [&'static str],
}

impl DagNode for Node {
    fn id(&self) -> &str {
        self.id
    }
    fn depends(&self) -> impl IntoIterator<Item = &impl AsRef<str>> {
        self.depends
    }
}

#[test]
fn unknown_dependency_detection() {
    let nodes = vec![Node {
        id: "A",
        depends: &["B"],
    }];

    let res = nodes.try_dag();
    assert! { matches!(res, Err(DagError::UnknownDependency { .. })) };
}

#[test]
fn duplicate_node_detection() {
    let nodes = vec![
        Node {
            id: "A",
            depends: &[],
        },
        Node {
            id: "A",
            depends: &[],
        },
    ];

    let res = nodes.try_dag();
    assert! { matches!(res, Err(DagError::DuplicateName(_))) };
}

#[test]
fn cycle_detection() {
    let nodes = vec![
        Node {
            id: "A",
            depends: &["B"],
        },
        Node {
            id: "B",
            depends: &["A"],
        },
    ];

    let res = nodes.try_dag();
    assert! { matches!(res, Err(DagError::CycleDetected(_))) };
}

#[test]
fn successful_resolution() {
    let nodes = vec![
        Node {
            id: "A",
            depends: &["B", "C"],
        },
        Node {
            id: "B",
            depends: &["C"],
        },
        Node {
            id: "C",
            depends: &[],
        },
    ];

    let res = nodes.try_dag().unwrap();

    let mut resolved_nodes = res.into_iter();
    assert_eq!(resolved_nodes.next().unwrap().id, "C");
    assert_eq!(resolved_nodes.next().unwrap().id, "B");
    assert_eq!(resolved_nodes.next().unwrap().id, "A");
}

#[test]
fn get_direct_dependents() {
    let nodes = vec![
        Node {
            id: "A",
            depends: &["B"],
        },
        Node {
            id: "B",
            depends: &["C"],
        },
        Node {
            id: "C",
            depends: &[],
        },
    ];
    let res = nodes.try_dag().unwrap();
    let direct_dependents_map: HashMap<_, _> = res
        .into_map_iter(|mut d| {
            (
                d.inner.id().to_string(),
                d.dependents_iter
                    .next()
                    .unwrap_or_default()
                    .into_iter()
                    .map(|a| a.id().to_string())
                    .collect::<HashSet<_>>(),
            )
        })
        .collect();

    let dependents = direct_dependents_map.get("A").unwrap();
    assert!(dependents.is_empty());

    let dependents = direct_dependents_map.get("B").unwrap();
    assert_eq!(dependents.len(), 1);
    dependents.contains("A");

    let dependents = direct_dependents_map.get("C").unwrap();
    assert_eq!(dependents.len(), 1);
    dependents.contains("B");
}

#[test]
fn get_recursive_dependents() {
    let nodes = vec![
        Node {
            id: "A",
            depends: &["B"],
        },
        Node {
            id: "B",
            depends: &["C"],
        },
        Node {
            id: "C",
            depends: &[],
        },
    ];
    let res = nodes.try_dag().unwrap();
    let recursive_dependents_map: HashMap<_, _> = res
        .into_map_iter(|d| {
            (
                d.inner.id().to_string(),
                d.dependents_iter
                    .flatten()
                    .map(|a| a.id().to_string())
                    .collect::<HashSet<_>>(),
            )
        })
        .collect();

    let dependents = recursive_dependents_map.get("A").unwrap();
    assert!(dependents.is_empty());

    let dependents = recursive_dependents_map.get("B").unwrap();
    assert_eq!(dependents.len(), 1);
    dependents.contains("A");

    let dependents = recursive_dependents_map.get("C").unwrap();
    assert_eq!(dependents.len(), 2);
    dependents.contains("A");
    dependents.contains("B");
}