Enum DataflowLaw 

pub enum DataflowLaw {
    JoinIdempotent,
    JoinCommutative,
    JoinAssociative,
    Bottom,
    PartialOrderConsistent,
    TransferDeterministic,
    TransferMonotone,
    TransferProgress,
}

A law whose failure makes a lattice or transfer policy inadmissible.

Variants

JoinIdempotent

a join a = a.

JoinCommutative

a join b = b join a.

JoinAssociative

(a join b) join c = a join (b join c).

Bottom

Bottom is below every state and is the identity of join.

PartialOrderConsistent

The declared order agrees with join and is reflexive and antisymmetric.

TransferDeterministic

Repeated evaluation at one input produces the same result.

TransferMonotone

Transfer preserves ordering between comparable inputs.

TransferProgress

Transfer never retracts facts from its input.

Trait Implementations

impl Clone for DataflowLaw

fn clone(&self) -> DataflowLaw

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for DataflowLaw

impl Debug for DataflowLaw

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

Formats the value using the given formatter.

impl Eq for DataflowLaw

impl PartialEq for DataflowLaw

fn eq(&self, other: &DataflowLaw) -> bool

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for DataflowLaw