Struct SemiLattice 

pub struct SemiLattice<T>(pub T);

The ‘lattice’ Resource Algebra.

Tuple Fields

0: T

Trait Implementations

impl<T: SemiLattice> RA for SemiLattice<T>

fn op(self, other: Self) -> Option<Self>

logic(open, inline)

Some(Self(self.0.join(other.0)))

fn incl(self, other: Self) -> bool

logic(open, inline)

self.0 <= other.0

ensures

result == (exists<factor> self.op(factor) == Some(other))

fn commutative(a: Self, b: Self)

logic(law)

ensures

a.op(b) == b.op(a)

fn associative(a: Self, b: Self, c: Self)

logic

ensures

a.op(b).and_then_logic(|ab: Self| ab.op(c)) == b.op(c).and_then_logic(|bc| a.op(bc))

fn core(self) -> Option<Self>

logic(open, inline)

Some(self)

fn core_idemp(self)

logic

requires

self.core() != None

ensures

let c = self.core().unwrap_logic();
c.op(c) == Some(c)

ensures

self.core().unwrap_logic().op(self) == Some(self)

fn core_is_maximal_idemp(self, i: Self)

logic

requires

i.op(i) == Some(i)

requires

i.op(self) == Some(self)

ensures

match self.core() {
    Some(c) => i.incl(c),
    None => false,
}

fn eq(self, other: Self) -> bool

logic(open, inline)

fn incl_op(self, other: Self, comb: Self)

logic(law)

fn incl_eq(self, other: Self) -> bool

logic(open, sealed)

fn incl_eq_op(a: Self, b: Self, x: Self) -> bool

logic(open, sealed)

fn factor(self, factor: Self) -> Self

Factorizing elements of the RA

fn update(self, x: Self) -> bool

Ensures that we can go from self to x without making composition with the frame invalid.

fn update_nondet(self, s: Set<Self>) -> bool

This is used in Resource::update_nondet.

fn associative_none(a: Self, b: Self, c: Self, bc: Self)

Specialized version of Self::associative, in the case where a.op(b) == None.

fn associative_some(a: Self, b: Self, c: Self, ab: Self, bc: Self)

Specialized version of Self::associative, in the case where a.op(b) and b.op(c) are both valid.

fn incl_transitive(a: Self, b: Self, c: Self)

RA::incl is transitive.

fn cancelable(self) -> bool

Cancelation of resource algebra elements.