Struct chalk_ir::ProgramClause

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

Implementations

impl<I: Interner> ProgramClause<I>

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

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

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

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

Trait Implementations

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

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

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

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

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>

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

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

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

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

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

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

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

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

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

Formats the value using the given formatter.

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

impl<I: Interner, TI: TargetInterner<I>> Fold<I, TI> 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<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 ProgramClause<I>

type Interner = I

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.

#[must_use]fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

#[must_use]fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

#[must_use]fn clamp(self, min: Self, max: Self) -> Self

🔬 This is a nightly-only experimental API. (clamp)

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: &ProgramClause<I>) -> bool

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

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

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

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

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

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

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

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

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

impl<I: Interner, TI: TargetInterner<I>> SuperFold<I, TI> for ProgramClause<I>

fn super_fold_with<'i>(
    &self,
    folder: &mut dyn Folder<'i, I, TI>,
    outer_binder: DebruijnIndex
) -> Fallible<Self::Result> where
    I: 'i,
    TI: 'i, 

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

fn super_visit_with<'i, R: VisitResult>(
    &self,
    visitor: &mut dyn Visitor<'i, I, Result = R>,
    outer_binder: DebruijnIndex
) -> R where
    I: 'i, 

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

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