Enum chalk_ir::WellFormed

pub enum WellFormed<I: Interner> {
    Trait(TraitRef<I>),
    Ty(Ty<I>),
}

Checks whether a type or trait ref is well-formed.

Variants

Trait(TraitRef<I>)

A predicate which is true when some trait ref is well-formed. For example, given the following trait definitions:

trait Clone { ... }
trait Copy where Self: Clone { ... }

then we have the following rule:

WellFormed(?Self: Copy) :- ?Self: Copy, WellFormed(?Self: Clone)

Ty(Ty<I>)

A predicate which is true when some type is well-formed. For example, given the following type definition:

struct Set<K> where K: Hash {
    ...
}

then we have the following rule: WellFormedTy(Set<K>) :- Implemented(K: Hash).

Trait Implementations

impl<I: Interner> CastTo<DomainGoal<I>> for WellFormed<I>

fn cast_to(self, _interner: &I) -> DomainGoal<I>

Cast a value to type T.

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<I: Interner> Copy for WellFormed<I> where
    I::InternedType: Copy,
    I::InternedSubstitution: Copy, 

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

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

Formats the value using the given formatter.

impl<I: Eq + Interner> Eq for WellFormed<I>

impl<I: Interner, _TI> Fold<I, _TI> for WellFormed<I> where
    _TI: TargetInterner<I>, 

type Result = WellFormed<_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 WellFormed<I>

type Interner = I

The interner associated with the type.

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

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: PartialEq + Interner> PartialEq<WellFormed<I>> for WellFormed<I>

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

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

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

This method tests for !=.

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

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

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

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

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

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