Struct DataflowSolution 

pub struct DataflowSolution<N, E, C, S> { /* private fields */ }

A converged, fully accounted dataflow solution.

Implementations

impl<N: Ord, E, C, S> DataflowSolution<N, E, C, S>

pub fn state(&self, node: &N) -> Option<&S>

Returns the converged state for a node.

pub fn states(&self) -> impl ExactSizeIterator<Item = (&N, &S)>

Iterates converged states in stable node order.

pub fn events(&self) -> &[DataflowEvent<N, E, C>]

Returns the deterministic visit and propagation sequence.

pub const fn usage(&self) -> DataflowUsage

Returns exact resource consumption.

pub fn explain( &self, node: &N, limit: usize, ) -> Option<DataflowExplanation<N, E>>

where N: Clone, E: Clone,

Explains a node with at most limit causal predecessors.

Trait Implementations

impl<N: Clone, E: Clone, C: Clone, S: Clone> Clone for DataflowSolution<N, E, C, S>

fn clone(&self) -> DataflowSolution<N, E, C, S>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<N: Debug, E: Debug, C: Debug, S: Debug> Debug for DataflowSolution<N, E, C, S>

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

Formats the value using the given formatter.

impl<N: Eq, E: Eq, C: Eq, S: Eq> Eq for DataflowSolution<N, E, C, S>

impl<N: PartialEq, E: PartialEq, C: PartialEq, S: PartialEq> PartialEq for DataflowSolution<N, E, C, S>

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

Equality operator ==.

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

Inequality operator !=.

impl<N: PartialEq, E: PartialEq, C: PartialEq, S: PartialEq> StructuralPartialEq for DataflowSolution<N, E, C, S>