Struct DataflowCompletionProof 

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

An immutable witness that a precise set of dataflow inputs reached a fixpoint.

The witness is deliberately content based: clean and incremental evaluation of the same inputs mint the same identity. Execution history and visit counts remain diagnostics and cannot change what the proof says.

Implementations

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

pub const fn identity(&self) -> ValueFingerprint

Returns the canonical semantic identity of this completed fixpoint.

pub fn observations(&self) -> &[(N, E, N)]

Returns the exact dependency edges observed while reaching the fixpoint.

pub fn node_fingerprints(&self) -> &BTreeMap<N, ValueFingerprint>

Returns the converged node fingerprints used for incremental cutoff.

pub const fn solution(&self) -> &DataflowSolution<N, E, C, S>

Returns the proven solution.

Trait Implementations

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

fn clone(&self) -> DataflowCompletionProof<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 DataflowCompletionProof<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 DataflowCompletionProof<N, E, C, S>

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

fn eq(&self, other: &DataflowCompletionProof<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 DataflowCompletionProof<N, E, C, S>