# Enum rustc_mir_dataflow::framework::lattice::MaybeReachable

source ·

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

Expand description

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§

source§

### impl<T> MaybeReachable<T>

source

#### pub fn is_reachable(&self) -> bool

source§

### impl<S> MaybeReachable<S>

source

#### 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§

source§

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

source§

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

source§

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

source§

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

source§

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

source§

#### fn clone(&self) -> Self

Returns a copy of the value. Read more
source§

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

Performs copy-assignment from `source`. Read more
source§

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

source§

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

Formats the value using the given formatter. Read more
source§

### impl<S, C> DebugWithContext<C> for MaybeReachable<S>
where S: DebugWithContext<C>,

source§

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

source§

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

Print the difference between `self` and `old`. Read more
source§

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

source§

#### fn gen(&mut self, elem: T)

Inserts `elem` into the state vector.
source§

#### fn kill(&mut self, elem: T)

Removes `elem` from the state vector.
source§

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

Calls `gen` for each element in `elems`.
source§

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

Calls `kill` for each element in `elems`.
source§

### impl<T> HasBottom for MaybeReachable<T>

source§

#### const BOTTOM: Self = MaybeReachable::Unreachable

source§

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

source§

#### const TOP: Self = _

source§

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

source§

#### 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. Read more
source§

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

source§

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

This method tests for `self` and `other` values to be equal, and is used by `==`.
1.0.0 · source§

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

This method tests for `!=`. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

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

source§

### impl<T> StructuralEq for MaybeReachable<T>

source§

### impl<T> StructuralPartialEq for MaybeReachable<T>

## Auto Trait Implementations§

§

### impl<T> RefUnwindSafe for MaybeReachable<T>
where T: RefUnwindSafe,

§

### impl<T> Send for MaybeReachable<T>
where T: Send,

§

### impl<T> Sync for MaybeReachable<T>
where T: Sync,

§

### impl<T> Unpin for MaybeReachable<T>
where T: Unpin,

§

### impl<T> UnwindSafe for MaybeReachable<T>
where T: UnwindSafe,

## Blanket Implementations§

source§

### impl<T> Any for T
where T: 'static + ?Sized,

source§

#### fn type_id(&self) -> TypeId

Gets the `TypeId` of `self`. Read more
source§

### impl<T> Borrow<T> for T
where T: ?Sized,

source§

#### fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

### impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

#### fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

### impl<T> From<T> for T

source§

#### fn from(t: T) -> T

Returns the argument unchanged.

source§

### impl<T, U> Into<U> for T
where U: From<T>,

source§

#### fn into(self) -> U

Calls `U::from(self)`.

That is, this conversion is whatever the implementation of `From<T> for U` chooses to do.

source§

### impl<T> ToOwned for T
where T: Clone,

§

#### type Owned = T

The resulting type after obtaining ownership.
source§

#### fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

#### fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

### impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

#### type Error = Infallible

The type returned in the event of a conversion error.
source§

#### fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

### impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

#### type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

#### fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.

## 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.