Struct rustc_middle::ty::visit::LateBoundRegionsCollector

struct LateBoundRegionsCollector {
    current_index: DebruijnIndex,
    regions: FxHashSet<BoundRegionKind>,
    just_constrained: bool,
}

Collects all the late-bound regions at the innermost binding level into a hash set.

Fields

current_index: DebruijnIndex

regions: FxHashSet<BoundRegionKind>

just_constrained: bool

true if we only want regions that are known to be “constrained” when you equate this type with another type. In particular, if you have e.g., &'a u32 and &'b u32, equating them constraints 'a == 'b. But if you have <&'a u32 as Trait>::Foo and <&'b u32 as Trait>::Foo, normalizing those types may mean that 'a and 'b don’t appear in the results, so they are not considered constrained.

Implementations

impl LateBoundRegionsCollector

fn new(just_constrained: bool) -> Self

Trait Implementations

impl<'tcx> TypeVisitor<'tcx> for LateBoundRegionsCollector

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

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

fn visit_const(&mut self, c: Const<'tcx>) -> ControlFlow<Self::BreakTy>

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

type BreakTy = !

fn visit_unevaluated(
    &mut self,
    uv: Unevaluated<'tcx>
) -> ControlFlow<Self::BreakTy>

fn visit_predicate(&mut self, p: Predicate<'tcx>) -> ControlFlow<Self::BreakTy>

fn visit_mir_const(
    &mut self,
    c: ConstantKind<'tcx>
) -> ControlFlow<Self::BreakTy>

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