Struct chalk_ir::ProgramClauseImplication

pub struct ProgramClauseImplication<I: Interner> {
    pub consequence: DomainGoal<I>,
    pub conditions: Goals<I>,
    pub priority: ClausePriority,
}

Represents one clause of the form consequence :- conditions where conditions = cond_1 && cond_2 && ... is the conjunction of the individual conditions.

Fields

consequence: DomainGoal<I>

conditions: Goals<I>

priority: ClausePriority

Implementations

impl<I: Interner> ProgramClauseImplication<I>

pub fn debug<'a>(
    &'a self,
    interner: &'a I
) -> ProgramClauseImplicationDebug<'a, I>

impl<I: Interner> ProgramClauseImplication<I>

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

Trait Implementations

impl<I: Interner> CastTo<ProgramClause<I>> for ProgramClauseImplication<I>

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

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

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

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

Formats the value using the given formatter.

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

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

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

type Interner = I

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

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

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

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

This method tests for !=.

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

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

impl<I: Interner> Visit<I> for ProgramClauseImplication<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 ProgramClauseImplication<I>

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