Struct chalk_ir::PlaceholderIndex
source · [−]pub struct PlaceholderIndex {
pub ui: UniverseIndex,
pub idx: usize,
}
Expand description
Index of an universally quantified parameter in the environment. Two indexes are required, the one of the universe itself and the relative index inside the universe.
Fields
ui: UniverseIndex
Index of the universe.
idx: usize
Index in the universe.
Implementations
sourceimpl PlaceholderIndex
impl PlaceholderIndex
sourcepub fn to_lifetime<I: Interner>(self, interner: I) -> Lifetime<I>
pub fn to_lifetime<I: Interner>(self, interner: I) -> Lifetime<I>
Wrap the placeholder instance in a lifetime.
Trait Implementations
sourceimpl Clone for PlaceholderIndex
impl Clone for PlaceholderIndex
sourcefn clone(&self) -> PlaceholderIndex
fn clone(&self) -> PlaceholderIndex
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 more
sourceimpl Debug for PlaceholderIndex
impl Debug for PlaceholderIndex
sourceimpl Hash for PlaceholderIndex
impl Hash for PlaceholderIndex
sourceimpl Ord for PlaceholderIndex
impl Ord for PlaceholderIndex
sourcefn cmp(&self, other: &PlaceholderIndex) -> Ordering
fn cmp(&self, other: &PlaceholderIndex) -> 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) -> Self where
Self: PartialOrd<Self>,
fn clamp(self, min: Self, max: Self) -> Self where
Self: PartialOrd<Self>,
Restrict a value to a certain interval. Read more
sourceimpl PartialEq<PlaceholderIndex> for PlaceholderIndex
impl PartialEq<PlaceholderIndex> for PlaceholderIndex
sourcefn eq(&self, other: &PlaceholderIndex) -> bool
fn eq(&self, other: &PlaceholderIndex) -> bool
This method tests for self
and other
values to be equal, and is used
by ==
. Read more
sourcefn ne(&self, other: &PlaceholderIndex) -> bool
fn ne(&self, other: &PlaceholderIndex) -> bool
This method tests for !=
.
sourceimpl PartialOrd<PlaceholderIndex> for PlaceholderIndex
impl PartialOrd<PlaceholderIndex> for PlaceholderIndex
sourcefn partial_cmp(&self, other: &PlaceholderIndex) -> Option<Ordering>
fn partial_cmp(&self, other: &PlaceholderIndex) -> Option<Ordering>
This method returns an ordering between self
and other
values if one exists. Read more
1.0.0 · sourcefn lt(&self, other: &Rhs) -> bool
fn lt(&self, other: &Rhs) -> bool
This method tests less than (for self
and other
) and is used by the <
operator. Read more
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 more
sourceimpl<I: Interner> TypeFoldable<I> for PlaceholderIndex
impl<I: Interner> TypeFoldable<I> for PlaceholderIndex
sourcefn fold_with<E>(
self,
_folder: &mut dyn TypeFolder<I, Error = E>,
_outer_binder: DebruijnIndex
) -> Result<Self, E>
fn fold_with<E>(
self,
_folder: &mut dyn TypeFolder<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 more
sourceimpl<I: Interner> TypeVisitable<I> for PlaceholderIndex
impl<I: Interner> TypeVisitable<I> for PlaceholderIndex
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 more
sourceimpl<I: Interner> Zip<I> for PlaceholderIndex
impl<I: Interner> Zip<I> for PlaceholderIndex
impl Copy for PlaceholderIndex
impl Eq for PlaceholderIndex
impl StructuralEq for PlaceholderIndex
impl StructuralPartialEq for PlaceholderIndex
Auto Trait Implementations
impl RefUnwindSafe for PlaceholderIndex
impl Send for PlaceholderIndex
impl Sync for PlaceholderIndex
impl Unpin for PlaceholderIndex
impl UnwindSafe for PlaceholderIndex
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
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) -> U where
Self: CastTo<U>,
U: HasInterner,
fn cast<U>(self, interner: U::Interner) -> U where
Self: CastTo<U>,
U: HasInterner,
Cast a value to type U
using CastTo
.
sourceimpl<T, I> Shift<I> for T where
T: TypeFoldable<I>,
I: Interner,
impl<T, I> Shift<I> for T where
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 more
sourcefn 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 more
sourcefn 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 T where
I: Interner,
T: TypeVisitable<I>,
impl<T, I> VisitExt<I> for T where
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.