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 for Dual<T>
impl<T: PartialEq> PartialEq for Dual<T>
impl<T: Copy> Copy for Dual<T>
impl<T: Eq> Eq for Dual<T>
impl<T> StructuralPartialEq for Dual<T>
Auto Trait Implementations§
impl<T> DynSend for Dual<T>where
T: DynSend,
impl<T> DynSync for Dual<T>where
T: DynSync,
impl<T> Freeze for Dual<T>where
T: Freeze,
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§
§impl<T> AnyEq for T
impl<T> AnyEq for T
source§impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut T
fn allocate_from_iter<'a>( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = T> ) -> &'a mut [T]
source§impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut T
fn allocate_from_iter<'a>( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = T> ) -> &'a mut [T]
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
source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.§impl<T> Filterable for T
impl<T> Filterable for T
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<P> IntoQueryParam<P> for P
impl<P> IntoQueryParam<P> for P
fn into_query_param(self) -> P
source§impl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
§impl<T> Pointable for T
impl<T> Pointable for T
source§impl<'tcx, T> ToPredicate<'tcx, T> for T
impl<'tcx, T> ToPredicate<'tcx, T> for T
fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> T
source§impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
default fn from_cycle_error( tcx: Tcx, cycle_error: &CycleError, _guar: ErrorGuaranteed ) -> T
source§impl<T> WithSubscriber for T
impl<T> WithSubscriber for T
source§fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
source§fn with_current_subscriber(self) -> WithDispatch<Self>
fn with_current_subscriber(self) -> WithDispatch<Self>
impl<'a, T> Captures<'a> for Twhere
T: ?Sized,
impl<T> ErasedDestructor for Twhere
T: 'static,
impl<T> MaybeSendSync for 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.