Struct chalk_ir::ProgramClauseImplication

pub struct ProgramClauseImplication<I: Interner> {
    pub consequence: DomainGoal<I>,
    pub conditions: Goals<I>,
    pub constraints: Constraints<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>

The consequence of the clause, which holds if the conditions holds.

conditions: Goals<I>

The condition goals that should hold.

constraints: Constraints<I>

The lifetime constraints that should be proven.

priority: ClausePriority

The relative priority of the implication.

Implementations

impl<I: Interner> ProgramClauseImplication<I>

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

Show debug output for the program clause implication.

impl<I: Interner> ProgramClauseImplication<I>

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

Change the implication into an application holding a FromEnv goal.

Trait Implementations

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

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

pub 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> Fold<I> for ProgramClauseImplication<I>

type Result = ProgramClauseImplication<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).

pub fn fold_with<'i>(
    &self,
    folder: &mut dyn Folder<'i, I>,
    outer_binder: DebruijnIndex
) -> Fallible<Self::Result> where
    I: '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

The interner associated with the type.

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

pub fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

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

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

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

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

pub fn visit_with<'i, B>(
    &self,
    visitor: &mut dyn Visitor<'i, I, BreakTy = B>,
    outer_binder: DebruijnIndex
) -> ControlFlow<B> 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>

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

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