Struct chalk_ir::ProgramClauseImplication [−][src]
pub struct ProgramClauseImplication<I: Interner> { pub consequence: DomainGoal<I>, pub conditions: Goals<I>, pub constraints: Constraints<I>, pub priority: ClausePriority, }
Expand description
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
Show debug output for the program clause implication.
Change the implication into an application holding a FromEnv
goal.
Trait Implementations
type Result = 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
). 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<ProgramClauseImplication<I>> for ProgramClauseImplication<I>
[src]
impl<I: PartialEq + Interner> PartialEq<ProgramClauseImplication<I>> for ProgramClauseImplication<I>
[src]This method tests for self
and other
values to be equal, and is used
by ==
. Read more
This method tests for !=
.
fn visit_with<'i, B>(
&self,
visitor: &mut dyn Visitor<'i, I, BreakTy = B>,
outer_binder: DebruijnIndex
) -> ControlFlow<B> where
I: 'i,
[src]
fn visit_with<'i, B>(
&self,
visitor: &mut dyn Visitor<'i, I, BreakTy = B>,
outer_binder: DebruijnIndex
) -> ControlFlow<B> where
I: 'i,
[src]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 ProgramClauseImplication<I> where
<I as Interner>::DefId: RefUnwindSafe,
<I as Interner>::InternedConstraints: RefUnwindSafe,
<I as Interner>::InternedGoals: RefUnwindSafe,
<I as Interner>::InternedLifetime: RefUnwindSafe,
<I as Interner>::InternedSubstitution: RefUnwindSafe,
<I as Interner>::InternedType: RefUnwindSafe,
impl<I> Send for ProgramClauseImplication<I> where
<I as Interner>::DefId: Send,
<I as Interner>::InternedConstraints: Send,
<I as Interner>::InternedGoals: Send,
<I as Interner>::InternedLifetime: Send,
<I as Interner>::InternedSubstitution: Send,
<I as Interner>::InternedType: Send,
impl<I> Sync for ProgramClauseImplication<I> where
<I as Interner>::DefId: Sync,
<I as Interner>::InternedConstraints: Sync,
<I as Interner>::InternedGoals: Sync,
<I as Interner>::InternedLifetime: Sync,
<I as Interner>::InternedSubstitution: Sync,
<I as Interner>::InternedType: Sync,
impl<I> Unpin for ProgramClauseImplication<I> where
<I as Interner>::DefId: Unpin,
<I as Interner>::InternedConstraints: Unpin,
<I as Interner>::InternedGoals: Unpin,
<I as Interner>::InternedLifetime: Unpin,
<I as Interner>::InternedSubstitution: Unpin,
<I as Interner>::InternedType: Unpin,
impl<I> UnwindSafe for ProgramClauseImplication<I> where
<I as Interner>::DefId: UnwindSafe,
<I as Interner>::InternedConstraints: UnwindSafe,
<I as Interner>::InternedGoals: UnwindSafe,
<I as Interner>::InternedLifetime: UnwindSafe,
<I as Interner>::InternedSubstitution: UnwindSafe,
<I as Interner>::InternedType: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
Cast a value to type U
using CastTo
.
impl<T, I> CouldMatch<T> for T where
T: Zip<I> + HasInterner<Interner = I> + ?Sized,
I: Interner,
[src]
impl<T, I> CouldMatch<T> for T where
T: Zip<I> + HasInterner<Interner = I> + ?Sized,
I: Interner,
[src]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.