Struct rustc_type_ir::binder::ArgFolder
source · struct ArgFolder<'a, I: Interner> {
cx: I,
args: &'a [I::GenericArg],
binders_passed: u32,
}
Fields§
§cx: I
§args: &'a [I::GenericArg]
§binders_passed: u32
Number of region binders we have passed through while doing the instantiation
Implementations§
source§impl<'a, I: Interner> ArgFolder<'a, I>
impl<'a, I: Interner> ArgFolder<'a, I>
fn ty_for_param(&self, p: I::ParamTy, source_ty: I::Ty) -> I::Ty
fn type_param_expected( &self, p: I::ParamTy, ty: I::Ty, kind: GenericArgKind<I>, ) -> !
fn type_param_out_of_range(&self, p: I::ParamTy, ty: I::Ty) -> !
fn const_for_param(&self, p: I::ParamConst, source_ct: I::Const) -> I::Const
fn const_param_expected( &self, p: I::ParamConst, ct: I::Const, kind: GenericArgKind<I>, ) -> !
fn const_param_out_of_range(&self, p: I::ParamConst, ct: I::Const) -> !
fn region_param_expected( &self, ebr: I::EarlyParamRegion, r: I::Region, kind: GenericArgKind<I>, ) -> !
fn region_param_out_of_range(&self, ebr: I::EarlyParamRegion, r: I::Region) -> !
sourcefn shift_vars_through_binders<T: TypeFoldable<I>>(&self, val: T) -> T
fn shift_vars_through_binders<T: TypeFoldable<I>>(&self, val: T) -> T
It is sometimes necessary to adjust the De Bruijn indices during instantiation. This occurs when we are instantating a type with escaping bound vars into a context where we have passed through binders. That’s quite a mouthful. Let’s see an example:
type Func<A> = fn(A);
type MetaFunc = for<'a> fn(Func<&'a i32>);
The type MetaFunc
, when fully expanded, will be
for<'a> fn(fn(&'a i32))
// ^~ ^~ ^~~
// | | |
// | | DebruijnIndex of 2
// Binders
Here the 'a
lifetime is bound in the outer function, but appears as an argument of the
inner one. Therefore, that appearance will have a DebruijnIndex of 2, because we must skip
over the inner binder (remember that we count De Bruijn indices from 1). However, in the
definition of MetaFunc
, the binder is not visible, so the type &'a i32
will have a
De Bruijn index of 1. It’s only during the instantiation that we can see we must increase the
depth by 1 to account for the binder that we passed through.
As a second example, consider this twist:
type FuncTuple<A> = (A,fn(A));
type MetaFuncTuple = for<'a> fn(FuncTuple<&'a i32>);
Here the final type will be:
for<'a> fn((&'a i32, fn(&'a i32)))
// ^~~ ^~~
// | |
// DebruijnIndex of 1 |
// DebruijnIndex of 2
As indicated in the diagram, here the same type &'a i32
is instantiated once, but in the
first case we do not increase the De Bruijn index and in the second case we do. The reason
is that only in the second case have we passed through a fn binder.
fn shift_region_through_binders(&self, region: I::Region) -> I::Region
Trait Implementations§
source§impl<'a, I: Interner> TypeFolder<I> for ArgFolder<'a, I>
impl<'a, I: Interner> TypeFolder<I> for ArgFolder<'a, I>
fn cx(&self) -> I
fn fold_binder<T: TypeFoldable<I>>(&mut self, t: Binder<I, T>) -> Binder<I, T>
fn fold_region(&mut self, r: I::Region) -> I::Region
fn fold_ty(&mut self, t: I::Ty) -> I::Ty
fn fold_const(&mut self, c: I::Const) -> I::Const
fn fold_predicate(&mut self, p: I::Predicate) -> I::Predicate
Auto Trait Implementations§
impl<'a, I> Freeze for ArgFolder<'a, I>where
I: Freeze,
impl<'a, I> RefUnwindSafe for ArgFolder<'a, I>
impl<'a, I> Send for ArgFolder<'a, I>
impl<'a, I> Sync for ArgFolder<'a, I>
impl<'a, I> Unpin for ArgFolder<'a, I>where
I: Unpin,
impl<'a, I> UnwindSafe for ArgFolder<'a, I>
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
source§impl<I, F> FallibleTypeFolder<I> for Fwhere
I: Interner,
F: TypeFolder<I>,
impl<I, F> FallibleTypeFolder<I> for Fwhere
I: Interner,
F: TypeFolder<I>,
type Error = !
fn cx(&self) -> I
fn try_fold_binder<T>(&mut self, t: Binder<I, T>) -> Result<Binder<I, T>, !>where
T: TypeFoldable<I>,
fn try_fold_ty( &mut self, t: <I as Interner>::Ty, ) -> Result<<I as Interner>::Ty, !>
fn try_fold_region( &mut self, r: <I as Interner>::Region, ) -> Result<<I as Interner>::Region, !>
fn try_fold_const( &mut self, c: <I as Interner>::Const, ) -> Result<<I as Interner>::Const, !>
fn try_fold_predicate( &mut self, p: <I as Interner>::Predicate, ) -> Result<<I as Interner>::Predicate, !>
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
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 moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
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 moresource§impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
source§impl<I, T> UpcastFrom<I, T> for T
impl<I, T> UpcastFrom<I, T> for T
fn upcast_from(from: T, _tcx: I) -> T
source§impl<T> WithSubscriber for T
impl<T> WithSubscriber for T
source§fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
source§fn with_current_subscriber(self) -> WithDispatch<Self>
fn with_current_subscriber(self) -> WithDispatch<Self>
impl<'a, T> Captures<'a> for Twhere
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.