Struct chalk_ir::Const

source · [−]

pub struct Const<I: Interner> { /* private fields */ }

Expand description

Constants.

Implementations

source

impl<I: Interner> Const

source

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

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

source

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

Gets the interned constant.

source

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

Gets the constant data from the interner.

source

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

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

source

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

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

source

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

source

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

source

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

Cast a value to type T.

source

impl<I: Clone + Interner> Clone for Const where
I::InternedConst: Clone,

source

fn clone(&self) -> Const

Returns a copy of the value. Read more

1.0.0 · source

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

Performs copy-assignment from source. Read more

source

impl<I: Interner> Debug for Const

source

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

Formats the value using the given formatter. Read more

source

impl<I: Interner> Fold for Const

“Folding” a const invokes the fold_const method on the folder; this usually (in turn) invokes super_fold_const to fold the individual parts.

The type of value that will be produced once folding is done. Typically this is Self, unless Self contains borrowed values, in which case owned values are produced (for example, one can fold over a &T value where T: Fold, in which case you get back a T, not a &T). Read more

source

fn fold_with<E>(
 self,
 folder: &mut dyn Folder<I, Error = E>,
 outer_binder: DebruijnIndex
) -> Result<Self::Result, 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

source

impl<I: Interner> HasInterner for Const

type Interner = I

The interner associated with the type.

source

impl<I: Hash + Interner> Hash for Const where
I::InternedConst: Hash,

source

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

Feeds this value into the given Hasher. Read more

1.3.0 · source

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

Feeds a slice of this type into the given Hasher. Read more

source

impl<I: Ord + Interner> Ord for Const where
I::InternedConst: Ord,

source

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

This method returns an Ordering between self and other. Read more

1.21.0 · source

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

Compares and returns the maximum of two values. Read more

1.21.0 · source

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

Compares and returns the minimum of two values. Read more

1.50.0 · source

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

Restrict a value to a certain interval. Read more

source

impl<I: PartialEq + Interner> PartialEq<Const> for Const where
I::InternedConst: PartialEq,

source

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

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

source

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

This method tests for !=.

source

impl<I: PartialOrd + Interner> PartialOrd<Const> for Const where
I::InternedConst: PartialOrd,

source

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

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

1.0.0 · source

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 · source

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

1.0.0 · source

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

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

1.0.0 · source

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

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

source

impl SuperFold for Const where
I: Interner,

source

fn super_fold_with<E>(
 self,
 folder: &mut dyn Folder<I, Error = E>,
 outer_binder: DebruijnIndex
) -> Result<Const, E>

Recursively folds the value.

source

impl<I: Interner> SuperVisit for Const

source

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

Recursively visits the type contents.

source

impl<I: Interner> Visit for Const

source

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

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

source

impl<I: Interner> Zip for Const

source

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

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

source

impl<I: Interner> StructuralPartialEq for Const

Auto Trait Implementations

impl RefUnwindSafe for Const where
::InternedConst: RefUnwindSafe,

impl Send for Const where
::InternedConst: Send,

impl Sync for Const where
::InternedConst: Sync,

impl Unpin for Const where
::InternedConst: Unpin,

impl UnwindSafe for Const where
::InternedConst: UnwindSafe,

Blanket Implementations

source

impl<T> Any for T where
T: 'static + ?Sized,

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<T> Borrow<T> for T where
T: ?Sized,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for T where
T: ?Sized,

const: unstable · source

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

source

impl<T> Cast for T

source

fn cast(self, interner: U::Interner) -> U where
Self: CastTo,
U: HasInterner,

Cast a value to type U using CastTo.

source

impl<T, I> CouldMatch<T> for T where
T: Zip + HasInterner<Interner = I> + ?Sized,
I: Interner,

source

fn could_match(
 &self,
 interner: I,
 db: &dyn UnificationDatabase,
 other: &T
) -> bool

Checks whether self and other could possibly match.

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T, U> Into for T where
U: From<T>,

const: unstable · source

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source

impl<T, I> Shift for T where
T: Fold,
I: Interner,

source

fn shifted_in(self, interner: I) -> <T as Fold>::Result

Shifts this term in one level of binders.

source

fn shifted_in_from(
 self,
 interner: I,
 source_binder: DebruijnIndex
) -> <T as Fold>::Result

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

source

fn shifted_out_to(
 self,
 interner: I,
 target_binder: DebruijnIndex
) -> Result<<T as Fold>::Result, 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

source

fn shifted_out(self, interner: I) -> Result<<T as Fold>::Result, NoSolution>

Shifts this term out one level of binders.

source

impl<T> ToOwned for T where
T: Clone,

type Owned = T

The resulting type after obtaining ownership.

source

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

source

fn clone_into(&self, target: &mut T)

🔬 This is a nightly-only experimental API. (toowned_clone_into)

Uses borrowed data to replace owned data, usually by cloning. Read more

source

impl<T, U> TryFrom for T where
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

source

