ito-domain 0.1.33

Domain models and repositories for Ito
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

//! Tests for cycle detection in task/wave dependencies.

use super::find_cycle_path;

#[test]
fn find_cycle_path_detects_simple_two_node_cycle() {
    let edges = vec![
        ("a".to_string(), "b".to_string()),
        ("b".to_string(), "a".to_string()),
    ];
    let cycle = find_cycle_path(&edges);
    assert!(cycle.is_some());
    let path = cycle.unwrap();
    assert!(path.contains("a"));
    assert!(path.contains("b"));
    assert!(path.contains(" -> "));
}

#[test]
fn find_cycle_path_detects_three_node_cycle() {
    let edges = vec![
        ("a".to_string(), "b".to_string()),
        ("b".to_string(), "c".to_string()),
        ("c".to_string(), "a".to_string()),
    ];
    let cycle = find_cycle_path(&edges);
    assert!(cycle.is_some());
    let path = cycle.unwrap();
    assert!(path.contains("a"));
    assert!(path.contains("b"));
    assert!(path.contains("c"));
}

#[test]
fn find_cycle_path_detects_self_loop() {
    let edges = vec![("a".to_string(), "a".to_string())];
    let cycle = find_cycle_path(&edges);
    assert!(cycle.is_some());
    let path = cycle.unwrap();
    assert!(path.contains("a"));
}

#[test]
fn find_cycle_path_returns_none_for_acyclic_graph() {
    let edges = vec![
        ("a".to_string(), "b".to_string()),
        ("b".to_string(), "c".to_string()),
        ("c".to_string(), "d".to_string()),
    ];
    let cycle = find_cycle_path(&edges);
    assert!(cycle.is_none());
}

#[test]
fn find_cycle_path_returns_none_for_empty_graph() {
    let edges: Vec<(String, String)> = vec![];
    let cycle = find_cycle_path(&edges);
    assert!(cycle.is_none());
}

#[test]
fn find_cycle_path_detects_cycle_in_complex_graph() {
    // Graph with both cyclic and acyclic components
    let edges = vec![
        ("a".to_string(), "b".to_string()),
        ("b".to_string(), "c".to_string()),
        ("c".to_string(), "d".to_string()),
        ("d".to_string(), "e".to_string()),
        ("e".to_string(), "c".to_string()), // Cycle: c -> d -> e -> c
        ("f".to_string(), "g".to_string()),
    ];
    let cycle = find_cycle_path(&edges);
    assert!(cycle.is_some());
    let path = cycle.unwrap();
    // The cycle should involve c, d, e
    assert!(path.contains("c"));
    assert!(path.contains("d"));
    assert!(path.contains("e"));
}

#[test]
fn find_cycle_path_handles_multiple_cycles_returns_one() {
    // Two separate cycles
    let edges = vec![
        ("a".to_string(), "b".to_string()),
        ("b".to_string(), "a".to_string()), // Cycle 1: a <-> b
        ("c".to_string(), "d".to_string()),
        ("d".to_string(), "c".to_string()), // Cycle 2: c <-> d
    ];
    let cycle = find_cycle_path(&edges);
    // Should find at least one cycle
    assert!(cycle.is_some());
}

#[test]
fn find_cycle_path_handles_diamond_pattern_without_cycle() {
    // Diamond: a -> b, a -> c, b -> d, c -> d (no cycle)
    let edges = vec![
        ("a".to_string(), "b".to_string()),
        ("a".to_string(), "c".to_string()),
        ("b".to_string(), "d".to_string()),
        ("c".to_string(), "d".to_string()),
    ];
    let cycle = find_cycle_path(&edges);
    assert!(cycle.is_none());
}

#[test]
fn find_cycle_path_handles_long_cycle() {
    // Long cycle: 1 -> 2 -> 3 -> 4 -> 5 -> 1
    let edges = vec![
        ("1".to_string(), "2".to_string()),
        ("2".to_string(), "3".to_string()),
        ("3".to_string(), "4".to_string()),
        ("4".to_string(), "5".to_string()),
        ("5".to_string(), "1".to_string()),
    ];
    let cycle = find_cycle_path(&edges);
    assert!(cycle.is_some());
    let path = cycle.unwrap();
    assert!(path.contains("1"));
    assert!(path.contains("5"));
}

#[test]
fn find_cycle_path_with_numeric_node_names() {
    // Simulating wave dependencies
    let edges = vec![
        ("1".to_string(), "2".to_string()),
        ("2".to_string(), "3".to_string()),
        ("3".to_string(), "1".to_string()),
    ];
    let cycle = find_cycle_path(&edges);
    assert!(cycle.is_some());
}

#[test]
fn find_cycle_path_handles_special_characters_in_node_names() {
    let edges = vec![
        ("task-1.1".to_string(), "task-1.2".to_string()),
        ("task-1.2".to_string(), "task-1.1".to_string()),
    ];
    let cycle = find_cycle_path(&edges);
    assert!(cycle.is_some());
    let path = cycle.unwrap();
    assert!(path.contains("task-1.1"));
    assert!(path.contains("task-1.2"));
}