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: boolfound_any_recursion: boolcheck_recursion: boolWhether 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
sourceimpl<'tcx> OpaqueTypeExpander<'tcx>
impl<'tcx> OpaqueTypeExpander<'tcx>
Trait Implementations
sourceimpl<'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_unevaluated(&mut self, uv: Unevaluated<'tcx>) -> Unevaluated<'tcx>
fn fold_predicate(&mut self, p: Predicate<'tcx>) -> Predicate<'tcx>
fn fold_mir_const(&mut self, c: ConstantKind<'tcx>) -> ConstantKind<'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
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceimpl<'tcx, F> FallibleTypeFolder<'tcx> for Fwhere
F: TypeFolder<'tcx>,
impl<'tcx, F> FallibleTypeFolder<'tcx> for Fwhere
F: TypeFolder<'tcx>,
type Error = !
fn tcx(&'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_unevaluated(
&mut self,
c: Unevaluated<'tcx, Option<Promoted>>
) -> Result<Unevaluated<'tcx, Option<Promoted>>, !>
fn try_fold_predicate(
&mut self,
p: Predicate<'tcx>
) -> Result<Predicate<'tcx>, !>
fn try_fold_mir_const(
&mut self,
c: ConstantKind<'tcx>
) -> Result<ConstantKind<'tcx>, !>
sourceimpl<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,
sourceimpl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
sourceimpl<CTX, T> Value<CTX> for Twhere
CTX: DepContext,
impl<CTX, T> Value<CTX> for Twhere
CTX: DepContext,
default fn from_cycle_error(tcx: CTX) -> T
impl<'a, T> Captures<'a> for Twhere
T: ?Sized,
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