rustc_type_ir

Struct NormalizesTo

Source
pub struct NormalizesTo<I: Interner> {
    pub alias: AliasTerm<I>,
    pub term: I::Term,
}
Expand description

Used by the new solver to normalize an alias. This always expects the term to be an unconstrained inference variable which is used as the output.

Fields§

§alias: AliasTerm<I>§term: I::Term

Implementations§

Source§

impl<I: Interner> NormalizesTo<I>

Source

pub fn self_ty(self) -> I::Ty

Source

pub fn with_self_ty(self, interner: I, self_ty: I::Ty) -> NormalizesTo<I>

Source

pub fn trait_def_id(self, interner: I) -> I::DefId

Source

pub fn def_id(self) -> I::DefId

Trait Implementations§

Source§

impl<I> Clone for NormalizesTo<I>
where I: Interner,

Source§

fn clone(&self) -> Self

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: Interner> Debug for NormalizesTo<I>

Source§

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

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

impl<I: Interner, __D: TyDecoder<I = I>> Decodable<__D> for NormalizesTo<I>
where AliasTerm<I>: Decodable<__D>, I::Term: Decodable<__D>,

Source§

fn decode(__decoder: &mut __D) -> Self

Source§

impl<I: Interner> Display for NormalizesTo<I>

Source§

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

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

impl<I: Interner, __E: TyEncoder<I = I>> Encodable<__E> for NormalizesTo<I>
where AliasTerm<I>: Encodable<__E>, I::Term: Encodable<__E>,

Source§

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

Source§

impl<I> Hash for NormalizesTo<I>
where I: Interner,

Source§

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

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: Interner, __CTX> HashStable<__CTX> for NormalizesTo<I>
where AliasTerm<I>: HashStable<__CTX>, I::Term: HashStable<__CTX>,

Source§

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

Source§

impl<I, J> Lift<J> for NormalizesTo<I>
where I: Interner, J: Interner, AliasTerm<I>: Lift<J, Lifted = AliasTerm<J>>, I::Term: Lift<J, Lifted = J::Term>,

Source§

type Lifted = NormalizesTo<J>

Source§

fn lift_to_interner(self, interner: J) -> Option<Self::Lifted>

Source§

impl<I> PartialEq for NormalizesTo<I>
where I: Interner,

Source§

fn eq(&self, __other: &Self) -> 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> TypeFoldable<I> for NormalizesTo<I>
where I: Interner, AliasTerm<I>: TypeFoldable<I>, I::Term: TypeFoldable<I>,

Source§

fn try_fold_with<__F: FallibleTypeFolder<I>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f). Read more
Source§

fn fold_with<F: TypeFolder<I>>(self, folder: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.
Source§

impl<I> TypeVisitable<I> for NormalizesTo<I>

Source§

fn visit_with<__V: TypeVisitor<I>>(&self, __visitor: &mut __V) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v). Read more
Source§

impl<I> Copy for NormalizesTo<I>
where I: Interner,

Source§

impl<I> Eq for NormalizesTo<I>
where I: Interner,

Auto Trait Implementations§

§

impl<I> DynSend for NormalizesTo<I>
where <I as Interner>::Term: DynSend, <I as Interner>::GenericArgs: DynSend, <I as Interner>::DefId: DynSend,

§

impl<I> DynSync for NormalizesTo<I>
where <I as Interner>::Term: DynSync, <I as Interner>::GenericArgs: DynSync, <I as Interner>::DefId: DynSync,

§

impl<I> Freeze for NormalizesTo<I>
where <I as Interner>::Term: Freeze, <I as Interner>::GenericArgs: Freeze, <I as Interner>::DefId: Freeze,

§

impl<I> RefUnwindSafe for NormalizesTo<I>

§

impl<I> Send for NormalizesTo<I>
where <I as Interner>::Term: Send, <I as Interner>::GenericArgs: Send, <I as Interner>::DefId: Send,

