Struct rustc_mir_dataflow::lattice::Dual
source · pub struct Dual<T>(pub T);
Expand description
The counterpart of a given semilattice T
using the inverse order.
The dual of a join-semilattice is a meet-semilattice and vice versa. For example, the dual of a powerset has the empty set as its top element and the full set as its bottom element and uses set intersection as its join operator.
Tuple Fields§
§0: T
Trait Implementations§
source§impl<T, C> DebugWithContext<C> for Dual<T>where
T: DebugWithContext<C>,
impl<T, C> DebugWithContext<C> for Dual<T>where T: DebugWithContext<C>,
source§impl<T: Idx> GenKill<T> for Dual<BitSet<T>>
impl<T: Idx> GenKill<T> for Dual<BitSet<T>>
source§fn gen_all(&mut self, elems: impl IntoIterator<Item = T>)
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>)
fn kill_all(&mut self, elems: impl IntoIterator<Item = T>)
Calls
kill
for each element in elems
.source§impl<T: MeetSemiLattice> JoinSemiLattice for Dual<T>
impl<T: MeetSemiLattice> JoinSemiLattice for Dual<T>
source§impl<T: JoinSemiLattice> MeetSemiLattice for Dual<T>
impl<T: JoinSemiLattice> MeetSemiLattice for Dual<T>
source§impl<T: PartialEq> PartialEq<Dual<T>> for Dual<T>
impl<T: PartialEq> PartialEq<Dual<T>> for Dual<T>
impl<T: Copy> Copy for Dual<T>
impl<T: Eq> Eq for Dual<T>
impl<T> StructuralEq for Dual<T>
impl<T> StructuralPartialEq for Dual<T>
Auto Trait Implementations§
impl<T> RefUnwindSafe for Dual<T>where T: RefUnwindSafe,
impl<T> Send for Dual<T>where T: Send,
impl<T> Sync for Dual<T>where T: Sync,
impl<T> Unpin for Dual<T>where T: Unpin,
impl<T> UnwindSafe for Dual<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.