pub struct CtxtInterners<'tcx> {Show 24 fields
arena: &'tcx WorkerLocal<Arena<'tcx>>,
type_: ShardedHashMap<InternedInSet<'tcx, WithCachedTypeInfo<TyKind<'tcx>>>, ()>,
const_lists: ShardedHashMap<InternedInSet<'tcx, List<Const<'tcx>>>, ()>,
args: ShardedHashMap<InternedInSet<'tcx, GenericArgs<'tcx>>, ()>,
type_lists: ShardedHashMap<InternedInSet<'tcx, List<Ty<'tcx>>>, ()>,
canonical_var_infos: ShardedHashMap<InternedInSet<'tcx, List<CanonicalVarInfo<'tcx>>>, ()>,
region: ShardedHashMap<InternedInSet<'tcx, RegionKind<'tcx>>, ()>,
poly_existential_predicates: ShardedHashMap<InternedInSet<'tcx, List<PolyExistentialPredicate<'tcx>>>, ()>,
predicate: ShardedHashMap<InternedInSet<'tcx, WithCachedTypeInfo<Binder<'tcx, PredicateKind<'tcx>>>>, ()>,
clauses: ShardedHashMap<InternedInSet<'tcx, ListWithCachedTypeInfo<Clause<'tcx>>>, ()>,
projs: ShardedHashMap<InternedInSet<'tcx, List<ProjectionKind>>, ()>,
place_elems: ShardedHashMap<InternedInSet<'tcx, List<PlaceElem<'tcx>>>, ()>,
const_: ShardedHashMap<InternedInSet<'tcx, WithCachedTypeInfo<ConstKind<'tcx>>>, ()>,
pat: ShardedHashMap<InternedInSet<'tcx, PatternKind<'tcx>>, ()>,
const_allocation: ShardedHashMap<InternedInSet<'tcx, Allocation>, ()>,
bound_variable_kinds: ShardedHashMap<InternedInSet<'tcx, List<BoundVariableKind>>, ()>,
layout: ShardedHashMap<InternedInSet<'tcx, LayoutData<FieldIdx, VariantIdx>>, ()>,
adt_def: ShardedHashMap<InternedInSet<'tcx, AdtDefData>, ()>,
external_constraints: ShardedHashMap<InternedInSet<'tcx, ExternalConstraintsData<TyCtxt<'tcx>>>, ()>,
predefined_opaques_in_body: ShardedHashMap<InternedInSet<'tcx, PredefinedOpaquesData<TyCtxt<'tcx>>>, ()>,
fields: ShardedHashMap<InternedInSet<'tcx, List<FieldIdx>>, ()>,
local_def_ids: ShardedHashMap<InternedInSet<'tcx, List<LocalDefId>>, ()>,
captures: ShardedHashMap<InternedInSet<'tcx, List<&'tcx CapturedPlace<'tcx>>>, ()>,
offset_of: ShardedHashMap<InternedInSet<'tcx, List<(VariantIdx, FieldIdx)>>, ()>,
}
Fields§
§arena: &'tcx WorkerLocal<Arena<'tcx>>
The arena that types, regions, etc. are allocated from.
type_: ShardedHashMap<InternedInSet<'tcx, WithCachedTypeInfo<TyKind<'tcx>>>, ()>
§const_lists: ShardedHashMap<InternedInSet<'tcx, List<Const<'tcx>>>, ()>
§args: ShardedHashMap<InternedInSet<'tcx, GenericArgs<'tcx>>, ()>
§type_lists: ShardedHashMap<InternedInSet<'tcx, List<Ty<'tcx>>>, ()>
§canonical_var_infos: ShardedHashMap<InternedInSet<'tcx, List<CanonicalVarInfo<'tcx>>>, ()>
§region: ShardedHashMap<InternedInSet<'tcx, RegionKind<'tcx>>, ()>
§poly_existential_predicates: ShardedHashMap<InternedInSet<'tcx, List<PolyExistentialPredicate<'tcx>>>, ()>
§predicate: ShardedHashMap<InternedInSet<'tcx, WithCachedTypeInfo<Binder<'tcx, PredicateKind<'tcx>>>>, ()>
§clauses: ShardedHashMap<InternedInSet<'tcx, ListWithCachedTypeInfo<Clause<'tcx>>>, ()>
§projs: ShardedHashMap<InternedInSet<'tcx, List<ProjectionKind>>, ()>
§place_elems: ShardedHashMap<InternedInSet<'tcx, List<PlaceElem<'tcx>>>, ()>
§const_: ShardedHashMap<InternedInSet<'tcx, WithCachedTypeInfo<ConstKind<'tcx>>>, ()>
§pat: ShardedHashMap<InternedInSet<'tcx, PatternKind<'tcx>>, ()>
§const_allocation: ShardedHashMap<InternedInSet<'tcx, Allocation>, ()>
§bound_variable_kinds: ShardedHashMap<InternedInSet<'tcx, List<BoundVariableKind>>, ()>
§layout: ShardedHashMap<InternedInSet<'tcx, LayoutData<FieldIdx, VariantIdx>>, ()>
§adt_def: ShardedHashMap<InternedInSet<'tcx, AdtDefData>, ()>
§external_constraints: ShardedHashMap<InternedInSet<'tcx, ExternalConstraintsData<TyCtxt<'tcx>>>, ()>
§predefined_opaques_in_body: ShardedHashMap<InternedInSet<'tcx, PredefinedOpaquesData<TyCtxt<'tcx>>>, ()>
§fields: ShardedHashMap<InternedInSet<'tcx, List<FieldIdx>>, ()>
§local_def_ids: ShardedHashMap<InternedInSet<'tcx, List<LocalDefId>>, ()>
§captures: ShardedHashMap<InternedInSet<'tcx, List<&'tcx CapturedPlace<'tcx>>>, ()>
§offset_of: ShardedHashMap<InternedInSet<'tcx, List<(VariantIdx, FieldIdx)>>, ()>
Implementations§
Source§impl<'tcx> CtxtInterners<'tcx>
impl<'tcx> CtxtInterners<'tcx>
fn new(arena: &'tcx WorkerLocal<Arena<'tcx>>) -> CtxtInterners<'tcx>
Sourcefn intern_ty(
&self,
kind: TyKind<'tcx>,
sess: &Session,
untracked: &Untracked,
) -> Ty<'tcx>
fn intern_ty( &self, kind: TyKind<'tcx>, sess: &Session, untracked: &Untracked, ) -> Ty<'tcx>
Interns a type. (Use mk_*
functions instead, where possible.)
Sourcefn intern_const(
&self,
kind: ConstKind<'tcx>,
sess: &Session,
untracked: &Untracked,
) -> Const<'tcx>
fn intern_const( &self, kind: ConstKind<'tcx>, sess: &Session, untracked: &Untracked, ) -> Const<'tcx>
Interns a const. (Use mk_*
functions instead, where possible.)
fn stable_hash<'a, T: HashStable<StableHashingContext<'a>>>( &self, flags: &FlagComputation, sess: &'a Session, untracked: &'a Untracked, val: &T, ) -> Fingerprint
Sourcefn intern_predicate(
&self,
kind: Binder<'tcx, PredicateKind<'tcx>>,
sess: &Session,
untracked: &Untracked,
) -> Predicate<'tcx>
fn intern_predicate( &self, kind: Binder<'tcx, PredicateKind<'tcx>>, sess: &Session, untracked: &Untracked, ) -> Predicate<'tcx>
Interns a predicate. (Use mk_predicate
instead, where possible.)
fn intern_clauses(&self, clauses: &[Clause<'tcx>]) -> Clauses<'tcx>
Auto Trait Implementations§
impl<'tcx> DynSend for CtxtInterners<'tcx>
impl<'tcx> DynSync for CtxtInterners<'tcx>
impl<'tcx> !Freeze for CtxtInterners<'tcx>
impl<'tcx> !RefUnwindSafe for CtxtInterners<'tcx>
impl<'tcx> !Send for CtxtInterners<'tcx>
impl<'tcx> !Sync for CtxtInterners<'tcx>
impl<'tcx> Unpin for CtxtInterners<'tcx>
impl<'tcx> !UnwindSafe for CtxtInterners<'tcx>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
Source§impl<T> Filterable for T
impl<T> Filterable for T
Source§fn filterable(
self,
filter_name: &'static str,
) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
fn filterable( self, filter_name: &'static str, ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
Creates a filterable data provider with the given name for debugging. Read more
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§impl<P> IntoQueryParam<P> for P
impl<P> IntoQueryParam<P> for P
fn into_query_param(self) -> P
Source§impl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
Source§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
Source§impl<I, T> UpcastFrom<I, T> for T
impl<I, T> UpcastFrom<I, T> for T
fn upcast_from(from: T, _tcx: I) -> 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, cycle_error: &CycleError, _guar: ErrorGuaranteed, ) -> T
Source§impl<T> WithSubscriber for T
impl<T> WithSubscriber for T
Source§fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
Source§fn with_current_subscriber(self) -> WithDispatch<Self>
fn with_current_subscriber(self) -> WithDispatch<Self>
impl<'a, T> Captures<'a> for Twhere
T: ?Sized,
impl<T> ErasedDestructor for Twhere
T: 'static,
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: 928 bytes