Struct rustc_trait_selection::infer::canonical::ir::EarlyBinder

source ·
pub struct EarlyBinder<I, T>
where I: Interner,
{ value: T, _tcx: PhantomData<I>, }
Expand description

Similar to super::Binder except that it tracks early bound generics, i.e. struct Foo<T>(T) needs T instantiated immediately. This type primarily exists to avoid forgetting to call instantiate.

If you don’t have anything to instantiate, you may be looking for instantiate_identity or skip_binder.

Fields§

§value: T§_tcx: PhantomData<I>

Implementations§

source§

impl<I, T> EarlyBinder<I, T>
where I: Interner,

source

pub fn bind(value: T) -> EarlyBinder<I, T>

source

pub fn as_ref(&self) -> EarlyBinder<I, &T>

source

pub fn map_bound_ref<F, U>(&self, f: F) -> EarlyBinder<I, U>
where F: FnOnce(&T) -> U,

source

pub fn map_bound<F, U>(self, f: F) -> EarlyBinder<I, U>
where F: FnOnce(T) -> U,

source

pub fn try_map_bound<F, U, E>(self, f: F) -> Result<EarlyBinder<I, U>, E>
where F: FnOnce(T) -> Result<U, E>,

source

pub fn rebind<U>(&self, value: U) -> EarlyBinder<I, U>

source

pub fn skip_binder(self) -> T

Skips the binder and returns the “bound” value. This can be used to extract data that does not depend on generic parameters (e.g., getting the DefId of the inner value or getting the number of arguments of an FnSig). Otherwise, consider using instantiate_identity.

To skip the binder on x: &EarlyBinder<I, T> to obtain &T, leverage EarlyBinder::as_ref: x.as_ref().skip_binder().

See also Binder::skip_binder, which is the analogous operation on super::Binder.

source§

impl<I, T> EarlyBinder<I, Option<T>>
where I: Interner,

source

pub fn transpose(self) -> Option<EarlyBinder<I, T>>

source§

impl<I, Iter> EarlyBinder<I, Iter>
where I: Interner, Iter: IntoIterator, <Iter as IntoIterator>::Item: TypeFoldable<I>,

source

pub fn iter_instantiated<A>( self, cx: I, args: A, ) -> IterInstantiated<I, Iter, A>
where A: SliceLike<Item = <I as Interner>::GenericArg>,

source

pub fn iter_identity(self) -> <Iter as IntoIterator>::IntoIter

Similar to instantiate_identity, but on an iterator of TypeFoldable values.

source§

impl<'s, I, Iter> EarlyBinder<I, Iter>
where I: Interner, Iter: IntoIterator, <Iter as IntoIterator>::Item: Deref, <<Iter as IntoIterator>::Item as Deref>::Target: Copy + TypeFoldable<I>,

source

