struct RegionVisitor<F> {
    outer_index: DebruijnIndex,
    callback: F,
}

Fields§

§outer_index: DebruijnIndex

The index of a binder just outside the things we have traversed. If we encounter a bound region bound by this binder or one outer to it, it appears free. Example:

ⓘ
      for<'a> fn(for<'b> fn(), T)
// ^          ^          ^     ^
// |          |          |     | here, would be shifted in 1
// |          |          | here, would be shifted in 2
// |          | here, would be `INNERMOST` shifted in by 1
// | here, initially, binder would be `INNERMOST`

You see that, initially, any bound value is free, because we’ve not traversed any binders. As we pass through a binder, we shift the outer_index by 1 to account for the new binder that encloses us.

§callback: F

Trait Implementations§

source§

impl<'tcx, F> TypeVisitor<TyCtxt<'tcx>> for RegionVisitor<F>where F: FnMut(Region<'tcx>) -> bool,

§

type BreakTy = ()

source§

fn visit_binder<T: TypeVisitable<TyCtxt<'tcx>>>( &mut self, t: &Binder<'tcx, T> ) -> ControlFlow<Self::BreakTy>

source§

fn visit_region(&mut self, r: Region<'tcx>) -> ControlFlow<Self::BreakTy>

source§

fn visit_ty(&mut self, ty: Ty<'tcx>) -> ControlFlow<Self::BreakTy>

Auto Trait Implementations§

§

impl<F> RefUnwindSafe for RegionVisitor<F>where F: RefUnwindSafe,

§

impl<F> Send for RegionVisitor<F>where F: Send,

§

impl<F> Sync for RegionVisitor<F>where F: Sync,

§

impl<F> Unpin for RegionVisitor<F>where F: Unpin,

§

impl<F> UnwindSafe for RegionVisitor<F>where F: UnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

const: unstable · source§

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

Mutably borrows from an owned value. Read more
source§

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

source§

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

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

§

type Output = R

source§

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

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

const: unstable · 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> MaybeResult<T> for T

§

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<'tcx, T> ToPredicate<'tcx, T> for T

source§

fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> T

source§

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

§

type Error = Infallible

The type returned in the event of a conversion error.
const: unstable · source§

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

Performs the conversion.
source§

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

§

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

The type returned in the event of a conversion error.
const: unstable · source§

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

Performs the conversion.
source§

impl<Tcx, T, D> Value<Tcx, D> for Twhere Tcx: DepContext, D: DepKind,

source§

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.