Struct chalk_ir::ProgramClause

pub struct ProgramClause<I: Interner> { /* private fields */ }

A program clause is a logic expression used to describe a part of the program.

Implementations

impl<I: Interner> ProgramClause<I>

pub fn new(interner: I, clause: ProgramClauseData<I>) -> Self

Create a new program clause using ProgramClauseData.

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

Change the clause into a FromEnv clause.

pub fn interned(&self) -> &I::InternedProgramClause

Get the interned program clause.

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

Get the program clause data.

Trait Implementations

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

fn cast_to(
    self,
    _interner: <ProgramClause<I> as HasInterner>::Interner
) -> ProgramClause<I>

Cast a value to type T.

impl<T, I> CastTo<ProgramClause<I>> for T where
    T: CastTo<DomainGoal<I>>,
    I: Interner, 

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

Cast a value to type T.

impl<I, T> CastTo<ProgramClause<I>> for Binders<T> where
    I: Interner,
    T: HasInterner<Interner = I> + CastTo<DomainGoal<I>>, 

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

Cast a value to type T.

impl<I: Clone + Interner> Clone for ProgramClause<I> where
    I::InternedProgramClause: Clone, 

fn clone(&self) -> ProgramClause<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 ProgramClause<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 ProgramClause<I>

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

Formats the value using the given formatter.

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

Folding a program clause invokes the fold_program_clause callback on the folder (which will, by default, invoke the super_fold_with method on the program clause).

type Result = ProgramClause<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: Interner> HasInterner for ProgramClause<I>

type Interner = I

The interner associated with the type.

impl<I: Hash + Interner> Hash for ProgramClause<I> where
    I::InternedProgramClause: Hash, 

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: Ord + Interner> Ord for ProgramClause<I> where
    I::InternedProgramClause: Ord, 

fn cmp(&self, other: &ProgramClause<I>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval.

impl<I: PartialEq + Interner> PartialEq<ProgramClause<I>> for ProgramClause<I> where
    I::InternedProgramClause: PartialEq, 

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

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

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

This method tests for !=.

impl<I: PartialOrd + Interner> PartialOrd<ProgramClause<I>> for ProgramClause<I> where
    I::InternedProgramClause: PartialOrd, 

fn partial_cmp(&self, other: &ProgramClause<I>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<I: Interner> SuperFold<I> for ProgramClause<I>

fn super_fold_with<E>(
    self,
    folder: &mut dyn Folder<I, Error = E>,
    outer_binder: DebruijnIndex
) -> Result<Self::Result, E>

Recursively folds the value.

impl<I: Interner> SuperVisit<I> for ProgramClause<I>

fn super_visit_with<B>(
    &self,
    visitor: &mut dyn Visitor<I, BreakTy = B>,
    outer_binder: DebruijnIndex
) -> ControlFlow<B>

Recursively visits the type contents.

impl<I: Interner> Visit<I> for ProgramClause<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 ProgramClause<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: Copy + Interner> Copy for ProgramClause<I> where
    I::InternedProgramClause: Copy, 

impl<I: Eq + Interner> Eq for ProgramClause<I> where
    I::InternedProgramClause: Eq, 

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

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