Struct chalk_ir::UniverseIndex
source · [−]pub struct UniverseIndex {
pub counter: usize,
}
Expand description
An universe index is how a universally quantified parameter is
represented when it’s binder is moved into the environment.
An example chain of transformations would be:
forall<T> { Goal(T) }
(syntactical representation)
forall { Goal(?0) }
(used a DeBruijn index)
Goal(!U1)
(the quantifier was moved to the environment and replaced with a universe index)
See https://rustc-dev-guide.rust-lang.org/borrow_check/region_inference.html#placeholders-and-universes for more.
Fields
counter: usize
The counter for the universe index, starts with 0.
Implementations
sourceimpl UniverseIndex
impl UniverseIndex
sourcepub const ROOT: UniverseIndex = _
pub const ROOT: UniverseIndex = _
Root universe index (0).
sourcepub fn root() -> UniverseIndex
pub fn root() -> UniverseIndex
Root universe index (0).
sourcepub fn can_see(self, ui: UniverseIndex) -> bool
pub fn can_see(self, ui: UniverseIndex) -> bool
Whether one universe can “see” another.
sourcepub fn next(self) -> UniverseIndex
pub fn next(self) -> UniverseIndex
Increases the index counter.
Trait Implementations
sourceimpl Clone for UniverseIndex
impl Clone for UniverseIndex
sourcefn clone(&self) -> UniverseIndex
fn clone(&self) -> UniverseIndex
Returns a copy of the value. Read more
1.0.0 · sourcefn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresourceimpl Debug for UniverseIndex
impl Debug for UniverseIndex
sourceimpl Display for UniverseIndex
impl Display for UniverseIndex
sourceimpl Hash for UniverseIndex
impl Hash for UniverseIndex
sourceimpl Ord for UniverseIndex
impl Ord for UniverseIndex
sourcefn cmp(&self, other: &UniverseIndex) -> Ordering
fn cmp(&self, other: &UniverseIndex) -> Ordering
1.21.0 · sourcefn max(self, other: Self) -> Self
fn max(self, other: Self) -> Self
Compares and returns the maximum of two values. Read more
1.21.0 · sourcefn min(self, other: Self) -> Self
fn min(self, other: Self) -> Self
Compares and returns the minimum of two values. Read more
1.50.0 · sourcefn clamp(self, min: Self, max: Self) -> Selfwhere
Self: PartialOrd<Self>,
fn clamp(self, min: Self, max: Self) -> Selfwhere
Self: PartialOrd<Self>,
Restrict a value to a certain interval. Read more
sourceimpl PartialEq<UniverseIndex> for UniverseIndex
impl PartialEq<UniverseIndex> for UniverseIndex
sourcefn eq(&self, other: &UniverseIndex) -> bool
fn eq(&self, other: &UniverseIndex) -> bool
sourceimpl PartialOrd<UniverseIndex> for UniverseIndex
impl PartialOrd<UniverseIndex> for UniverseIndex
sourcefn partial_cmp(&self, other: &UniverseIndex) -> Option<Ordering>
fn partial_cmp(&self, other: &UniverseIndex) -> Option<Ordering>
1.0.0 · sourcefn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self
and other
) and is used by the <=
operator. Read moresourceimpl<I: Interner> TypeFoldable<I> for UniverseIndex
impl<I: Interner> TypeFoldable<I> for UniverseIndex
sourcefn try_fold_with<E>(
self,
_folder: &mut dyn FallibleTypeFolder<I, Error = E>,
_outer_binder: DebruijnIndex
) -> Result<Self, E>
fn try_fold_with<E>(
self,
_folder: &mut dyn FallibleTypeFolder<I, Error = E>,
_outer_binder: DebruijnIndex
) -> Result<Self, E>
Apply the given folder
folder
to self
; binders
is the
number of binders that are in scope when beginning the
folder. Typically binders
starts as 0, but is adjusted when
we encounter Binders<T>
in the IR or other similar
constructs. Read moresourcefn fold_with(
self,
folder: &mut dyn TypeFolder<I>,
outer_binder: DebruijnIndex
) -> Self
fn fold_with(
self,
folder: &mut dyn TypeFolder<I>,
outer_binder: DebruijnIndex
) -> Self
A convenient alternative to
try_fold_with
for use with infallible
folders. Do not override this method, to ensure coherence with
try_fold_with
. Read moresourceimpl<I: Interner> TypeVisitable<I> for UniverseIndex
impl<I: Interner> TypeVisitable<I> for UniverseIndex
sourcefn visit_with<B>(
&self,
_visitor: &mut dyn TypeVisitor<I, BreakTy = B>,
_outer_binder: DebruijnIndex
) -> ControlFlow<B>
fn visit_with<B>(
&self,
_visitor: &mut dyn TypeVisitor<I, BreakTy = B>,
_outer_binder: DebruijnIndex
) -> ControlFlow<B>
Apply the given visitor
visitor
to self
; binders
is the
number of binders that are in scope when beginning the
visitor. Typically binders
starts as 0, but is adjusted when
we encounter Binders<T>
in the IR or other similar
constructs. Read moreimpl Copy for UniverseIndex
impl Eq for UniverseIndex
impl StructuralEq for UniverseIndex
impl StructuralPartialEq for UniverseIndex
Auto Trait Implementations
impl RefUnwindSafe for UniverseIndex
impl Send for UniverseIndex
impl Sync for UniverseIndex
impl Unpin for UniverseIndex
impl UnwindSafe for UniverseIndex
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<T> Cast for T
impl<T> Cast for T
sourcefn cast<U>(self, interner: U::Interner) -> Uwhere
Self: CastTo<U>,
U: HasInterner,
fn cast<U>(self, interner: U::Interner) -> Uwhere
Self: CastTo<U>,
U: HasInterner,
Cast a value to type
U
using CastTo
.sourceimpl<T, I> Shift<I> for Twhere
T: TypeFoldable<I>,
I: Interner,
impl<T, I> Shift<I> for Twhere
T: TypeFoldable<I>,
I: Interner,
sourcefn shifted_in(self, interner: I) -> T
fn shifted_in(self, interner: I) -> T
Shifts this term in one level of binders.
sourcefn shifted_in_from(self, interner: I, source_binder: DebruijnIndex) -> T
fn shifted_in_from(self, interner: I, source_binder: DebruijnIndex) -> T
Shifts a term valid at
outer_binder
so that it is
valid at the innermost binder. See DebruijnIndex::shifted_in_from
for a detailed explanation. Read moresourcefn shifted_out_to(
self,
interner: I,
target_binder: DebruijnIndex
) -> Result<T, NoSolution>
fn shifted_out_to(
self,
interner: I,
target_binder: DebruijnIndex
) -> Result<T, NoSolution>
Shifts a term valid at the innermost binder so that it is
valid at
outer_binder
. See DebruijnIndex::shifted_out_to
for a detailed explanation. Read moresourcefn shifted_out(self, interner: I) -> Result<T, NoSolution>
fn shifted_out(self, interner: I) -> Result<T, NoSolution>
Shifts this term out one level of binders.
sourceimpl<T, I> VisitExt<I> for Twhere
I: Interner,
T: TypeVisitable<I>,
impl<T, I> VisitExt<I> for Twhere
I: Interner,
T: TypeVisitable<I>,
sourcefn has_free_vars(&self, interner: I) -> bool
fn has_free_vars(&self, interner: I) -> bool
Check whether there are free (non-bound) variables.