Struct chalk_ir::ProgramClauseData

pub struct ProgramClauseData<I: Interner>(pub Binders<ProgramClauseImplication<I>>);

Contains the data for a program clause.

Tuple Fields

0: Binders<ProgramClauseImplication<I>>

Implementations

impl<I: Interner> ProgramClauseData<I>

pub fn into_from_env_clause(self, interner: I) -> ProgramClauseData<I>

Change the program clause data into a FromEnv program clause.

pub fn intern(self, interner: I) -> ProgramClause<I>

Intern the program clause data.

Trait Implementations

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<I: Interner> CouldMatch<DomainGoal<I>> for ProgramClauseData<I>

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

Checks whether self and other could possibly match.

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

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

Formats the value using the given formatter.

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

type Interner = I

The interner associated with the type.

impl<I: Hash + Interner> Hash for ProgramClauseData<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, Self: Sized,

Feeds a slice of this type into the given Hasher.

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

fn eq(&self, other: &ProgramClauseData<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: Interner> TypeFoldable<I> for ProgramClauseData<I>

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: Interner> TypeSuperFoldable<I> for ProgramClauseData<I>

fn try_super_fold_with<E>( self, folder: &mut dyn FallibleTypeFolder<I, Error = E>, outer_binder: DebruijnIndex, ) -> Result<Self, 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> Zip<I> for ProgramClauseData<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: Eq + Interner> Eq for ProgramClauseData<I>

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