Struct rustc_middle::ty::util::OpaqueTypeExpander

struct OpaqueTypeExpander<'tcx> {
    seen_opaque_tys: FxHashSet<DefId>,
    expanded_cache: FxHashMap<(DefId, GenericArgsRef<'tcx>), Ty<'tcx>>,
    primary_def_id: Option<DefId>,
    found_recursion: bool,
    found_any_recursion: bool,
    expand_generators: bool,
    check_recursion: bool,
    tcx: TyCtxt<'tcx>,
}

Fields

seen_opaque_tys: FxHashSet<DefId>

expanded_cache: FxHashMap<(DefId, GenericArgsRef<'tcx>), Ty<'tcx>>

primary_def_id: Option<DefId>

found_recursion: bool

found_any_recursion: bool

expand_generators: bool

check_recursion: bool

Whether or not to check for recursive opaque types. This is true when we’re explicitly checking for opaque type recursion, and ‘false’ otherwise to avoid unnecessary work.

tcx: TyCtxt<'tcx>

Implementations

impl<'tcx> OpaqueTypeExpander<'tcx>

fn expand_opaque_ty( &mut self, def_id: DefId, args: GenericArgsRef<'tcx> ) -> Option<Ty<'tcx>>

fn expand_generator( &mut self, def_id: DefId, args: GenericArgsRef<'tcx> ) -> Option<Ty<'tcx>>

Trait Implementations

impl<'tcx> TypeFolder<TyCtxt<'tcx>> for OpaqueTypeExpander<'tcx>

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

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

fn fold_predicate(&mut self, p: Predicate<'tcx>) -> Predicate<'tcx>

fn fold_binder<T>( &mut self, t: <I as Interner>::Binder<T> ) -> <I as Interner>::Binder<T>where T: TypeFoldable<I>, <I as Interner>::Binder<T>: TypeSuperFoldable<I>,

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

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