Struct chalk_ir::SubtypeGoal

pub struct SubtypeGoal<I: Interner> {
    pub a: Ty<I>,
    pub b: Ty<I>,
}

Subtype goal: tries to prove that a is a subtype of b

Fields

a: Ty<I>

b: Ty<I>

Trait Implementations

impl<I: Interner> CastTo<Goal<I>> for SubtypeGoal<I>

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

Cast a value to type T.

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

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

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

Formats the value using the given formatter.

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

type Result = SubtypeGoal<I>

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

impl<I: Hash + Interner> Hash for SubtypeGoal<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<SubtypeGoal<I>> for SubtypeGoal<I>

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

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

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

This method tests for !=.

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

fn visit_with<B>(
    &self,
    visitor: &mut dyn Visitor<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 SubtypeGoal<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: Interner> Copy for SubtypeGoal<I> where
    I::InternedType: Copy, 

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

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

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