pub struct Region<I>(pub <I as Interner>::InternedRegionKind)
where
I: Interner;Expand description
Use this rather than RegionKind, whenever possible.
Tuple Fields§
§0: <I as Interner>::InternedRegionKindImplementations§
Source§impl<I> Region<I>where
I: Interner,
impl<I> Region<I>where
I: Interner,
pub fn new_bound( interner: I, debruijn: DebruijnIndex, bound_region: BoundRegion<I>, ) -> Region<I>
pub fn new_anon_bound( interner: I, debruijn: DebruijnIndex, var: BoundVar, ) -> Region<I>
pub fn new_canonical_bound(interner: I, var: BoundVar) -> Region<I>
pub fn new_placeholder( interner: I, placeholder: Placeholder<I, BoundRegion<I>>, ) -> Region<I>
pub fn new_static(interner: I) -> Region<I>
pub fn is_bound(self) -> bool
pub fn type_flags(self) -> TypeFlags
pub fn kind(self) -> RegionKind<I>
Trait Implementations§
impl<I> Copy for Region<I>where
I: Interner,
impl<I> Eq for Region<I>where
I: Interner,
Source§impl<I> Flags for Region<I>where
I: Interner,
impl<I> Flags for Region<I>where
I: Interner,
fn flags(&self) -> TypeFlags
fn outer_exclusive_binder(&self) -> DebruijnIndex
Source§impl<I> IntoDiagArg for Region<I>
impl<I> IntoDiagArg for Region<I>
Source§fn into_diag_arg(self, path: &mut Option<PathBuf>) -> DiagArgValue
fn into_diag_arg(self, path: &mut Option<PathBuf>) -> DiagArgValue
Source§impl<I> IntoKind for Region<I>where
I: Interner,
impl<I> IntoKind for Region<I>where
I: Interner,
type Kind = RegionKind<I>
fn kind(self) -> RegionKind<I>
Source§impl<'tcx> RegionExt<'tcx> for Region<TyCtxt<'tcx>>
impl<'tcx> RegionExt<'tcx> for Region<TyCtxt<'tcx>>
Source§fn new_error(tcx: TyCtxt<'tcx>, guar: ErrorGuaranteed) -> Region<TyCtxt<'tcx>>
fn new_error(tcx: TyCtxt<'tcx>, guar: ErrorGuaranteed) -> Region<TyCtxt<'tcx>>
Constructs a RegionKind::ReError region.
Source§fn new_error_misc(tcx: TyCtxt<'tcx>) -> Region<TyCtxt<'tcx>>
fn new_error_misc(tcx: TyCtxt<'tcx>) -> Region<TyCtxt<'tcx>>
Constructs a RegionKind::ReError region and registers a delayed bug to ensure it gets
used.
Source§fn new_error_with_message<S>(
tcx: TyCtxt<'tcx>,
span: S,
msg: &'static str,
) -> Region<TyCtxt<'tcx>>
fn new_error_with_message<S>( tcx: TyCtxt<'tcx>, span: S, msg: &'static str, ) -> Region<TyCtxt<'tcx>>
Constructs a RegionKind::ReError region and registers a delayed bug with the given msg
to ensure it gets used.
Source§fn new_from_kind(
tcx: TyCtxt<'tcx>,
kind: RegionKind<TyCtxt<'tcx>>,
) -> Region<TyCtxt<'tcx>>
fn new_from_kind( tcx: TyCtxt<'tcx>, kind: RegionKind<TyCtxt<'tcx>>, ) -> Region<TyCtxt<'tcx>>
Avoid this in favour of more specific new_* methods, where possible,
to avoid the cost of the match.
fn new_early_param( tcx: TyCtxt<'tcx>, early_bound_region: EarlyParamRegion, ) -> Region<TyCtxt<'tcx>>
fn new_late_param( tcx: TyCtxt<'tcx>, scope: DefId, kind: LateParamRegionKind, ) -> Region<TyCtxt<'tcx>>
fn new_var(tcx: TyCtxt<'tcx>, v: RegionVid) -> Region<TyCtxt<'tcx>>
Source§impl<'tcx> RegionUtilitiesExt<'tcx> for Region<TyCtxt<'tcx>>
impl<'tcx> RegionUtilitiesExt<'tcx> for Region<TyCtxt<'tcx>>
Source§fn is_free(self) -> bool
fn is_free(self) -> bool
True for free region in the current context.
This is the case for 'static and param regions.
Source§fn opt_param_def_id(
self,
tcx: TyCtxt<'tcx>,
binding_item: DefId,
) -> Option<DefId>
fn opt_param_def_id( self, tcx: TyCtxt<'tcx>, binding_item: DefId, ) -> Option<DefId>
Given some item binding_item, check if this region is a generic parameter introduced by it
or one of the parent generics. Returns the DefId of the parameter definition if so.
fn get_name(self, tcx: TyCtxt<'tcx>) -> Option<Symbol>
fn get_name_or_anon(self, tcx: TyCtxt<'tcx>) -> Symbol
fn is_error(self) -> bool
fn is_static(self) -> bool
fn is_erased(self) -> bool
fn is_placeholder(self) -> bool
fn bound_at_or_above_binder(self, index: DebruijnIndex) -> bool
fn is_var(self) -> bool
fn as_var(self) -> RegionVid
Source§impl<I> StableHash for Region<I>
impl<I> StableHash for Region<I>
fn stable_hash<__Hcx>(
&self,
__hcx: &mut __Hcx,
__hasher: &mut StableHasher<SipHasher128>,
)where
__Hcx: StableHashCtxt,
Source§impl<I> TypeFoldable<I> for Region<I>where
I: Interner,
impl<I> TypeFoldable<I> for Region<I>where
I: Interner,
Source§fn try_fold_with<F>(
self,
folder: &mut F,
) -> Result<Region<I>, <F as FallibleTypeFolder<I>>::Error>where
F: FallibleTypeFolder<I>,
fn try_fold_with<F>(
self,
folder: &mut F,
) -> Result<Region<I>, <F as FallibleTypeFolder<I>>::Error>where
F: FallibleTypeFolder<I>,
Source§impl<I> TypeVisitable<I> for Region<I>where
I: Interner,
impl<I> TypeVisitable<I> for Region<I>where
I: Interner,
Source§fn visit_with<V>(&self, visitor: &mut V) -> <V as TypeVisitor<I>>::Resultwhere
V: TypeVisitor<I>,
fn visit_with<V>(&self, visitor: &mut V) -> <V as TypeVisitor<I>>::Resultwhere
V: TypeVisitor<I>,
Auto Trait Implementations§
impl<I> DynSend for Region<I>
impl<I> DynSync for Region<I>
impl<I> Freeze for Region<I>
impl<I> RefUnwindSafe for Region<I>
impl<I> Send for Region<I>
impl<I> Sync for Region<I>
impl<I> Unpin for Region<I>
impl<I> UnsafeUnpin for Region<I>
impl<I> UnwindSafe for Region<I>
Blanket Implementations§
Source§impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
fn allocate_on(self, arena: &'tcx Arena<'tcx>) -> &'tcx mut T
fn allocate_from_iter( arena: &'tcx Arena<'tcx>, iter: impl IntoIterator<Item = T>, ) -> &'tcx mut [T]
Source§impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
fn allocate_on(self, arena: &'tcx Arena<'tcx>) -> &'tcx mut T
fn allocate_from_iter( arena: &'tcx Arena<'tcx>, iter: impl IntoIterator<Item = T>, ) -> &'tcx mut [T]
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
Source§impl<'tcx, T> DepNodeKey<'tcx> for Twhere
T: StableHash + Debug,
impl<'tcx, T> DepNodeKey<'tcx> for Twhere
T: StableHash + Debug,
default fn key_fingerprint_style() -> KeyFingerprintStyle
Source§default fn to_fingerprint(&self, tcx: TyCtxt<'tcx>) -> Fingerprint
default fn to_fingerprint(&self, tcx: TyCtxt<'tcx>) -> Fingerprint
Fingerprint to be used
in DepNode.Source§default fn try_recover_key(_: TyCtxt<'tcx>, _: &DepNode) -> Option<T>
default fn try_recover_key(_: TyCtxt<'tcx>, _: &DepNode) -> Option<T>
DepNode,
something which is needed when forcing DepNodes during red-green
evaluation. The query system will only call this method if
fingerprint_style() is not FingerprintStyle::Opaque.
It is always valid to return None here, in which case incremental
compilation will treat the query as having changed instead of forcing it.Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.impl<T> ErasedDestructor for Twhere
T: 'static,
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> ⓘ
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> ⓘ
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<K> IntoQueryKey<K> for K
impl<K> IntoQueryKey<K> for K
Source§fn into_query_key(self) -> K
fn into_query_key(self) -> K
Self to K.
This should always be a very cheap conversion, e.g. LocalDefId::to_def_id.Source§impl<'tcx, T> IsSuggestable<'tcx> for T
impl<'tcx, T> IsSuggestable<'tcx> for T
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> TypeVisitableExt<I> for Twhere
I: Interner,
T: TypeVisitable<I>,
impl<I, T> TypeVisitableExt<I> for Twhere
I: Interner,
T: TypeVisitable<I>,
fn has_type_flags(&self, flags: TypeFlags) -> bool
Source§fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
true if self has any late-bound regions that are either
bound by binder or bound by some binder outside of binder.
If binder is ty::INNERMOST, this indicates whether
there are any late-bound regions that appear free.fn error_reported(&self) -> Result<(), <I as Interner>::ErrorGuaranteed>
fn non_region_error_reported( &self, ) -> Result<(), <I as Interner>::ErrorGuaranteed>
Source§fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
true if this type has any regions that escape binder (and
hence are not bound by it).Source§fn has_escaping_bound_vars(&self) -> bool
fn has_escaping_bound_vars(&self) -> bool
true if this type has regions that are not a part of the
type. For example, given a for<'a> fn(&'a i32) this function returns
false, while given a fn(&'a i32) it returns true. The latter can
occur when traversing through the former. Read morefn has_aliases(&self) -> bool
fn has_opaque_types(&self) -> bool
fn has_coroutines(&self) -> bool
fn references_error(&self) -> bool
fn has_non_region_param(&self) -> bool
fn has_regions(&self) -> bool
fn has_infer_regions(&self) -> bool
fn has_infer_types(&self) -> bool
fn has_non_region_infer(&self) -> bool
fn has_infer(&self) -> bool
fn has_placeholders(&self) -> bool
fn has_non_region_placeholders(&self) -> bool
fn has_param(&self) -> bool
Source§fn has_free_regions(&self) -> bool
fn has_free_regions(&self) -> bool
fn has_erased_regions(&self) -> bool
Source§fn has_erasable_regions(&self) -> bool
fn has_erasable_regions(&self) -> bool
Source§fn is_global(&self) -> bool
fn is_global(&self) -> bool
Source§fn has_bound_regions(&self) -> bool
fn has_bound_regions(&self) -> bool
Source§fn has_non_region_bound_vars(&self) -> bool
fn has_non_region_bound_vars(&self) -> bool
Source§fn has_bound_vars(&self) -> bool
fn has_bound_vars(&self) -> bool
Source§fn still_further_specializable(&self) -> bool
fn still_further_specializable(&self) -> bool
impl
specialization.Source§fn has_non_region_error(&self) -> bool
fn has_non_region_error(&self) -> bool
Source§fn has_rigid_aliases(&self) -> bool
fn has_rigid_aliases(&self) -> bool
IsRigid::Yes. Used for skipping normalization.Source§fn has_non_rigid_aliases(&self) -> bool
fn has_non_rigid_aliases(&self) -> bool
IsRigid::No.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<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> ⓘ
Layout§
Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.