governor-core 1.3.0

Core domain and application logic for cargo-governor
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

//! Tests for dependency module

use governor_core::domain::dependency::{DependencyGraph, WorkspaceDependency};

#[test]
fn test_dependency_graph_creation() {
    let graph = DependencyGraph::new();
    assert_eq!(graph.all_crates().len(), 0);
}

#[test]
fn test_add_dependency() {
    let mut graph = DependencyGraph::new();
    graph.add(WorkspaceDependency::new(
        "crate-a".to_string(),
        "crate-b".to_string(),
        "workspace".to_string(),
    ));

    let deps = graph.dependencies_for("crate-a");
    assert_eq!(deps.len(), 1);
}

#[test]
fn test_no_cycles() {
    let mut graph = DependencyGraph::new();
    graph.add(WorkspaceDependency::new(
        "crate-a".to_string(),
        "crate-b".to_string(),
        "workspace".to_string(),
    ));
    graph.add(WorkspaceDependency::new(
        "crate-b".to_string(),
        "crate-c".to_string(),
        "workspace".to_string(),
    ));

    assert!(!graph.has_cycles());
}

#[test]
fn test_cycle_detection() {
    let mut graph = DependencyGraph::new();
    graph.add(WorkspaceDependency::new(
        "crate-a".to_string(),
        "crate-b".to_string(),
        "workspace".to_string(),
    ));
    graph.add(WorkspaceDependency::new(
        "crate-b".to_string(),
        "crate-c".to_string(),
        "workspace".to_string(),
    ));
    graph.add(WorkspaceDependency::new(
        "crate-c".to_string(),
        "crate-a".to_string(),
        "workspace".to_string(),
    ));

    assert!(graph.has_cycles());
}

#[test]
fn test_publish_order() {
    let mut graph = DependencyGraph::new();
    graph.add(WorkspaceDependency::new(
        "crate-c".to_string(),
        "crate-b".to_string(),
        "workspace".to_string(),
    ));
    graph.add(WorkspaceDependency::new(
        "crate-b".to_string(),
        "crate-a".to_string(),
        "workspace".to_string(),
    ));

    let order = graph.publish_order().unwrap();
    assert_eq!(order, vec!["crate-a", "crate-b", "crate-c"]);
}

#[test]
fn test_workspace_dependency_fields() {
    let dep = WorkspaceDependency::new(
        "my-crate".to_string(),
        "dep-crate".to_string(),
        "workspace".to_string(),
    );
    assert_eq!(dep.from, "my-crate");
    assert_eq!(dep.to, "dep-crate");
}

#[test]
fn test_all_crates() {
    let mut graph = DependencyGraph::new();
    graph.add(WorkspaceDependency::new(
        "crate-a".to_string(),
        "crate-b".to_string(),
        "workspace".to_string(),
    ));
    graph.add(WorkspaceDependency::new(
        "crate-b".to_string(),
        "crate-c".to_string(),
        "workspace".to_string(),
    ));

    let crates = graph.all_crates();
    assert!(crates.contains("crate-a"));
    assert!(crates.contains("crate-b"));
    assert!(crates.contains("crate-c"));
}

#[test]
fn test_dependencies_count() {
    let mut graph = DependencyGraph::new();
    graph.add(WorkspaceDependency::new(
        "crate-a".to_string(),
        "crate-b".to_string(),
        "workspace".to_string(),
    ));
    graph.add(WorkspaceDependency::new(
        "crate-a".to_string(),
        "crate-c".to_string(),
        "workspace".to_string(),
    ));

    let deps = graph.dependencies_for("crate-a");
    assert_eq!(deps.len(), 2);
}

#[test]
fn test_empty_graph() {
    let graph = DependencyGraph::new();
    assert!(!graph.has_cycles());
    let order = graph.publish_order();
    assert!(order.is_ok() || order.is_err());
}