bijux-dag-core 0.4.1

Deterministic DAG kernel for graph parsing, validation, canonicalization, planning, and identity.
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

use crate::meta::{DagId, DagVersionId, SnapshotMetadata};
use crate::node::NodeGroupContract;
use crate::resources::GraphDefaults;
use crate::Graph;
use serde::{Deserialize, Serialize};
use std::collections::BTreeMap;

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct GraphExecutionPolicy {
    pub fail_fast: bool,
    pub deterministic_dispatch: bool,
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct GraphContract {
    pub dag_id: DagId,
    pub dag_version_id: DagVersionId,
    pub graph: Graph,
    pub namespace: Option<String>,
    pub owners: Vec<String>,
    pub labels: BTreeMap<String, String>,
    pub annotations: BTreeMap<String, String>,
    pub environment_tags: Vec<String>,
    pub defaults: GraphDefaults,
    pub execution_policy: GraphExecutionPolicy,
    pub node_groups: Vec<NodeGroupContract>,
}

impl GraphContract {
    pub fn normalize_with_defaults(&self) -> Graph {
        normalize_graph_with_defaults(&self.graph, &self.defaults)
    }
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct DagSnapshot {
    pub metadata: SnapshotMetadata,
    pub graph: Graph,
}

pub fn normalize_graph_with_defaults(graph: &Graph, defaults: &GraphDefaults) -> Graph {
    let mut graph = graph.clone();
    for node in &mut graph.nodes {
        if node.retry.max_attempts == 0 {
            if let Some(default_retry) = defaults.retry.as_ref() {
                node.retry = default_retry.clone();
            }
        }
        if node.resources.is_none() {
            node.resources = defaults.resources.clone();
        }
    }
    graph
}