Struct Graph 

pub struct Graph { /* private fields */ }

Directed Acryllic Graph representing the flow of execution in that pipeline. Only operates on index and edge information - doesn’t store actual state.

See Registry for where state comes in.

Implementations

impl Graph

pub fn generate_trace(&self, registry: &Registry) -> GraphTrace

Generates a trace of the graph.

impl Graph

pub fn new() -> Self

pub fn from_node_ids(node_ids: &[NodeReflection]) -> Self

Takes a slice of node indicies and adds them to an unconnected graph. These are the indices returned by Registry::register

pub fn add_node(&mut self, id: impl Into<NodeReflection>) -> NodeIndex

Adds a new node to the graph, by its Registry index.

pub fn connect( &mut self, from_id: impl Into<NodeReflection>, to_id: impl Into<NodeReflection>, source_output: Option<&'static str>, target_input: Option<&'static str>, ) -> Result<(), EdgeCreationError>

Connects the output of a node to the input of another node, resulting in a new graph edge. See Registry

pub fn execute<'reg, S: Stage>( &self, registry: &'reg mut Registry, node_id: NodeId<S>, ) -> Result<&'reg mut S::Output, ErrorWithTrace<NodeExecutionError>>

Execute the graph in its current state, performing the entire flow of operations. This will find any non-lazy nodes and execute each of them, recursively executing all dependencies first in order to satisfy their input requirements.

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.