Struct rustc_middle::ty::generic_args::ArgFolder

struct ArgFolder<'a, 'tcx> {
    tcx: TyCtxt<'tcx>,
    args: &'a [GenericArg<'tcx>],
    binders_passed: u32,
}

Fields

tcx: TyCtxt<'tcx>

args: &'a [GenericArg<'tcx>]

binders_passed: u32

Number of region binders we have passed through while doing the instantiation

Implementations

impl<'a, 'tcx> ArgFolder<'a, 'tcx>

fn ty_for_param(&self, p: ParamTy, source_ty: Ty<'tcx>) -> Ty<'tcx>

fn type_param_expected( &self, p: ParamTy, ty: Ty<'tcx>, kind: GenericArgKind<'tcx> ) -> !

fn type_param_out_of_range(&self, p: ParamTy, ty: Ty<'tcx>) -> !

fn const_for_param(&self, p: ParamConst, source_ct: Const<'tcx>) -> Const<'tcx>

fn const_param_expected( &self, p: ParamConst, ct: Const<'tcx>, kind: GenericArgKind<'tcx> ) -> !

fn const_param_out_of_range(&self, p: ParamConst, ct: Const<'tcx>) -> !

fn shift_vars_through_binders<T: TypeFoldable<TyCtxt<'tcx>>>(&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: Region<'tcx>) -> Region<'tcx>

Trait Implementations

impl<'a, 'tcx> TypeFolder<TyCtxt<'tcx>> for ArgFolder<'a, 'tcx>

fn interner(&self) -> TyCtxt<'tcx>

fn fold_binder<T: TypeFoldable<TyCtxt<'tcx>>>( &mut self, t: Binder<'tcx, T> ) -> Binder<'tcx, T>

fn fold_region(&mut self, r: Region<'tcx>) -> Region<'tcx>

fn fold_ty(&mut self, t: Ty<'tcx>) -> Ty<'tcx>

fn fold_const(&mut self, c: Const<'tcx>) -> Const<'tcx>

fn fold_predicate( &mut self, p: <I as Interner>::Predicate ) -> <I as Interner>::Predicate

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