Struct chalk_ir::Const

pub struct Const<I: Interner> {
    pub(crate) interned: I::InternedConst,
}

Constants.

Fields

interned: I::InternedConst

Implementations

impl<I: Interner> Const<I>

pub fn new(interner: I, data: impl CastTo<ConstData<I>>) -> Self

Create a Const using something that can be cast to const data.

pub fn interned(&self) -> &I::InternedConst

Gets the interned constant.

pub fn data(&self, interner: I) -> &ConstData<I>

Gets the constant data from the interner.

pub fn bound_var(&self, interner: I) -> Option<BoundVar>

If this is a ConstData::BoundVar(d), returns Some(d) else None.

pub fn inference_var(&self, interner: I) -> Option<InferenceVar>

If this is a ConstData::InferenceVar(d), returns Some(d) else None.

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

impl<I: Interner> CastTo<GenericArg<I>> for Const<I>

fn cast_to(self, interner: I) -> GenericArg<I>

Cast a value to type T.

impl<I: Clone + Interner> Clone for Const<I>

where I::InternedConst: Clone,

fn clone(&self) -> Const<I>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<I: Interner> Debug for Const<I>

fn fmt(&self, fmt: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<I: Interner> HasInterner for Const<I>

type Interner = I

The interner associated with the type.

impl<I: Hash + Interner> Hash for Const<I>

where I::InternedConst: Hash,

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<I: Ord + Interner> Ord for Const<I>

where I::InternedConst: Ord,

fn cmp(&self, other: &Const<I>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized + PartialOrd,

Restrict a value to a certain interval.

impl<I: PartialEq + Interner> PartialEq for Const<I>

where I::InternedConst: PartialEq,

fn eq(&self, other: &Const<I>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<I: PartialOrd + Interner> PartialOrd for Const<I>

where I::InternedConst: PartialOrd,

fn partial_cmp(&self, other: &Const<I>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

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.

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.

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.

impl<I> TypeSuperFoldable<I> for Const<I>

where I: Interner,

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.

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.

impl<I: Interner> TypeSuperVisitable<I> for Const<I>

fn super_visit_with<B>( &self, visitor: &mut dyn TypeVisitor<I, BreakTy = B>, outer_binder: DebruijnIndex, ) -> ControlFlow<B>

Recursively visits the type contents.

impl<I: Interner> TypeVisitable<I> for Const<I>

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.

impl<I: Interner> Zip<I> for Const<I>

fn zip_with<Z: Zipper<I>>( zipper: &mut Z, variance: Variance, a: &Self, b: &Self, ) -> Fallible<()>

Uses the zipper to walk through two values, ensuring that they match.

impl<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> StructuralPartialEq for Const<I>