Struct DataflowGraph 

pub struct DataflowGraph<N, E, L, C> { /* private fields */ }

Immutable, canonically ordered, content-identified dataflow structure.

The generic parameters represent graph identities, locations, and edge classes only. Adapters may project machine code, syntax trees, or other located artifacts into these neutral values without storing their source types in the graph.

Implementations

impl<N, E, L, C> DataflowGraph<N, E, L, C>

where N: Clone + Hash + Ord, E: Clone + Hash + Ord, L: Hash + Ord, C: Hash + Ord,

pub fn build( nodes: impl IntoIterator<Item = NodeSpec<N, L>>, edges: impl IntoIterator<Item = EdgeSpec<E, N, C>>, ) -> Result<Self, GraphBuildError<N, E>>

Validates and freezes graph declarations in canonical identity order.

pub fn node(&self, id: &N) -> Option<&Node<N, L>>

Returns a node by stable identity.

pub fn edge(&self, id: &E) -> Option<&Edge<E, N, C>>

Returns an edge by stable identity.

pub fn nodes(&self) -> impl ExactSizeIterator<Item = &Node<N, L>>

Iterates nodes in stable identity order.

pub fn edges(&self) -> impl ExactSizeIterator<Item = &Edge<E, N, C>>

Iterates edges in stable identity order.

pub fn predecessors(&self, node: &N) -> Option<&[E]>

Returns incoming edge identities in stable order.

pub fn successors(&self, node: &N) -> Option<&[E]>

Returns outgoing edge identities in stable order.

pub fn fingerprint(&self) -> ValueFingerprint

Returns the canonical content fingerprint.

Trait Implementations

impl<N: Clone, E: Clone, L: Clone, C: Clone> Clone for DataflowGraph<N, E, L, C>

fn clone(&self) -> DataflowGraph<N, E, L, C>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<N: Debug, E: Debug, L: Debug, C: Debug> Debug for DataflowGraph<N, E, L, C>

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

Formats the value using the given formatter.

impl<N: Eq, E: Eq, L: Eq, C: Eq> Eq for DataflowGraph<N, E, L, C>

impl<N: PartialEq, E: PartialEq, L: PartialEq, C: PartialEq> PartialEq for DataflowGraph<N, E, L, C>

fn eq(&self, other: &DataflowGraph<N, E, L, C>) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl<N: PartialEq, E: PartialEq, L: PartialEq, C: PartialEq> StructuralPartialEq for DataflowGraph<N, E, L, C>