Struct Graph 

pub struct Graph {
    pub nodes: Vec<Node>,
    pub default_image: Option<String>,
}

Fields

nodes: Vec<Node>

default_image: Option<String>

Implementations

impl Graph

pub fn build(pipeline: &Pipeline) -> Result<Self>

Build a synchronisation graph from a planner-emitted Pipeline.

Errors

Returns an error if a step’s builds_in or depends_on references an unknown step key, or if the resulting graph is cyclic. Each cycle error names both ends of the back edge so the user can grep their pipeline for the offending pair.

pub fn is_chain_step(&self, i: usize) -> bool

True iff i is the unique builds_in child of its parent and has no other depends_on edges. A chain step can run via docker exec in the parent’s running container.

pub fn chain_deps(&self, chains: &[Vec<usize>]) -> Vec<Vec<usize>>

For each chain in chains, return the set of OTHER chain indices it depends on. A chain depends on another chain iff any node in it has a depends_on edge into a node belonging to that other chain. The result is deterministic (ascending chain index).

Caller must pass the same partition chains() returned — chain_index[node] is derived from chains.

pub fn chains(&self) -> Vec<Vec<usize>>

Partition nodes into chain units. Each returned vec is a chain [root, step_1, step_2, …] where root is not a chain step and every subsequent index is a chain step descending from the previous one via builds_in. Every node appears in exactly one chain. The order of chains is deterministic (root index, ascending).

Trait Implementations

impl Clone for Graph

fn clone(&self) -> Graph

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Graph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.