Struct chalk_ir::ProgramClause [−][src]
pub struct ProgramClause<I: Interner> { /* fields omitted */ }
Expand description
A program clause is a logic expression used to describe a part of the program.
Implementations
Create a new program clause using ProgramClauseData
.
Change the clause into a FromEnv
clause.
Get the interned program clause.
Get the program clause data.
Trait Implementations
Cast a value to type T
.
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>>,
impl<I, T> CastTo<ProgramClause<I>> for Binders<T> where
I: Interner,
T: HasInterner<Interner = I> + CastTo<DomainGoal<I>>,
Cast a value to type T
.
fn could_match(
&self,
interner: &I,
db: &dyn UnificationDatabase<I>,
other: &DomainGoal<I>
) -> bool
fn could_match(
&self,
interner: &I,
db: &dyn UnificationDatabase<I>,
other: &DomainGoal<I>
) -> bool
Checks whether self
and other
could possibly match.
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>
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
). Read more
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. Read more
type Interner = I
type Interner = I
The interner associated with the type.
impl<I: PartialEq + Interner> PartialEq<ProgramClause<I>> for ProgramClause<I> where
I::InternedProgramClause: PartialEq,
impl<I: PartialEq + Interner> PartialEq<ProgramClause<I>> for ProgramClause<I> where
I::InternedProgramClause: PartialEq,
This method tests for self
and other
values to be equal, and is used
by ==
. Read more
This method tests for !=
.
impl<I: PartialOrd + Interner> PartialOrd<ProgramClause<I>> for ProgramClause<I> where
I::InternedProgramClause: PartialOrd,
impl<I: PartialOrd + Interner> PartialOrd<ProgramClause<I>> for ProgramClause<I> where
I::InternedProgramClause: PartialOrd,
This method returns an ordering between self
and other
values if one exists. Read more
This method tests less than (for self
and other
) and is used by the <
operator. Read more
This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
This method tests greater than (for self
and other
) and is used by the >
operator. Read more
fn super_fold_with<'i>(
self,
folder: &mut dyn Folder<'i, I>,
outer_binder: DebruijnIndex
) -> Fallible<Self::Result> where
I: 'i,
fn super_fold_with<'i>(
self,
folder: &mut dyn Folder<'i, I>,
outer_binder: DebruijnIndex
) -> Fallible<Self::Result> where
I: 'i,
Recursively folds the value.
fn super_visit_with<'i, B>(
&self,
visitor: &mut dyn Visitor<'i, I, BreakTy = B>,
outer_binder: DebruijnIndex
) -> ControlFlow<B> where
I: 'i,
fn super_visit_with<'i, B>(
&self,
visitor: &mut dyn Visitor<'i, I, BreakTy = B>,
outer_binder: DebruijnIndex
) -> ControlFlow<B> where
I: 'i,
Recursively visits the type contents.
fn visit_with<'i, B>(
&self,
visitor: &mut dyn Visitor<'i, I, BreakTy = B>,
outer_binder: DebruijnIndex
) -> ControlFlow<B> where
I: 'i,
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. Read more
Auto Trait Implementations
impl<I> RefUnwindSafe for ProgramClause<I> where
<I as Interner>::InternedProgramClause: RefUnwindSafe,
impl<I> Send for ProgramClause<I> where
<I as Interner>::InternedProgramClause: Send,
impl<I> Sync for ProgramClause<I> where
<I as Interner>::InternedProgramClause: Sync,
impl<I> Unpin for ProgramClause<I> where
<I as Interner>::InternedProgramClause: Unpin,
impl<I> UnwindSafe for ProgramClause<I> where
<I as Interner>::InternedProgramClause: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
Cast a value to type U
using CastTo
.
Cast a value to type T
.
Cast a value to type T
.
Cast a value to type T
.
Cast a value to type T
.
Cast a value to type T
.
Cast a value to type T
.
Cast a value to type T
.
Cast a value to type T
.
Cast a value to type T
.
impl<T, I> CouldMatch<T> for T where
T: Zip<I> + HasInterner<Interner = I> + ?Sized,
I: Interner,
impl<T, I> CouldMatch<T> for T where
T: Zip<I> + HasInterner<Interner = I> + ?Sized,
I: Interner,
Checks whether self
and other
could possibly match.
Shifts this term in one level of binders.
Shifts a term valid at outer_binder
so that it is
valid at the innermost binder. See DebruijnIndex::shifted_in_from
for a detailed explanation. Read more
Shifts a term valid at the innermost binder so that it is
valid at outer_binder
. See DebruijnIndex::shifted_out_to
for a detailed explanation. Read more
Shifts this term out one level of binders.