Struct chalk_ir::Ty

pub struct Ty<I: Interner> { /* fields omitted */ }

Methods

impl<I: Interner> Ty<I>

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

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

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

pub fn from_env(&self) -> FromEnv<I>

pub fn well_formed(&self) -> WellFormed<I>

pub fn into_from_env_goal(self, interner: &I) -> DomainGoal<I>

Creates a domain goal FromEnv(T) where T is this type.

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

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

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

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

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

Returns true if this is a BoundVar or InferenceVar.

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

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

True if this type contains "bound" types/lifetimes, and hence needs to be shifted across binders. This is a very inefficient check, intended only for debug assertions, because I am lazy.

Trait Implementations

impl<I: Interner> CastTo<Parameter<I>> for Ty<I>

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

impl<I: Clone + Interner> Clone for Ty<I> where
    I::InternedType: Clone, 

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<I: Copy + Interner> Copy for Ty<I> where
    I::InternedType: Copy, 

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

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

Formats the value using the given formatter.

impl<I: Eq + Interner> Eq for Ty<I> where
    I::InternedType: Eq, 

impl<I: Interner, TI: TargetInterner<I>> Fold<I, TI> for Ty<I>

"Folding" a type invokes the fold_ty method on the folder; this usually (in turn) invokes super_fold_ty to fold the individual parts.

type Result = Ty<TI>

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

fn fold_with<'i>(
    &self,
    folder: &mut dyn Folder<'i, I, TI>,
    outer_binder: DebruijnIndex
) -> Fallible<Self::Result> where
    I: 'i,
    TI: 'i, 

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.

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

type Interner = I

impl<I: Hash + Interner> Hash for Ty<I> where
    I::InternedType: 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, 

Feeds a slice of this type into the given [Hasher].

impl<I: Ord + Interner> Ord for Ty<I> where
    I::InternedType: Ord, 

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

This method returns an [Ordering] between self and other.

#[must_use]fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

#[must_use]fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

#[must_use]fn clamp(self, min: Self, max: Self) -> Self

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

Restrict a value to a certain interval.

impl<I: PartialEq + Interner> PartialEq<Ty<I>> for Ty<I> where
    I::InternedType: PartialEq, 

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

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

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

This method tests for !=.

impl<I: PartialOrd + Interner> PartialOrd<Ty<I>> for Ty<I> where
    I::InternedType: PartialOrd, 

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

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

fn lt(&self, other: &Ty<I>) -> bool

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

fn le(&self, other: &Ty<I>) -> bool

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

fn gt(&self, other: &Ty<I>) -> bool

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

fn ge(&self, other: &Ty<I>) -> bool

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

impl<I: Interner> StructuralEq for Ty<I>

impl<I: Interner> StructuralPartialEq for Ty<I>

impl<I, TI> SuperFold<I, TI> for Ty<I> where
    I: Interner,
    TI: TargetInterner<I>, 

"Super fold" for a type invokes te more detailed callbacks on the type

fn super_fold_with<'i>(
    &self,
    folder: &mut dyn Folder<'i, I, TI>,
    outer_binder: DebruijnIndex
) -> Fallible<Ty<TI>> where
    I: 'i,
    TI: 'i, 

impl<I> SuperVisit<I> for Ty<I> where
    I: Interner, 

"Super visit" for a type invokes te more detailed callbacks on the type

fn super_visit_with<'i, R: VisitResult>(
    &self,
    visitor: &mut dyn Visitor<'i, I, Result = R>,
    outer_binder: DebruijnIndex
) -> R where
    I: 'i, 

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

"visiting" a type invokes the visit_ty method on the visitor; this usually (in turn) invokes super_visit_ty to visit the individual parts.

fn visit_with<'i, R: VisitResult>(
    &self,
    visitor: &mut dyn Visitor<'i, I, Result = R>,
    outer_binder: DebruijnIndex
) -> R where
    I: 'i, 

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

fn zip_with<'i, Z: Zipper<'i, I>>(
    zipper: &mut Z,
    a: &Self,
    b: &Self
) -> Fallible<()> where
    I: 'i,