Enum rustc_mir_dataflow::lattice::FlatSet

pub enum FlatSet<T> {
    Bottom,
    Elem(T),
    Top,
}

Extends a type T with top and bottom elements to make it a partially ordered set in which no value of T is comparable with any other.

A flat set has the following Hasse diagram:

         top
 / ... / /  \ \ ... \
all possible values of `T`
 \ ... \ \  / / ... /
        bottom

Variants

Bottom

Elem(T)

Top

Trait Implementations

impl<T: Clone> Clone for FlatSet<T>

fn clone(&self) -> FlatSet<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for FlatSet<T>

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

Formats the value using the given formatter.

impl<T> HasBottom for FlatSet<T>

fn bottom() -> Self

impl<T> HasTop for FlatSet<T>

fn top() -> Self

impl<T: Clone + Eq> JoinSemiLattice for FlatSet<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: Clone + Eq> MeetSemiLattice for FlatSet<T>

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

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

impl<T: PartialEq> PartialEq<FlatSet<T>> for FlatSet<T>

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

This method tests for self and other values to be equal, and is used by ==.

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.

impl<T: Copy> Copy for FlatSet<T>

impl<T: Eq> Eq for FlatSet<T>

impl<T> StructuralEq for FlatSet<T>

impl<T> StructuralPartialEq for FlatSet<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.