Struct CandidateStep

pub struct CandidateStep<'tcx> {
    pub self_ty: Canonical<'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<'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

impl<'tcx> ArenaAllocatable<'tcx> for CandidateStep<'tcx>

fn allocate_on(self, arena: &'tcx Arena<'tcx>) -> &'tcx mut Self

fn allocate_from_iter( arena: &'tcx Arena<'tcx>, iter: impl IntoIterator<Item = Self>, ) -> &'tcx mut [Self]

impl<'tcx> Debug for CandidateStep<'tcx>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for CandidateStep<'tcx>

fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher, )

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