§

impl<I> Sync for NormalizesTo<I>
where <I as Interner>::Term: Sync, <I as Interner>::GenericArgs: Sync, <I as Interner>::DefId: Sync,

§

impl<I> Unpin for NormalizesTo<I>
where <I as Interner>::Term: Unpin, <I as Interner>::GenericArgs: Unpin, <I as Interner>::DefId: Unpin,

§

impl<I> UnwindSafe for NormalizesTo<I>

Blanket Implementations§

Source§

impl<T> Aligned for T

Source§

const ALIGN: Alignment = _

Alignment of Self.
Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dst: *mut T)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dst. Read more
Source§

impl<T, R> CollectAndApply<T, R> for T

Source§

fn collect_and_apply<I, F>(iter: I, f: F) -> R
where I: Iterator<Item = T>, F: FnOnce(&[T]) -> R,

Equivalent to f(&iter.collect::<Vec<_>>()).

Source§

type Output = R

Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T> Instrument for T

Source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
Source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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 more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize = _

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T> ToString for T
where T: Display + ?Sized,

Source§

default fn to_string(&self) -> String

Converts the given value to a String. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<I, T> TypeVisitableExt<I> for T
where I: Interner, T: TypeVisitable<I>,

Source§

fn has_type_flags(&self, flags: TypeFlags) -> bool

Source§

fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool

Returns true if self has any late-bound regions that are either bound by binder or bound by some binder outside of binder. If binder is ty::INNERMOST, this indicates whether there are any late-bound regions that appear free.
Source§

fn error_reported(&self) -> Result<(), <I as Interner>::ErrorGuaranteed>

Source§

fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool

Returns true if this type has any regions that escape binder (and hence are not bound by it).
Source§

fn has_escaping_bound_vars(&self) -> bool

Return true if this type has regions that are not a part of the type. For example, for<'a> fn(&'a i32) return false, while fn(&'a i32) would return true. The latter can occur when traversing through the former. Read more
Source§

fn has_aliases(&self) -> bool

Source§

fn has_opaque_types(&self) -> bool

Source§

fn has_coroutines(&self) -> bool

Source§

fn references_error(&self) -> bool

Source§

fn has_non_region_param(&self) -> bool

Source§

fn has_infer_regions(&self) -> bool

Source§

fn has_infer_types(&self) -> bool

Source§

fn has_non_region_infer(&self) -> bool

Source§

fn has_infer(&self) -> bool

Source§

fn has_placeholders(&self) -> bool

Source§

fn has_non_region_placeholders(&self) -> bool

Source§

fn has_param(&self) -> bool

Source§

fn has_free_regions(&self) -> bool

“Free” regions in this context means that it has any region that is not (a) erased or (b) late-bound.
Source§

fn has_erased_regions(&self) -> bool

Source§

fn has_erasable_regions(&self) -> bool

True if there are any un-erased free regions.
Source§

fn is_global(&self) -> bool

Indicates whether this value references only ‘global’ generic parameters that are the same regardless of what fn we are in. This is used for caching.
Source§

fn has_bound_regions(&self) -> bool

True if there are any late-bound regions
Source§

fn has_non_region_bound_vars(&self) -> bool

True if there are any late-bound non-region variables
Source§

fn has_bound_vars(&self) -> bool

True if there are any bound variables
Source§

fn still_further_specializable(&self) -> bool

Indicates whether this value still has parameters/placeholders/inference variables which could be replaced later, in a way that would change the results of impl specialization.
Source§

impl<I, T, U> Upcast<I, U> for T
where U: UpcastFrom<I, T>,

Source§

fn upcast(self, interner: I) -> U

Source§

impl<I, T> UpcastFrom<I, T> for T

Source§

fn upcast_from(from: T, _tcx: I) -> T

Source§

impl<T> WithSubscriber for T

Source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

impl<'a, T> Captures<'a> for T
where T: ?Sized,

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.