Struct IsProbablyCyclical

struct IsProbablyCyclical<'tcx> {
    tcx: TyCtxt<'tcx>,
    item_def_id: DefId,
    seen: FxHashSet<DefId>,
}

Detects cases where an ADT/LTA is trivially cyclical – we want to detect this so we only mention that its parameters are used cyclically if the ADT/LTA is truly cyclical.

Notably, we don’t consider substitutions here, so this may have false positives.

Fields

tcx: TyCtxt<'tcx>

item_def_id: DefId

seen: FxHashSet<DefId>

Implementations

impl<'tcx> IsProbablyCyclical<'tcx>

fn visit_def(&mut self, def_id: DefId) -> ControlFlow<(), ()>

Trait Implementations

impl<'tcx> TypeVisitor<TyCtxt<'tcx>> for IsProbablyCyclical<'tcx>

type Result = ControlFlow<()>

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

fn visit_binder<T>(&mut self, t: &Binder<I, T>) -> Self::Result

where T: TypeVisitable<I>,

fn visit_region(&mut self, r: <I as Interner>::Region) -> Self::Result

fn visit_const(&mut self, c: <I as Interner>::Const) -> Self::Result

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

fn visit_clauses(&mut self, p: <I as Interner>::Clauses) -> Self::Result

fn visit_error( &mut self, _guar: <I as Interner>::ErrorGuaranteed, ) -> Self::Result

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