rustc_infer::traits::query

Type Alias CanonicalDropckOutlivesGoal

Source
pub type CanonicalDropckOutlivesGoal<'tcx> = CanonicalQueryInput<TyCtxt<'tcx>, ParamEnvAnd<'tcx, DropckOutlives<'tcx>>>;

Aliased Type§

struct CanonicalDropckOutlivesGoal<'tcx> {
    pub canonical: Canonical<TyCtxt<'tcx>, ParamEnvAnd<'tcx, DropckOutlives<'tcx>>>,
    pub typing_mode: TypingMode<TyCtxt<'tcx>>,
}

Fields§

§canonical: Canonical<TyCtxt<'tcx>, ParamEnvAnd<'tcx, DropckOutlives<'tcx>>>§typing_mode: TypingMode<TyCtxt<'tcx>>

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: 48 bytes

Trait Implementations

Source§

impl<I, V> Clone for CanonicalQueryInput<I, V>
where I: Interner, V: Clone,

Source§

fn clone(&self) -> CanonicalQueryInput<I, V>

Returns a copy of the value. Read more
1.0.0 · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl<I, V> Debug for CanonicalQueryInput<I, V>
where I: Interner, V: Debug,

Source§

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

Formats the value using the given formatter. Read more
Source§

impl<I, V, __D> Decodable<__D> for CanonicalQueryInput<I, V>
where I: Interner, __D: TyDecoder<I = I>, Canonical<I, V>: Decodable<__D>, TypingMode<I>: Decodable<__D>,

Source§

impl<I, V, __E> Encodable<__E> for CanonicalQueryInput<I, V>
where I: Interner, __E: TyEncoder<I = I>, Canonical<I, V>: Encodable<__E>, TypingMode<I>: Encodable<__E>,

Source§

fn encode(&self, __encoder: &mut __E)

Source§

impl<I, V> Hash for CanonicalQueryInput<I, V>
where I: Interner, V: Hash,

Source§

fn hash<__H>(&self, __state: &mut __H)
where __H: Hasher,

Feeds this value into the given Hasher. Read more
1.3.0 · Source§

fn hash_slice<H>(data: &[Self], state: &mut H)
where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher. Read more
Source§

impl<I, V, __CTX> HashStable<__CTX> for CanonicalQueryInput<I, V>
where I: Interner, Canonical<I, V>: HashStable<__CTX>, TypingMode<I>: HashStable<__CTX>,

Source§

fn hash_stable( &self, __hcx: &mut __CTX, __hasher: &mut StableHasher<SipHasher128>, )

Source§

impl<'tcx, T> Key for CanonicalQueryInput<TyCtxt<'tcx>, T>
where T: Clone,

Canonical query goals correspond to abstract trait operations that are not tied to any crate in particular.

Source§

type Cache<V> = DefaultCache<CanonicalQueryInput<TyCtxt<'tcx>, T>, V>

Source§

fn default_span(&self, _tcx: TyCtxt<'_>) -> Span

In the event that a cycle occurs, if no explicit span has been given for a query with key self, what span should we use?
Source§

fn key_as_def_id(&self) -> Option<DefId>

If the key is a DefId or DefId–equivalent, return that DefId. Otherwise, return None.
Source§

fn def_id_for_ty_in_cycle(&self) -> Option<DefId>

Used to detect when ADT def ids are used as keys in a cycle for better error reporting.
Source§

impl<I, V> PartialEq for CanonicalQueryInput<I, V>
where I: Interner, V: PartialEq,

Source§

fn eq(&self, __other: &CanonicalQueryInput<I, V>) -> bool

Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
Source§

impl<I, V> Copy for CanonicalQueryInput<I, V>
where I: Interner, V: Copy,

Source§

impl<I, V> Eq for CanonicalQueryInput<I, V>
where I: Interner, V: Eq,