dpcs 0.13.0

Reference implementation of the Data Pipeline Contract Standard (DPCS)
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

//! Integration tests for graph analysis APIs.

use dpcs::{parse_yaml_file, DependencyGraph, PipelineContract};

fn fixture(path: &str) -> std::path::PathBuf {
    std::path::PathBuf::from(env!("CARGO_MANIFEST_DIR"))
        .join("tests/fixtures")
        .join(path)
}

fn load(path: &str) -> PipelineContract {
    parse_yaml_file(fixture(path)).unwrap()
}

#[test]
fn dependency_graph_traversal_on_dag() {
    let contract = load("valid/with_graph_features.dpcs.yaml");
    let graph = DependencyGraph::from_contract(&contract);

    assert_eq!(
        graph.walk_bfs("ingest"),
        vec!["ingest", "transform", "publish"]
    );
    assert_eq!(
        graph.predecessors("transform"),
        ["ingest"].into_iter().collect()
    );
    assert_eq!(
        graph.successors("transform"),
        ["publish"].into_iter().collect()
    );
    assert!(graph.dependencies("publish").contains("ingest"));
    assert!(graph.dependents("ingest").contains("publish"));
}

#[test]
fn topological_order_matches_graph_edges() {
    let contract = load("valid/with_graph_features.dpcs.yaml");
    let graph = DependencyGraph::from_contract(&contract);
    assert_eq!(
        graph.topological_order().unwrap(),
        vec!["ingest", "transform", "publish"]
    );
}

#[test]
fn cycle_fixture_produces_cycle_error() {
    let contract = load("invalid/cycle.dpcs.yaml");
    let graph = DependencyGraph::from_contract(&contract);
    assert!(graph.has_cycle());
    assert!(graph.topological_order().is_err());
}

#[test]
fn graph_features_round_trip() {
    let original = load("valid/with_graph_features.dpcs.yaml");
    assert_eq!(original.graph.entry_points, vec!["ingest"]);
    assert_eq!(original.graph.exit_points, vec!["publish"]);
    assert!(original.graph.metadata.is_some());
    assert!(original
        .data_flow
        .iter()
        .any(|flow| flow.contract_ref.as_deref() == Some("raw_contract")));

    let yaml = original.to_yaml_str().unwrap();
    let round_tripped = PipelineContract::from_yaml_str(&yaml).unwrap();
    assert_eq!(original, round_tripped);
}

#[test]
fn topo_order_is_stable_when_yaml_keys_reordered() {
    let yaml_a = r#"
dpcsVersion: "1.0.0"
id: "order.test"
version: "0.1.0"
interface:
  inputs: []
  outputs: []
graph:
  edges:
    - from: "a"
      to: "c"
    - from: "b"
      to: "c"
steps:
  - id: "a"
    type: "dtcs:transform"
  - id: "b"
    type: "dtcs:transform"
  - id: "c"
    type: "dtcs:transform"
"#;
    let yaml_b = r#"
steps:
  - id: "c"
    type: "dtcs:transform"
  - id: "b"
    type: "dtcs:transform"
  - id: "a"
    type: "dtcs:transform"
graph:
  edges:
    - from: "b"
      to: "c"
    - from: "a"
      to: "c"
dpcsVersion: "1.0.0"
id: "order.test"
version: "0.1.0"
interface:
  inputs: []
  outputs: []
"#;

    let graph_a = DependencyGraph::from_contract(&dpcs::parse_yaml(yaml_a).unwrap());
    let graph_b = DependencyGraph::from_contract(&dpcs::parse_yaml(yaml_b).unwrap());
    assert_eq!(
        graph_a.topological_order().unwrap(),
        graph_b.topological_order().unwrap()
    );
}