impl<T, U> TryInto for T where
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

source

impl<T, I> VisitExt for T where
I: Interner,
T: Visit,

source

fn has_free_vars(&self, interner: I) -> bool

Check whether there are free (non-bound) variables.

Struct chalk_ir::Const

Implementations

impl<I: Interner> Const<I>

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

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

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

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

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

pub fn needs_shift(&self, interner: I) -> bool

Trait Implementations

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

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

impl<I: Clone + Interner> Clone for Const<I> where I::InternedConst: Clone,

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

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

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

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

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

type Result = Const<I>

fn fold_with<E>( self, folder: &mut dyn Folder<I, Error = E>, outer_binder: DebruijnIndex) -> Result<Self::Result, E>

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

type Interner = I

impl<I: Hash + Interner> Hash for Const<I> where I::InternedConst: Hash,

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

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

impl<I: Ord + Interner> Ord for Const<I> where I::InternedConst: Ord,

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

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

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

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

impl<I: PartialEq + Interner> PartialEq<Const<I>> for Const<I> where I::InternedConst: PartialEq,

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

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

impl<I: PartialOrd + Interner> PartialOrd<Const<I>> for Const<I> where I::InternedConst: PartialOrd,

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

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

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

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

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

impl<I> SuperFold<I> for Const<I> where I: Interner,

fn super_fold_with<E>( self, folder: &mut dyn Folder<I, Error = E>, outer_binder: DebruijnIndex) -> Result<Const<I>, E>

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

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

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

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

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

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

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> 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

impl<T> Any for T where T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for T where T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for T where T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> Cast for T

fn cast<U>(self, interner: U::Interner) -> U where Self: CastTo<U>, U: HasInterner,

impl<T, I> CouldMatch<T> for T where T: Zip<I> + HasInterner<Interner = I> + ?Sized, I: Interner,

fn could_match( &self, interner: I, db: &dyn UnificationDatabase<I>, other: &T) -> bool

impl<T> From<T> for T

fn from(t: T) -> T

impl<T, U> Into<U> for T where U: From<T>,

fn into(self) -> U

impl<T, I> Shift<I> for T where T: Fold<I>, I: Interner,

fn shifted_in(self, interner: I) -> <T as Fold<I>>::Result

fn shifted_in_from( self, interner: I, source_binder: DebruijnIndex) -> <T as Fold<I>>::Result

fn shifted_out_to( self, interner: I, target_binder: DebruijnIndex) -> Result<<T as Fold<I>>::Result, NoSolution>

fn shifted_out(self, interner: I) -> Result<<T as Fold<I>>::Result, NoSolution>

impl<T> ToOwned for T where T: Clone,

type Owned = T

fn to_owned(&self) -> T

impl<I: Clone + Interner> Clone for Const<I> where
I::InternedConst: Clone,

fn fold_with<E>(
self,
folder: &mut dyn Folder<I, Error = E>,
outer_binder: DebruijnIndex
) -> Result<Self::Result, E>

impl<I: Hash + Interner> Hash for Const<I> where
I::InternedConst: Hash,

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

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

impl<I: Ord + Interner> Ord for Const<I> where
I::InternedConst: Ord,

impl<I: PartialEq + Interner> PartialEq<Const<I>> for Const<I> where
I::InternedConst: PartialEq,

impl<I: PartialOrd + Interner> PartialOrd<Const<I>> for Const<I> where
I::InternedConst: PartialOrd,

impl<I> SuperFold<I> for Const<I> where
I: Interner,

fn super_fold_with<E>(
self,
folder: &mut dyn Folder<I, Error = E>,
outer_binder: DebruijnIndex
) -> Result<Const<I>, E>

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

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

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

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> 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,

impl<T> Any for T where
T: 'static + ?Sized,

impl<T> Borrow<T> for T where
T: ?Sized,

impl<T> BorrowMut<T> for T where
T: ?Sized,

fn cast<U>(self, interner: U::Interner) -> U where
Self: CastTo<U>,
U: HasInterner,

impl<T, I> CouldMatch<T> for T where
T: Zip<I> + HasInterner<Interner = I> + ?Sized,
I: Interner,

fn could_match(
&self,
interner: I,
db: &dyn UnificationDatabase<I>,
other: &T
) -> bool

impl<T, U> Into<U> for T where
U: From<T>,

impl<T, I> Shift<I> for T where
T: Fold<I>,
I: Interner,

fn shifted_in_from(
self,
interner: I,
source_binder: DebruijnIndex
) -> <T as Fold<I>>::Result

fn shifted_out_to(
self,
interner: I,
target_binder: DebruijnIndex
) -> Result<<T as Fold<I>>::Result, NoSolution>

impl<T> ToOwned for T where
T: Clone,

impl<T, U> TryFrom<U> for T where
U: Into<T>,

impl<T, U> TryInto<U> for T where
U: TryFrom<T>,

impl<T, I> VisitExt<I> for T where
I: Interner,
T: Visit<I>,