Enum rustc_mir_dataflow::lattice::FlatSet
source · pub enum FlatSet<T> {
Bottom,
Elem(T),
Top,
}
Expand description
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§
Trait Implementations§
source§impl<T: PartialEq> PartialEq<FlatSet<T>> for FlatSet<T>
impl<T: PartialEq> PartialEq<FlatSet<T>> for FlatSet<T>
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>
Auto Trait Implementations§
impl<T> RefUnwindSafe for FlatSet<T>where T: RefUnwindSafe,
impl<T> Send for FlatSet<T>where T: Send,
impl<T> Sync for FlatSet<T>where T: Sync,
impl<T> Unpin for FlatSet<T>where T: Unpin,
impl<T> UnwindSafe for FlatSet<T>where T: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
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.