pub struct CandidateStep<'tcx> {
pub self_ty: Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Ty<'tcx>>>,
pub autoderefs: usize,
pub from_unsafe_deref: bool,
pub unsize: bool,
pub reachable_via_deref: bool,
}
Fields§
§self_ty: Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Ty<'tcx>>>
§autoderefs: usize
§from_unsafe_deref: bool
true
if the type results from a dereference of a raw pointer.
when assembling candidates, we include these steps, but not when
picking methods. This so that if we have foo: *const Foo
and Foo
has methods
fn by_raw_ptr(self: *const Self)
and fn by_ref(&self)
, then
foo.by_raw_ptr()
will work and foo.by_ref()
won’t.
unsize: bool
§reachable_via_deref: bool
We will generate CandidateSteps which are reachable via a chain
of following Receiver
. The first ‘n’ of those will be reachable
by following a chain of ‘Deref’ instead (since there’s a blanket
implementation of Receiver for Deref).
We use the entire set of steps when identifying method candidates
(e.g. identifying relevant impl
blocks) but only those that are
reachable via Deref when examining what the receiver type can
be converted into by autodereffing.
Trait Implementations§
Source§impl<'tcx> ArenaAllocatable<'tcx> for CandidateStep<'tcx>
impl<'tcx> ArenaAllocatable<'tcx> for CandidateStep<'tcx>
fn allocate_on(self, arena: &'tcx Arena<'tcx>) -> &'tcx mut CandidateStep<'tcx>
fn allocate_from_iter( arena: &'tcx Arena<'tcx>, iter: impl IntoIterator<Item = CandidateStep<'tcx>>, ) -> &'tcx mut [CandidateStep<'tcx>]
Source§impl<'tcx> Debug for CandidateStep<'tcx>
impl<'tcx> Debug for CandidateStep<'tcx>
Source§impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for CandidateStep<'tcx>
impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for CandidateStep<'tcx>
fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher<SipHasher128>, )
Auto Trait Implementations§
impl<'tcx> DynSend for CandidateStep<'tcx>
impl<'tcx> DynSync for CandidateStep<'tcx>
impl<'tcx> Freeze for CandidateStep<'tcx>
impl<'tcx> !RefUnwindSafe for CandidateStep<'tcx>
impl<'tcx> Send for CandidateStep<'tcx>
impl<'tcx> Sync for CandidateStep<'tcx>
impl<'tcx> Unpin for CandidateStep<'tcx>
impl<'tcx> !UnwindSafe for CandidateStep<'tcx>
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
Source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
Source§impl<Tcx, T> DepNodeParams<Tcx> for T
impl<Tcx, T> DepNodeParams<Tcx> for T
default fn fingerprint_style() -> FingerprintStyle
Source§default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
default fn to_debug_str(&self, _: Tcx) -> String
Source§default fn recover(_: Tcx, _: &DepNode) -> Option<T>
default fn recover(_: Tcx, _: &DepNode) -> Option<T>
DepNode
,
something which is needed when forcing DepNode
s during red-green
evaluation. The query system will only call this method if
fingerprint_style()
is not FingerprintStyle::Opaque
.
It is always valid to return None
here, in which case incremental
compilation will treat the query as having changed instead of forcing it.Source§impl<T> Filterable for T
impl<T> Filterable for T
Source§fn filterable(
self,
filter_name: &'static str,
) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
fn filterable( self, filter_name: &'static str, ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
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>
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>
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<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
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<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: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...)
attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.
Size: 104 bytes