gpp-solver 0.2.1

A small hybrid push-pull solver/planner that has the best of both worlds
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

use crate::{
    reexported::{test, Set},
    test::{PetgraphProblem, CONCURRENCY},
    FragmentId, Solver, Status,
};
use petgraph::{graph::NodeIndex, Graph};

#[test]
async fn should_be_able_to_punt_a_self_cycle() {
    let mut dependency_graph = Graph::new();
    let p0 = dependency_graph.add_node(());
    dependency_graph.add_edge(p0, p0, ());

    let solver = Solver::new(PetgraphProblem::new(dependency_graph));
    solver.enqueue_fragment(p0.index().into()).await;
    let punted = solver
        .run(CONCURRENCY)
        .await
        .unwrap()
        .into_iter()
        .collect::<Set<_>>();

    assert_eq!(solver.status().await, Status::DoneWithCycles);
    assert_eq!(punted, index_slice_as_set(&[p0]));
    assert_eq!(solver.into_problem_instance().into_evaluated(), &[]);
}

#[test]
async fn should_be_able_to_punt_a_two_node_cycle() {
    let mut dependency_graph = Graph::new();
    let p0 = dependency_graph.add_node(());
    let p1 = dependency_graph.add_node(());
    dependency_graph.add_edge(p0, p1, ());
    dependency_graph.add_edge(p1, p0, ());

    let solver = Solver::new(PetgraphProblem::new(dependency_graph));
    solver.enqueue_fragment(p0.index().into()).await;
    solver.enqueue_fragment(p1.index().into()).await;
    let punted = solver
        .run(CONCURRENCY)
        .await
        .unwrap()
        .into_iter()
        .collect::<Set<_>>();

    assert_eq!(solver.status().await, Status::DoneWithCycles);
    assert_eq!(punted, index_slice_as_set(&[p0, p1]));
    assert_eq!(solver.into_problem_instance().into_evaluated(), &[]);
}

#[test]
async fn should_be_able_to_punt_a_self_cycle_within_a_two_node_cycle() {
    let mut dependency_graph = Graph::new();
    let p0 = dependency_graph.add_node(());
    let p1 = dependency_graph.add_node(());
    dependency_graph.add_edge(p0, p1, ());
    dependency_graph.add_edge(p1, p0, ());
    dependency_graph.add_edge(p0, p0, ());

    let solver = Solver::new(PetgraphProblem::new(dependency_graph));
    solver.enqueue_fragment(p0.index().into()).await;
    solver.enqueue_fragment(p1.index().into()).await;
    let punted = solver
        .run(CONCURRENCY)
        .await
        .unwrap()
        .into_iter()
        .collect::<Set<_>>();

    assert_eq!(solver.status().await, Status::DoneWithCycles);
    assert_eq!(punted, index_slice_as_set(&[p0, p1]));
    assert_eq!(solver.into_problem_instance().into_evaluated(), &[]);
}

#[test]
async fn should_be_able_to_punt_a_two_intersecting_cycles() {
    let mut dependency_graph = Graph::new();
    let p0 = dependency_graph.add_node(());
    let p1 = dependency_graph.add_node(());
    let p2 = dependency_graph.add_node(());
    dependency_graph.add_edge(p0, p1, ());
    dependency_graph.add_edge(p1, p0, ());
    dependency_graph.add_edge(p1, p2, ());
    dependency_graph.add_edge(p2, p1, ());

    let solver = Solver::new(PetgraphProblem::new(dependency_graph));
    solver.enqueue_fragment(p0.index().into()).await;
    let punted = solver
        .run(CONCURRENCY)
        .await
        .unwrap()
        .into_iter()
        .collect::<Set<_>>();

    assert_eq!(solver.status().await, Status::DoneWithCycles);
    assert_eq!(punted, index_slice_as_set(&[p0, p1, p2]));
    assert_eq!(solver.into_problem_instance().into_evaluated(), &[]);
}

fn index_slice_as_set(indexes: &[NodeIndex<u32>]) -> Set<FragmentId> {
    indexes.iter().map(|x| x.index().into()).collect()
}