pub fn iter_instantiated_copied( self, cx: I, args: &'s [<I as Interner>::GenericArg], ) -> IterInstantiatedCopied<'s, I, Iter>

source

pub fn iter_identity_copied( self, ) -> impl Iterator<Item = <<Iter as IntoIterator>::Item as Deref>::Target>

Similar to instantiate_identity, but on an iterator of values that deref to a TypeFoldable.

source§

impl<I, T> EarlyBinder<I, T>
where I: Interner, T: IntoIterator,

source§

impl<I, T> EarlyBinder<I, T>
where I: Interner, T: TypeFoldable<I>,

source

pub fn instantiate<A>(self, cx: I, args: A) -> T
where A: SliceLike<Item = <I as Interner>::GenericArg>,

source

pub fn instantiate_identity(self) -> T

Makes the identity replacement T0 => T0, ..., TN => TN. Conceptually, this converts universally bound variables into placeholders when inside of a given item.

For example, consider for<T> fn foo<T>(){ .. }:

  • Outside of foo, T is bound (represented by the presence of EarlyBinder).
  • Inside of the body of foo, we treat T as a placeholder by calling instantiate_identity to discharge the EarlyBinder.
source

pub fn no_bound_vars(self) -> Option<T>

Returns the inner value, but only if it contains no bound vars.

Trait Implementations§

source§

impl<I, T> Clone for EarlyBinder<I, T>
where I: Interner, T: Clone,

source§

fn clone(&self) -> EarlyBinder<I, T>

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, T> Debug for EarlyBinder<I, T>
where I: Interner, T: Debug,

source§

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

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

impl<I, T, __D> Decodable<__D> for EarlyBinder<I, T>
where I: Interner, __D: TyDecoder<I = I>, T: Decodable<__D>, PhantomData<I>: Decodable<__D>,

source§

fn decode(__decoder: &mut __D) -> EarlyBinder<I, T>

source§

impl<I, T, __E> Encodable<__E> for EarlyBinder<I, T>
where I: Interner, __E: TyEncoder<I = I>, T: Encodable<__E>, PhantomData<I>: Encodable<__E>,

source§

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

source§

impl<T> EraseType for EarlyBinder<TyCtxt<'_>, T>
where T: EraseType,

source§

impl<I, T> Hash for EarlyBinder<I, T>
where I: Interner, T: 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, T, __CTX> HashStable<__CTX> for EarlyBinder<I, T>
where I: Interner, T: HashStable<__CTX>, PhantomData<I>: HashStable<__CTX>,

source§

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

source§

impl<I, T> Ord for EarlyBinder<I, T>
where I: Interner, T: Ord,

source§

fn cmp(&self, __other: &EarlyBinder<I, T>) -> Ordering

This method returns an Ordering between self and other. Read more
1.21.0 · source§

fn max(self, other: Self) -> Self
where Self: Sized,

Compares and returns the maximum of two values. Read more
1.21.0 · source§

fn min(self, other: Self) -> Self
where Self: Sized,

Compares and returns the minimum of two values. Read more
1.50.0 · source§

fn clamp(self, min: Self, max: Self) -> Self
where Self: Sized + PartialOrd,

Restrict a value to a certain interval. Read more
source§

impl<T> ParameterizedOverTcx for EarlyBinder<TyCtxt<'static>, T>

source§

type Value<'tcx> = EarlyBinder<TyCtxt<'tcx>, <T as ParameterizedOverTcx>::Value<'tcx>>

source§

impl<I, T> PartialEq for EarlyBinder<I, T>
where I: Interner, T: PartialEq,

source§

fn eq(&self, __other: &EarlyBinder<I, T>) -> 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, T> PartialOrd for EarlyBinder<I, T>
where I: Interner, T: Ord,

source§

fn partial_cmp(&self, __other: &EarlyBinder<I, T>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists. Read more
1.0.0 · source§

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

Tests less than (for self and other) and is used by the < operator. Read more
1.0.0 · source§

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

Tests less than or equal to (for self and other) and is used by the <= operator. Read more
1.0.0 · source§

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

Tests greater than (for self and other) and is used by the > operator. Read more
1.0.0 · source§

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

Tests greater than or equal to (for self and other) and is used by the >= operator. Read more
source§

impl<'tcx> Value<TyCtxt<'tcx>> for EarlyBinder<TyCtxt<'_>, Binder<TyCtxt<'_>, FnSig<TyCtxt<'_>>>>

source§

fn from_cycle_error( tcx: TyCtxt<'tcx>, cycle_error: &CycleError, guar: ErrorGuaranteed, ) -> EarlyBinder<TyCtxt<'_>, Binder<TyCtxt<'_>, FnSig<TyCtxt<'_>>>>

source§

impl<'tcx> Value<TyCtxt<'tcx>> for EarlyBinder<TyCtxt<'_>, Ty<'_>>

source§

fn from_cycle_error( tcx: TyCtxt<'tcx>, cycle_error: &CycleError, guar: ErrorGuaranteed, ) -> EarlyBinder<TyCtxt<'_>, Ty<'_>>

source§

impl<I, T> Copy for EarlyBinder<I, T>
where I: Interner, T: Copy,

source§

impl<I, T> Eq for EarlyBinder<I, T>
where I: Interner, T: Eq,

source§

impl<I, T> !TypeFoldable<I> for EarlyBinder<I, T>
where I: Interner,

For early binders, you should first call instantiate before using any visitors.

source§

impl<I, T> !TypeVisitable<I> for EarlyBinder<I, T>
where I: Interner,

For early binders, you should first call instantiate before using any visitors.

Auto Trait Implementations§

§

impl<I, T> Freeze for EarlyBinder<I, T>
where T: Freeze,

§

impl<I, T> RefUnwindSafe for EarlyBinder<I, T>

§

impl<I, T> Send for EarlyBinder<I, T>
where T: Send, I: Send,

§

impl<I, T> Sync for EarlyBinder<I, T>
where T: Sync, I: Sync,

§

impl<I, T> Unpin for EarlyBinder<I, T>
where T: Unpin, I: Unpin,

§

impl<I, T> UnwindSafe for EarlyBinder<I, T>
where T: UnwindSafe, I: UnwindSafe,

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> AnyEq for T
where T: Any + PartialEq,

source§

fn equals(&self, other: &(dyn Any + 'static)) -> bool

source§

fn as_any(&self) -> &(dyn Any + 'static)

source§

impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for T
where T: Copy,

source§

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

source§

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

source§

impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for T
where T: Copy,

source§

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

source§

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

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> Comparable<K> for Q
where Q: Ord + ?Sized, K: Borrow<Q> + ?Sized,

source§

fn compare(&self, key: &K) -> Ordering

Compare self to key and return their ordering.
source§

impl<Tcx, T> DepNodeParams<Tcx> for T
where Tcx: DepContext, T: for<'a> HashStable<StableHashingContext<'a>> + Debug,

source§

default fn fingerprint_style() -> FingerprintStyle

source§

default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint

This method turns the parameters of a DepNodeConstructor into an opaque Fingerprint to be used in DepNode. Not all DepNodeParams support being turned into a Fingerprint (they don’t need to if the corresponding DepNode is anonymous).
source§

default fn to_debug_str(&self, _: Tcx) -> String

source§

default fn recover(_: Tcx, _: &DepNode) -> Option<T>

This method tries to recover the query key from the given DepNode, something which is needed when forcing DepNodes 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<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> Filterable for T

source§

fn filterable( self, filter_name: &'static str, ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>

Creates a filterable data provider with the given name for debugging. Read more
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<P> IntoQueryParam<P> for P

source§

impl<T> MaybeResult<T> for T

source§

type Error = !

source§

fn from(_: Result<T, <T as MaybeResult<T>>::Error>) -> T

source§

fn to_result(self) -> Result<T, <T as MaybeResult<T>>::Error>

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, 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, 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<V, T> VZip<V> for T
where V: MultiLane<T>,

source§

fn vzip(self) -> V

source§

impl<Tcx, T> Value<Tcx> for T
where Tcx: DepContext,

source§

default fn from_cycle_error( tcx: Tcx, cycle_error: &CycleError, _guar: ErrorGuaranteed, ) -> 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,

source§

impl<T> ErasedDestructor for T
where T: 'static,

source§

impl<T> MaybeSendSync for T

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.