Struct rustc_middle::ty::util::OpaqueTypeExpander
source · struct OpaqueTypeExpander<'tcx> {
seen_opaque_tys: FxHashSet<DefId>,
expanded_cache: FxHashMap<(DefId, SubstsRef<'tcx>), Ty<'tcx>>,
primary_def_id: Option<DefId>,
found_recursion: bool,
found_any_recursion: bool,
check_recursion: bool,
tcx: TyCtxt<'tcx>,
}
Fields§
§seen_opaque_tys: FxHashSet<DefId>
§expanded_cache: FxHashMap<(DefId, SubstsRef<'tcx>), Ty<'tcx>>
§primary_def_id: Option<DefId>
§found_recursion: bool
§found_any_recursion: 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§
source§impl<'tcx> OpaqueTypeExpander<'tcx>
impl<'tcx> OpaqueTypeExpander<'tcx>
Trait Implementations§
source§impl<'tcx> TypeFolder<'tcx> for OpaqueTypeExpander<'tcx>
impl<'tcx> TypeFolder<'tcx> for OpaqueTypeExpander<'tcx>
fn tcx(&self) -> TyCtxt<'tcx>
fn fold_ty(&mut self, t: Ty<'tcx>) -> Ty<'tcx>
fn fold_binder<T>(&mut self, t: Binder<'tcx, T>) -> Binder<'tcx, T>where
T: TypeFoldable<'tcx>,
fn fold_region(&mut self, r: Region<'tcx>) -> Region<'tcx>
fn fold_const(&mut self, c: Const<'tcx>) -> Const<'tcx>
fn fold_predicate(&mut self, p: Predicate<'tcx>) -> Predicate<'tcx>
Auto Trait Implementations§
impl<'tcx> !RefUnwindSafe for OpaqueTypeExpander<'tcx>
impl<'tcx> !Send for OpaqueTypeExpander<'tcx>
impl<'tcx> !Sync for OpaqueTypeExpander<'tcx>
impl<'tcx> Unpin for OpaqueTypeExpander<'tcx>
impl<'tcx> !UnwindSafe for OpaqueTypeExpander<'tcx>
Blanket Implementations§
source§impl<'tcx, F> FallibleTypeFolder<'tcx> for Fwhere
F: TypeFolder<'tcx>,
impl<'tcx, F> FallibleTypeFolder<'tcx> for Fwhere
F: TypeFolder<'tcx>,
type Error = !
fn tcx<'a>(&'a self) -> TyCtxt<'tcx>
fn try_fold_binder<T>(
&mut self,
t: Binder<'tcx, T>
) -> Result<Binder<'tcx, T>, !>where
T: TypeFoldable<'tcx>,
fn try_fold_ty(&mut self, t: Ty<'tcx>) -> Result<Ty<'tcx>, !>
fn try_fold_region(&mut self, r: Region<'tcx>) -> Result<Region<'tcx>, !>
fn try_fold_const(&mut self, c: Const<'tcx>) -> Result<Const<'tcx>, !>
fn try_fold_predicate(
&mut self,
p: Predicate<'tcx>
) -> Result<Predicate<'tcx>, !>
source§impl<T, R> InternIteratorElement<T, R> for T
impl<T, R> InternIteratorElement<T, R> for T
type Output = R
fn intern_with<I, F>(iter: I, f: F) -> <T as InternIteratorElement<T, R>>::Outputwhere
I: Iterator<Item = T>,
F: FnOnce(&[T]) -> R,
source§impl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
source§impl<'tcx, T> ToPredicate<'tcx, T> for T
impl<'tcx, T> ToPredicate<'tcx, T> for T
fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> T
source§impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
default fn from_cycle_error(tcx: Tcx, _: &[QueryInfo]) -> T
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