Struct BspGraph 

pub struct BspGraph<S = ()> { /* private fields */ }

The blueprint definition containing nodes, edges, and initial inputs.

S is the consumer-owned run state the graph’s nodes operate on; it defaults to () for pure dataflow graphs.

Implementations

impl<S> BspGraph<S>

pub fn from_def( def: &GraphDef, registry: &NodeRegistry<S>, ctx: &BspContext, ) -> Result<Self, BspError>

where S: Send + Sync + 'static,

Instantiates a graph from a serializable definition and a consumer registry.

Registration is fail-fast: any unknown node type_name, condition name, custom label, or merger name produces a BspError::ValidationError listing all unknown names — never a mid-run surprise. Node and edge ids are mapped from the definition’s stable strings onto positional NodeIds, with the strings retained as labels so BspGraph::to_def round-trips losslessly.

pub fn to_def(&self) -> GraphDef

Projects this graph into a serializable definition.

Def-built graphs re-emit their retained NodeDefs exactly, so def -> graph -> def is a fixed point. Programmatically built graphs synthesize node definitions from the live nodes (stable label ids, type_names, current activation / recovery / merger / execution caps, null configs).

impl<S> BspGraph<S>

pub fn new() -> Self

Instantiates a new empty BSP execution graph.

pub fn add_node<N: BspNode<S> + 'static>( &mut self, node: N, ) -> TypedNodeHandle<N>

Registers a node with a self-assigned auto-incrementing identifier.

pub fn add_node_with_id( &mut self, id: impl Into<NodeId>, node: Box<dyn BspNode<S>>, )

Registers a node within the graph’s designated manual identifier namespace.

pub fn add_link(&mut self, source: OutputPin, target: InputPin)

Connects an output pin of a source node to an input pin of a target node.

This is the dataflow profile’s wiring primitive: an edge with Condition::Always carrying both ports.

pub fn add_link_indices( &mut self, source_node: NodeId, source_port: PortIndex, target_node: NodeId, target_port: PortIndex, )

Back-compatible helper targeting index indices.

pub fn add_edge( &mut self, source: impl Into<NodeId>, target: impl Into<NodeId>, ) -> EdgeBuilder<'_, S>

Adds a control-flow edge between two nodes, returning a builder for the condition and iteration budget. The default condition is Condition::Always.

pub fn add_edge_with( &mut self, source: impl Into<NodeId>, target: impl Into<NodeId>, condition: Condition<S>, ) -> EdgeId

Adds a control-flow edge with an explicit condition in one call.

pub fn set_static_input<T: Any + Send + Sync>( &mut self, target: InputPin, value: T, )

Injects an initial static parameter into a specific node’s input pin.

pub fn register_condition( &mut self, name: impl Into<String>, f: impl Fn(&S, &ValueStore) -> bool + Send + Sync + 'static, )

Registers a named condition predicate (the serializable routing mechanism).

pub fn register_merger<M: Merger<S> + 'static>( &mut self, name: impl Into<String>, merger: M, )

Registers a named merger used by join nodes to fold branch states.

pub fn add_entry(&mut self, id: impl Into<NodeId>)

Marks a node as an explicit entry (in addition to no-incoming-edge sources).

pub fn node_label(&self, id: NodeId) -> Option<&str>

The stable string label for a node (its crate::def::NodeDef id).

pub fn node_ids(&self) -> impl Iterator<Item = NodeId> + '_

The nodes of this graph, in declaration order.

pub fn edges(&self) -> &[Edge<S>]

The edges of this graph, in declaration order.

pub fn with_node_id( self, id: impl Into<NodeId>, node: Box<dyn BspNode<S>>, ) -> Self

pub fn with_link(self, source: OutputPin, target: InputPin) -> Self

pub fn with_static_input<T: Any + Send + Sync>( self, target: InputPin, value: T, ) -> Self

pub fn with_condition( self, name: impl Into<String>, f: impl Fn(&S, &ValueStore) -> bool + Send + Sync + 'static, ) -> Self

pub fn with_merger<M: Merger<S> + 'static>( self, name: impl Into<String>, merger: M, ) -> Self

Trait Implementations

impl<S> Default for BspGraph<S>

fn default() -> Self

Returns the “default value” for a type.