pub(crate) struct MaybeTransmutableQuery<L, C>where
C: QueryContext,{
src: L,
dst: L,
assume: Assume,
context: C,
}Fields§
§src: L§dst: L§assume: Assume§context: CImplementations§
Source§impl<'tcx> MaybeTransmutableQuery<Ty<'tcx>, TyCtxt<'tcx>>
impl<'tcx> MaybeTransmutableQuery<Ty<'tcx>, TyCtxt<'tcx>>
Source§impl<L, C> MaybeTransmutableQuery<L, C>where
C: QueryContext,
impl<L, C> MaybeTransmutableQuery<L, C>where
C: QueryContext,
Source§impl<C> MaybeTransmutableQuery<Tree<<C as QueryContext>::Def, <C as QueryContext>::Region, <C as QueryContext>::Type>, C>where
C: QueryContext,
impl<C> MaybeTransmutableQuery<Tree<<C as QueryContext>::Def, <C as QueryContext>::Region, <C as QueryContext>::Type>, C>where
C: QueryContext,
Sourcepub(crate) fn answer(
self,
) -> Answer<<C as QueryContext>::Region, <C as QueryContext>::Type>
pub(crate) fn answer( self, ) -> Answer<<C as QueryContext>::Region, <C as QueryContext>::Type>
Answers whether a Tree is transmutable into another Tree.
Removes definition markers from both trees and, unless safety is assumed,
prunes destination paths that may carry safety invariants. It then converts
the remaining layouts to Dfas and compares them.
Source§impl<C> MaybeTransmutableQuery<Dfa<<C as QueryContext>::Region, <C as QueryContext>::Type>, C>where
C: QueryContext,
impl<C> MaybeTransmutableQuery<Dfa<<C as QueryContext>::Region, <C as QueryContext>::Type>, C>where
C: QueryContext,
Sourcepub(crate) fn answer(
self,
) -> Answer<<C as QueryContext>::Region, <C as QueryContext>::Type>
pub(crate) fn answer( self, ) -> Answer<<C as QueryContext>::Region, <C as QueryContext>::Type>
Answers whether a Dfa is transmutable into another Dfa.
fn answer_memo( &self, cache: &mut Map<(State, State), Answer<<C as QueryContext>::Region, <C as QueryContext>::Type>>, src_state: State, dst_state: State, ) -> Answer<<C as QueryContext>::Region, <C as QueryContext>::Type>
fn answer_impl( &self, cache: &mut Map<(State, State), Answer<<C as QueryContext>::Region, <C as QueryContext>::Type>>, src_state: State, dst_state: State, ) -> Answer<<C as QueryContext>::Region, <C as QueryContext>::Type>
Auto Trait Implementations§
impl<L, C> DynSend for MaybeTransmutableQuery<L, C>
impl<L, C> DynSync for MaybeTransmutableQuery<L, C>
impl<L, C> Freeze for MaybeTransmutableQuery<L, C>
impl<L, C> RefUnwindSafe for MaybeTransmutableQuery<L, C>where
L: RefUnwindSafe,
C: RefUnwindSafe,
impl<L, C> Send for MaybeTransmutableQuery<L, C>
impl<L, C> Sync for MaybeTransmutableQuery<L, C>
impl<L, C> Unpin for MaybeTransmutableQuery<L, C>
impl<L, C> UnsafeUnpin for MaybeTransmutableQuery<L, C>where
L: UnsafeUnpin,
C: UnsafeUnpin,
impl<L, C> UnwindSafe for MaybeTransmutableQuery<L, C>where
L: UnwindSafe,
C: 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
Source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
impl<T> ErasedDestructor for Twhere
T: 'static,
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<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<K> IntoQueryKey<K> for K
impl<K> IntoQueryKey<K> for K
Source§fn into_query_key(self) -> K
fn into_query_key(self) -> K
Argument conversion from
Self to K.
This should always be a very cheap conversion, e.g. LocalDefId::to_def_id.Source§impl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
Source§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
Source§impl<I, T> UpcastFrom<I, T> for T
impl<I, T> UpcastFrom<I, T> for T
fn upcast_from(from: T, _tcx: I) -> 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> ⓘ
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.