pub struct Const<I: Interner> { /* private fields */ }
Expand description
Constants.
Implementations
sourceimpl<I: Interner> Const<I>
impl<I: Interner> Const<I>
sourcepub fn new(interner: I, data: impl CastTo<ConstData<I>>) -> Self
pub fn new(interner: I, data: impl CastTo<ConstData<I>>) -> Self
Create a Const
using something that can be cast to const data.
sourcepub fn interned(&self) -> &I::InternedConst
pub fn interned(&self) -> &I::InternedConst
Gets the interned constant.
sourcepub fn bound_var(&self, interner: I) -> Option<BoundVar>
pub fn bound_var(&self, interner: I) -> Option<BoundVar>
If this is a ConstData::BoundVar(d)
, returns Some(d)
else None
.
sourcepub fn inference_var(&self, interner: I) -> Option<InferenceVar>
pub fn inference_var(&self, interner: I) -> Option<InferenceVar>
If this is a ConstData::InferenceVar(d)
, returns Some(d)
else None
.
sourcepub fn needs_shift(&self, interner: I) -> bool
pub fn needs_shift(&self, interner: I) -> bool
True if this const is a “bound” const, and hence needs to be shifted across binders. Meant for debug assertions.
Trait Implementations
sourceimpl<I: Interner> CastTo<GenericArg<I>> for Const<I>
impl<I: Interner> CastTo<GenericArg<I>> for Const<I>
sourcefn cast_to(self, interner: I) -> GenericArg<I>
fn cast_to(self, interner: I) -> GenericArg<I>
Cast a value to type
T
.sourceimpl<I: Interner> HasInterner for Const<I>
impl<I: Interner> HasInterner for Const<I>
type Interner = I
type Interner = I
The interner associated with the type.
sourceimpl<I: Ord + Interner> Ord for Const<I>where
I::InternedConst: Ord,
impl<I: Ord + Interner> Ord for Const<I>where
I::InternedConst: Ord,
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<I: PartialEq + Interner> PartialEq<Const<I>> for Const<I>where
I::InternedConst: PartialEq,
impl<I: PartialEq + Interner> PartialEq<Const<I>> for Const<I>where
I::InternedConst: PartialEq,
sourceimpl<I: PartialOrd + Interner> PartialOrd<Const<I>> for Const<I>where
I::InternedConst: PartialOrd,
impl<I: PartialOrd + Interner> PartialOrd<Const<I>> for Const<I>where
I::InternedConst: PartialOrd,
sourcefn partial_cmp(&self, other: &Const<I>) -> Option<Ordering>
fn partial_cmp(&self, other: &Const<I>) -> 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 Const<I>
impl<I: Interner> TypeFoldable<I> for Const<I>
“Folding” a const invokes the fold_const
method on the folder; this
usually (in turn) invokes super_fold_const
to fold the individual
parts.
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> TypeSuperFoldable<I> for Const<I>where
I: Interner,
impl<I> TypeSuperFoldable<I> for Const<I>where
I: Interner,
sourcefn try_super_fold_with<E>(
self,
folder: &mut dyn FallibleTypeFolder<I, Error = E>,
outer_binder: DebruijnIndex
) -> Result<Const<I>, E>
fn try_super_fold_with<E>(
self,
folder: &mut dyn FallibleTypeFolder<I, Error = E>,
outer_binder: DebruijnIndex
) -> Result<Const<I>, E>
Recursively folds the value.
sourcefn super_fold_with(
self,
folder: &mut dyn TypeFolder<I>,
outer_binder: DebruijnIndex
) -> Self
fn super_fold_with(
self,
folder: &mut dyn TypeFolder<I>,
outer_binder: DebruijnIndex
) -> Self
A convenient alternative to
try_super_fold_with
for use with
infallible folders. Do not override this method, to ensure coherence
with try_super_fold_with
. Read moresourceimpl<I: Interner> TypeSuperVisitable<I> for Const<I>
impl<I: Interner> TypeSuperVisitable<I> for Const<I>
sourcefn super_visit_with<B>(
&self,
visitor: &mut dyn TypeVisitor<I, BreakTy = B>,
outer_binder: DebruijnIndex
) -> ControlFlow<B>
fn super_visit_with<B>(
&self,
visitor: &mut dyn TypeVisitor<I, BreakTy = B>,
outer_binder: DebruijnIndex
) -> ControlFlow<B>
Recursively visits the type contents.
sourceimpl<I: Interner> TypeVisitable<I> for Const<I>
impl<I: Interner> TypeVisitable<I> for Const<I>
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<I: Copy + Interner> Copy for Const<I>where
I::InternedConst: Copy,
impl<I: Eq + Interner> Eq for Const<I>where
I::InternedConst: Eq,
impl<I: Interner> StructuralEq for Const<I>
impl<I: Interner> StructuralPartialEq for Const<I>
Auto Trait Implementations
impl<I> RefUnwindSafe for Const<I>where
<I as Interner>::InternedConst: RefUnwindSafe,
impl<I> Send for Const<I>where
<I as Interner>::InternedConst: Send,
impl<I> Sync for Const<I>where
<I as Interner>::InternedConst: Sync,
impl<I> Unpin for Const<I>where
<I as Interner>::InternedConst: Unpin,
impl<I> UnwindSafe for Const<I>where
<I as Interner>::InternedConst: UnwindSafe,
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> CouldMatch<T> for Twhere
T: Zip<I> + HasInterner<Interner = I> + ?Sized,
I: Interner,
impl<T, I> CouldMatch<T> for Twhere
T: Zip<I> + HasInterner<Interner = I> + ?Sized,
I: Interner,
sourcefn could_match(
&self,
interner: I,
db: &dyn UnificationDatabase<I>,
other: &T
) -> bool
fn could_match(
&self,
interner: I,
db: &dyn UnificationDatabase<I>,
other: &T
) -> bool
Checks whether
self
and other
could possibly match.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.