Struct rustc_infer::infer::canonical::ir::UniverseIndex
source · pub struct UniverseIndex {
pub(crate) private_use_as_methods_instead: u32,
}
Expand description
“Universes” are used during type- and trait-checking in the
presence of for<..>
binders to control what sets of names are
visible. Universes are arranged into a tree: the root universe
contains names that are always visible. Each child then adds a new
set of names that are visible, in addition to those of its parent.
We say that the child universe “extends” the parent universe with
new names.
To make this more concrete, consider this program:
struct Foo { }
fn bar<T>(x: T) {
let y: for<'a> fn(&'a u8, Foo) = ...;
}
The struct name Foo
is in the root universe U0. But the type
parameter T
, introduced on bar
, is in an extended universe U1
– i.e., within bar
, we can name both T
and Foo
, but outside
of bar
, we cannot name T
. Then, within the type of y
, the
region 'a
is in a universe U2 that extends U1, because we can
name it inside the fn type but not outside.
Universes are used to do type- and trait-checking around these
“forall” binders (also called universal quantification). The
idea is that when, in the body of bar
, we refer to T
as a
type, we aren’t referring to any type in particular, but rather a
kind of “fresh” type that is distinct from all other types we have
actually declared. This is called a placeholder type, and we
use universes to talk about this. In other words, a type name in
universe 0 always corresponds to some “ground” type that the user
declared, but a type name in a non-zero universe is a placeholder
type – an idealized representative of “types in general” that we
use for checking generic functions.
Fields§
§private_use_as_methods_instead: u32
Implementations§
source§impl UniverseIndex
impl UniverseIndex
sourcepub const MAX_AS_U32: u32 = 4_294_967_040u32
pub const MAX_AS_U32: u32 = 4_294_967_040u32
Maximum value the index can take, as a u32
.
sourcepub const MAX: UniverseIndex = _
pub const MAX: UniverseIndex = _
Maximum value the index can take.
sourcepub const ZERO: UniverseIndex = _
pub const ZERO: UniverseIndex = _
Zero value of the index.
sourcepub const fn from_usize(value: usize) -> UniverseIndex
pub const fn from_usize(value: usize) -> UniverseIndex
sourcepub const fn from_u32(value: u32) -> UniverseIndex
pub const fn from_u32(value: u32) -> UniverseIndex
sourcepub const fn from_u16(value: u16) -> UniverseIndex
pub const fn from_u16(value: u16) -> UniverseIndex
sourcepub const unsafe fn from_u32_unchecked(value: u32) -> UniverseIndex
pub const unsafe fn from_u32_unchecked(value: u32) -> UniverseIndex
Creates a new index from a given u32
.
§Safety
The provided value must be less than or equal to the maximum value for the newtype. Providing a value outside this range is undefined due to layout restrictions.
Prefer using from_u32
.
source§impl UniverseIndex
impl UniverseIndex
pub const ROOT: UniverseIndex = UniverseIndex::ZERO
sourcepub fn next_universe(self) -> UniverseIndex
pub fn next_universe(self) -> UniverseIndex
Returns the “next” universe index in order – this new index
is considered to extend all previous universes. This
corresponds to entering a forall
quantifier. So, for
example, suppose we have this type in universe U
:
for<'a> fn(&'a u32)
Once we “enter” into this for<'a>
quantifier, we are in a
new universe that extends U
– in this new universe, we can
name the region 'a
, but that region was not nameable from
U
because it was not in scope there.
sourcepub fn can_name(self, other: UniverseIndex) -> bool
pub fn can_name(self, other: UniverseIndex) -> bool
Returns true
if self
can name a name from other
– in other words,
if the set of names in self
is a superset of those in
other
(self >= other
).
sourcepub fn cannot_name(self, other: UniverseIndex) -> bool
pub fn cannot_name(self, other: UniverseIndex) -> bool
Returns true
if self
cannot name some names from other
– in other
words, if the set of names in self
is a strict subset of
those in other
(self < other
).
Trait Implementations§
source§impl Add<usize> for UniverseIndex
impl Add<usize> for UniverseIndex
source§type Output = UniverseIndex
type Output = UniverseIndex
+
operator.source§impl Clone for UniverseIndex
impl Clone for UniverseIndex
source§fn clone(&self) -> UniverseIndex
fn clone(&self) -> UniverseIndex
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresource§impl Debug for UniverseIndex
impl Debug for UniverseIndex
source§impl<D> Decodable<D> for UniverseIndexwhere
D: Decoder,
impl<D> Decodable<D> for UniverseIndexwhere
D: Decoder,
fn decode(d: &mut D) -> UniverseIndex
source§impl Default for UniverseIndex
impl Default for UniverseIndex
source§fn default() -> UniverseIndex
fn default() -> UniverseIndex
source§impl From<u32> for UniverseIndex
impl From<u32> for UniverseIndex
source§fn from(value: u32) -> UniverseIndex
fn from(value: u32) -> UniverseIndex
source§impl From<usize> for UniverseIndex
impl From<usize> for UniverseIndex
source§fn from(value: usize) -> UniverseIndex
fn from(value: usize) -> UniverseIndex
source§impl Hash for UniverseIndex
impl Hash for UniverseIndex
source§impl<__CTX> HashStable<__CTX> for UniverseIndex
impl<__CTX> HashStable<__CTX> for UniverseIndex
fn hash_stable( &self, __hcx: &mut __CTX, __hasher: &mut StableHasher<SipHasher128>, )
source§impl Idx for UniverseIndex
impl Idx for UniverseIndex
source§impl Ord for UniverseIndex
impl Ord for UniverseIndex
source§fn cmp(&self, other: &UniverseIndex) -> Ordering
fn cmp(&self, other: &UniverseIndex) -> Ordering
1.21.0 · source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
source§impl PartialEq for UniverseIndex
impl PartialEq for UniverseIndex
source§impl PartialOrd for UniverseIndex
impl PartialOrd for UniverseIndex
source§impl Step for UniverseIndex
impl Step for UniverseIndex
source§fn steps_between(start: &UniverseIndex, end: &UniverseIndex) -> Option<usize>
fn steps_between(start: &UniverseIndex, end: &UniverseIndex) -> Option<usize>
step_trait
)source§fn forward_checked(start: UniverseIndex, u: usize) -> Option<UniverseIndex>
fn forward_checked(start: UniverseIndex, u: usize) -> Option<UniverseIndex>
step_trait
)source§fn backward_checked(start: UniverseIndex, u: usize) -> Option<UniverseIndex>
fn backward_checked(start: UniverseIndex, u: usize) -> Option<UniverseIndex>
step_trait
)source§fn forward(start: Self, count: usize) -> Self
fn forward(start: Self, count: usize) -> Self
step_trait
)source§unsafe fn forward_unchecked(start: Self, count: usize) -> Self
unsafe fn forward_unchecked(start: Self, count: usize) -> Self
step_trait
)source§fn backward(start: Self, count: usize) -> Self
fn backward(start: Self, count: usize) -> Self
step_trait
)source§unsafe fn backward_unchecked(start: Self, count: usize) -> Self
unsafe fn backward_unchecked(start: Self, count: usize) -> Self
step_trait
)source§impl<I> TypeFoldable<I> for UniverseIndexwhere
I: Interner,
impl<I> TypeFoldable<I> for UniverseIndexwhere
I: Interner,
source§fn try_fold_with<F>(
self,
_: &mut F,
) -> Result<UniverseIndex, <F as FallibleTypeFolder<I>>::Error>where
F: FallibleTypeFolder<I>,
fn try_fold_with<F>(
self,
_: &mut F,
) -> Result<UniverseIndex, <F as FallibleTypeFolder<I>>::Error>where
F: FallibleTypeFolder<I>,
source§fn fold_with<F>(self, _: &mut F) -> UniverseIndexwhere
F: TypeFolder<I>,
fn fold_with<F>(self, _: &mut F) -> UniverseIndexwhere
F: TypeFolder<I>,
try_fold_with
for use with infallible
folders. Do not override this method, to ensure coherence with
try_fold_with
.source§impl<I> TypeVisitable<I> for UniverseIndexwhere
I: Interner,
impl<I> TypeVisitable<I> for UniverseIndexwhere
I: Interner,
source§fn visit_with<F>(&self, _: &mut F) -> <F as TypeVisitor<I>>::Resultwhere
F: TypeVisitor<I>,
fn visit_with<F>(&self, _: &mut F) -> <F as TypeVisitor<I>>::Resultwhere
F: TypeVisitor<I>,
impl Copy for UniverseIndex
impl Eq for UniverseIndex
impl StructuralPartialEq for UniverseIndex
Auto Trait Implementations§
impl Freeze for UniverseIndex
impl RefUnwindSafe for UniverseIndex
impl Send for UniverseIndex
impl Sync for UniverseIndex
impl Unpin for UniverseIndex
impl UnwindSafe for UniverseIndex
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<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut T
fn allocate_from_iter<'a>( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = T>, ) -> &'a 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<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut T
fn allocate_from_iter<'a>( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = T>, ) -> &'a 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§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
clone_to_uninit
)source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
source§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
source§impl<Tcx, T> DepNodeParams<Tcx> for T
impl<Tcx, T> DepNodeParams<Tcx> for T
default fn fingerprint_style() -> FingerprintStyle
source§default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
default fn to_debug_str(&self, _: Tcx) -> String
source§default fn recover(_: Tcx, _: &DepNode) -> Option<T>
default fn recover(_: Tcx, _: &DepNode) -> Option<T>
DepNode
,
something which is needed when forcing DepNode
s 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.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>
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<P> IntoQueryParam<P> for P
impl<P> IntoQueryParam<P> for P
fn into_query_param(self) -> P
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<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>
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, for<'a> fn(&'a i32)
return false
, while fn(&'a i32)
would return 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_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§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,
impl<T> MaybeSendSync for 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: 4 bytes