Struct rustc_middle::ty::subst::EarlyBinder
source · pub struct EarlyBinder<T>(pub T);Expand description
Similar to super::Binder except that it tracks early bound generics, i.e. struct Foo<T>(T)
needs T substituted immediately. This type primarily exists to avoid forgetting to call
subst.
If you don’t have anything to subst, you may be looking for
subst_identity or skip_binder.
Tuple Fields§
§0: TImplementations§
source§impl<T> EarlyBinder<T>
impl<T> EarlyBinder<T>
pub fn as_ref(&self) -> EarlyBinder<&T>
pub fn map_bound_ref<F, U>(&self, f: F) -> EarlyBinder<U>where
F: FnOnce(&T) -> U,
pub fn map_bound<F, U>(self, f: F) -> EarlyBinder<U>where
F: FnOnce(T) -> U,
pub fn try_map_bound<F, U, E>(self, f: F) -> Result<EarlyBinder<U>, E>where
F: FnOnce(T) -> Result<U, E>,
pub fn rebind<U>(&self, value: U) -> EarlyBinder<U>
sourcepub fn skip_binder(self) -> T
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
subst_identity.
See also Binder::skip_binder, which is
the analogous operation on super::Binder.
source§impl<T> EarlyBinder<Option<T>>
impl<T> EarlyBinder<Option<T>>
pub fn transpose(self) -> Option<EarlyBinder<T>>
source§impl<T, U> EarlyBinder<(T, U)>
impl<T, U> EarlyBinder<(T, U)>
pub fn transpose_tuple2(self) -> (EarlyBinder<T>, EarlyBinder<U>)
source§impl<'tcx, 's, I: IntoIterator> EarlyBinder<I>where
I::Item: TypeFoldable<'tcx>,
impl<'tcx, 's, I: IntoIterator> EarlyBinder<I>where
I::Item: TypeFoldable<'tcx>,
pub fn subst_iter(
self,
tcx: TyCtxt<'tcx>,
substs: &'s [GenericArg<'tcx>]
) -> SubstIter<'s, 'tcx, I> ⓘ
source§impl<'tcx, 's, I: IntoIterator> EarlyBinder<I>where
I::Item: Deref,
<<I as IntoIterator>::Item as Deref>::Target: Copy + TypeFoldable<'tcx>,
impl<'tcx, 's, I: IntoIterator> EarlyBinder<I>where
I::Item: Deref,
<<I as IntoIterator>::Item as Deref>::Target: Copy + TypeFoldable<'tcx>,
pub fn subst_iter_copied(
self,
tcx: TyCtxt<'tcx>,
substs: &'s [GenericArg<'tcx>]
) -> SubstIterCopied<'s, 'tcx, I> ⓘ
source§impl<T: IntoIterator> EarlyBinder<T>
impl<T: IntoIterator> EarlyBinder<T>
pub fn transpose_iter(self) -> EarlyBinderIter<T::IntoIter> ⓘ
source§impl<'tcx, T: TypeFoldable<'tcx>> EarlyBinder<T>
impl<'tcx, T: TypeFoldable<'tcx>> EarlyBinder<T>
pub fn subst(self, tcx: TyCtxt<'tcx>, substs: &[GenericArg<'tcx>]) -> T
sourcepub fn subst_identity(self) -> T
pub fn subst_identity(self) -> T
Makes the identity substitution 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,Tis bound (represented by the presence ofEarlyBinder). - Inside of the body of
foo, we treatTas a placeholder by callingsubst_identityto discharge theEarlyBinder.
Trait Implementations§
source§impl<T: Clone> Clone for EarlyBinder<T>
impl<T: Clone> Clone for EarlyBinder<T>
source§fn clone(&self) -> EarlyBinder<T>
fn clone(&self) -> EarlyBinder<T>
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moresource§impl<T: Debug> Debug for EarlyBinder<T>
impl<T: Debug> Debug for EarlyBinder<T>
source§impl<T: Hash> Hash for EarlyBinder<T>
impl<T: Hash> Hash for EarlyBinder<T>
source§impl<'__ctx, T> HashStable<StableHashingContext<'__ctx>> for EarlyBinder<T>where
T: HashStable<StableHashingContext<'__ctx>>,
impl<'__ctx, T> HashStable<StableHashingContext<'__ctx>> for EarlyBinder<T>where
T: HashStable<StableHashingContext<'__ctx>>,
fn hash_stable(
&self,
__hcx: &mut StableHashingContext<'__ctx>,
__hasher: &mut StableHasher
)
source§impl<T: Ord> Ord for EarlyBinder<T>
impl<T: Ord> Ord for EarlyBinder<T>
source§fn cmp(&self, other: &EarlyBinder<T>) -> Ordering
fn cmp(&self, other: &EarlyBinder<T>) -> Ordering
1.21.0 · source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
source§impl<T: ParameterizedOverTcx> ParameterizedOverTcx for EarlyBinder<T>
impl<T: ParameterizedOverTcx> ParameterizedOverTcx for EarlyBinder<T>
type Value<'tcx> = EarlyBinder<<T as ParameterizedOverTcx>::Value<'tcx>>
source§impl<T: PartialEq> PartialEq<EarlyBinder<T>> for EarlyBinder<T>
impl<T: PartialEq> PartialEq<EarlyBinder<T>> for EarlyBinder<T>
source§fn eq(&self, other: &EarlyBinder<T>) -> bool
fn eq(&self, other: &EarlyBinder<T>) -> bool
self and other values to be equal, and is used
by ==.source§impl<T: PartialOrd> PartialOrd<EarlyBinder<T>> for EarlyBinder<T>
impl<T: PartialOrd> PartialOrd<EarlyBinder<T>> for EarlyBinder<T>
source§fn partial_cmp(&self, other: &EarlyBinder<T>) -> Option<Ordering>
fn partial_cmp(&self, other: &EarlyBinder<T>) -> Option<Ordering>
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
self and other) and is used by the <=
operator. Read moresource§impl<'tcx, T> !TypeFoldable<'tcx> for EarlyBinder<T>
impl<'tcx, T> !TypeFoldable<'tcx> for EarlyBinder<T>
For early binders, you should first call subst before using any visitors.
source§fn try_fold_with<F: FallibleTypeFolder<'tcx>>(
self,
folder: &mut F
) -> Result<Self, F::Error>
fn try_fold_with<F: FallibleTypeFolder<'tcx>>(
self,
folder: &mut F
) -> Result<Self, F::Error>
source§fn fold_with<F: TypeFolder<'tcx>>(self, folder: &mut F) -> Self
fn fold_with<F: TypeFolder<'tcx>>(self, folder: &mut F) -> Self
try_fold_with for use with infallible
folders. Do not override this method, to ensure coherence with
try_fold_with.source§impl<'tcx, T> !TypeVisitable<'tcx> for EarlyBinder<T>
impl<'tcx, T> !TypeVisitable<'tcx> for EarlyBinder<T>
source§fn visit_with<V: TypeVisitor<'tcx>>(
&self,
visitor: &mut V
) -> ControlFlow<V::BreakTy>
fn visit_with<V: TypeVisitor<'tcx>>(
&self,
visitor: &mut V
) -> ControlFlow<V::BreakTy>
source§fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
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 has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
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
fn has_escaping_bound_vars(&self) -> bool
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 morefn has_type_flags(&self, flags: TypeFlags) -> bool
fn has_projections(&self) -> bool
fn has_opaque_types(&self) -> bool
fn references_error(&self) -> bool
fn error_reported(&self) -> Result<(), ErrorGuaranteed>
fn has_non_region_param(&self) -> bool
fn has_infer_regions(&self) -> bool
fn has_infer_types(&self) -> bool
fn has_non_region_infer(&self) -> bool
fn needs_infer(&self) -> bool
fn has_placeholders(&self) -> bool
fn needs_subst(&self) -> bool
source§fn has_free_regions(&self) -> bool
fn has_free_regions(&self) -> bool
fn has_erased_regions(&self) -> bool
source§fn has_erasable_regions(&self) -> bool
fn has_erasable_regions(&self) -> bool
source§fn is_global(&self) -> bool
fn is_global(&self) -> bool
source§fn has_late_bound_regions(&self) -> bool
fn has_late_bound_regions(&self) -> bool
source§fn has_non_region_late_bound(&self) -> bool
fn has_non_region_late_bound(&self) -> bool
source§fn has_late_bound_vars(&self) -> bool
fn has_late_bound_vars(&self) -> bool
source§fn still_further_specializable(&self) -> bool
fn still_further_specializable(&self) -> bool
impl
specialization.impl<T: Copy> Copy for EarlyBinder<T>
impl<T: Eq> Eq for EarlyBinder<T>
impl<T> StructuralEq for EarlyBinder<T>
impl<T> StructuralPartialEq for EarlyBinder<T>
Auto Trait Implementations§
impl<T> RefUnwindSafe for EarlyBinder<T>where
T: RefUnwindSafe,
impl<T> Send for EarlyBinder<T>where
T: Send,
impl<T> Sync for EarlyBinder<T>where
T: Sync,
impl<T> Unpin for EarlyBinder<T>where
T: Unpin,
impl<T> UnwindSafe for EarlyBinder<T>where
T: UnwindSafe,
Blanket Implementations§
source§impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut T
fn allocate_from_iter<'a>(
arena: &'a Arena<'tcx>,
iter: impl IntoIterator<Item = T>
) -> &'a mut [T] ⓘ
source§impl<Tcx, T> DepNodeParams<Tcx> for Twhere
Tcx: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
impl<Tcx, T> DepNodeParams<Tcx> for Twhere
Tcx: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
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<<Tcx as DepContext>::DepKind>
) -> Option<T>
default fn recover(
_: Tcx,
_: &DepNode<<Tcx as DepContext>::DepKind>
) -> Option<T>
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<T, R> InternIteratorElement<T, R> for T
impl<T, R> InternIteratorElement<T, R> for T
type Output = R
fn intern_with<I, F>(iter: I, f: F) -> <T as InternIteratorElement<T, R>>::Outputwhere
I: Iterator<Item = T>,
F: FnOnce(&[T]) -> R,
source§impl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
source§impl<'tcx, T> ToPredicate<'tcx, T> for T
impl<'tcx, T> ToPredicate<'tcx, T> for T
fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> T
source§impl<Tcx, T, D> Value<Tcx, D> for Twhere
Tcx: DepContext,
D: DepKind,
impl<Tcx, T, D> Value<Tcx, D> for Twhere
Tcx: DepContext,
D: DepKind,
default fn from_cycle_error(tcx: Tcx, _: &[QueryInfo<D>]) -> 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.