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_coroutines: bool,
    check_recursion: bool,
    tcx: TyCtxt<'tcx>,
    inspect_coroutine_fields: InspectCoroutineFields,
}

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_coroutines: 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>§inspect_coroutine_fields: InspectCoroutineFields

Implementations§

source§

impl<'tcx> OpaqueTypeExpander<'tcx>

source

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

source

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

Trait Implementations§

source§

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

source§

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

source§

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

source§

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

source§

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>,

source§

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

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<T> Aligned for T

source§

const ALIGN: Alignment = _

Alignment of Self.
source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T, R> CollectAndApply<T, R> for T

source§

fn collect_and_apply<I, F>(iter: I, f: F) -> R
where I: Iterator<Item = T>, F: FnOnce(&[T]) -> R,

Equivalent to f(&iter.collect::<Vec<_>>()).

§

type Output = R

source§

impl<I, F> FallibleTypeFolder<I> for F
where I: Interner, F: TypeFolder<I>,

§

type Error = !

source§

fn interner(&self) -> I

source§

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

source§

fn try_fold_ty( &mut self, t: <I as Interner>::Ty ) -> Result<<I as Interner>::Ty, !>
where <I as Interner>::Ty: TypeSuperFoldable<I>,

source§

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

source§

fn try_fold_const( &mut self, c: <I as Interner>::Const ) -> Result<<I as Interner>::Const, !>
where <I as Interner>::Const: TypeSuperFoldable<I>,

source§

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

source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<P> IntoQueryParam<P> for P

source§

impl<T> MaybeResult<T> for T

§

type Error = !

source§

fn from(_: Result<T, <T as MaybeResult<T>>::Error>) -> T

source§

fn to_result(self) -> Result<T, <T as MaybeResult<T>>::Error>

source§

impl<'tcx, T> ToPredicate<'tcx, T> for T

source§

fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> T

source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<Tcx, T> Value<Tcx> for T
where Tcx: DepContext,

source§

default fn from_cycle_error( tcx: Tcx, cycle_error: &CycleError, _guar: ErrorGuaranteed ) -> 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