Enum MaybeReachable

pub enum MaybeReachable<T> {
    Unreachable,
    Reachable(T),
}

Extend a lattice with a bottom value to represent an unreachable execution.

The only useful action on an unreachable state is joining it with a reachable one to make it reachable. All other actions, gen/kill for instance, are no-ops.

Variants

Unreachable

Reachable(T)

Implementations

impl<T> MaybeReachable<T>

pub fn is_reachable(&self) -> bool

impl<S> MaybeReachable<S>

pub fn contains<T>(&self, elem: T) -> bool

where S: BitSetExt<T>,

Return whether the current state contains the given element. If the state is unreachable, it does no contain anything.

Trait Implementations

impl<T, S: BitSetExt<T>> BitSetExt<T> for MaybeReachable<S>

fn contains(&self, elem: T) -> bool

fn union(&mut self, other: &HybridBitSet<T>)

fn subtract(&mut self, other: &HybridBitSet<T>)

impl<V: Clone> Clone for MaybeReachable<V>

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for MaybeReachable<T>

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

Formats the value using the given formatter.

impl<S, C> DebugWithContext<C> for MaybeReachable<S>

where S: DebugWithContext<C>,

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

fn fmt_diff_with(&self, old: &Self, ctxt: &C, f: &mut Formatter<'_>) -> Result

Print the difference between self and old.

impl<T, S: GenKill<T>> GenKill<T> for MaybeReachable<S>

fn gen_(&mut self, elem: T)

Inserts elem into the state vector.

fn kill(&mut self, elem: T)

Removes elem from the state vector.

fn gen_all(&mut self, elems: impl IntoIterator<Item = T>)

Calls gen for each element in elems.

fn kill_all(&mut self, elems: impl IntoIterator<Item = T>)

Calls kill for each element in elems.

impl<T> HasBottom for MaybeReachable<T>

const BOTTOM: Self = MaybeReachable::Unreachable

fn is_bottom(&self) -> bool

impl<T: HasTop> HasTop for MaybeReachable<T>

const TOP: Self = _

impl<T: JoinSemiLattice + Clone> JoinSemiLattice for MaybeReachable<T>

fn join(&mut self, other: &Self) -> bool

Computes the least upper bound of two elements, storing the result in self and returning true if self has changed.

impl<T: PartialEq> PartialEq for MaybeReachable<T>

fn eq(&self, other: &MaybeReachable<T>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T: Eq> Eq for MaybeReachable<T>

impl<T> StructuralPartialEq for MaybeReachable<T>

Layout

Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.