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
impl<I: Interner> ProgramClause<I>
[src]
impl<I: Interner> ProgramClause<I>
[src]pub fn new(interner: &I, clause: ProgramClauseData<I>) -> Self
[src]
pub fn new(interner: &I, clause: ProgramClauseData<I>) -> Self
[src]Create a new program clause using ProgramClauseData
.
pub fn into_from_env_clause(self, interner: &I) -> ProgramClause<I>
[src]
pub fn into_from_env_clause(self, interner: &I) -> ProgramClause<I>
[src]Change the clause into a FromEnv
clause.
pub fn interned(&self) -> &I::InternedProgramClause
[src]
pub fn interned(&self) -> &I::InternedProgramClause
[src]Get the interned program clause.
pub fn data(&self, interner: &I) -> &ProgramClauseData<I>
[src]
pub fn data(&self, interner: &I) -> &ProgramClauseData<I>
[src]Get the program clause data.
Trait Implementations
impl<I: Interner> CastTo<ProgramClause<I>> for ProgramClause<I>
[src]
impl<I: Interner> CastTo<ProgramClause<I>> for ProgramClause<I>
[src]fn cast_to(
self,
_interner: &<ProgramClause<I> as HasInterner>::Interner
) -> ProgramClause<I>
[src]
fn cast_to(
self,
_interner: &<ProgramClause<I> as HasInterner>::Interner
) -> ProgramClause<I>
[src]Cast a value to type T
.
impl<T, I> CastTo<ProgramClause<I>> for T where
T: CastTo<DomainGoal<I>>,
I: Interner,
[src]
impl<T, I> CastTo<ProgramClause<I>> for T where
T: CastTo<DomainGoal<I>>,
I: Interner,
[src]fn cast_to(self, interner: &I) -> ProgramClause<I>
[src]
fn cast_to(self, interner: &I) -> ProgramClause<I>
[src]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>>,
[src]
impl<I, T> CastTo<ProgramClause<I>> for Binders<T> where
I: Interner,
T: HasInterner<Interner = I> + CastTo<DomainGoal<I>>,
[src]fn cast_to(self, interner: &I) -> ProgramClause<I>
[src]
fn cast_to(self, interner: &I) -> ProgramClause<I>
[src]Cast a value to type T
.
impl<I: Clone + Interner> Clone for ProgramClause<I> where
I::InternedProgramClause: Clone,
[src]
impl<I: Clone + Interner> Clone for ProgramClause<I> where
I::InternedProgramClause: Clone,
[src]fn clone(&self) -> ProgramClause<I>
[src]
fn clone(&self) -> ProgramClause<I>
[src]Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]Performs copy-assignment from source
. Read more
impl<I: Interner> CouldMatch<DomainGoal<I>> for ProgramClause<I>
[src]
impl<I: Interner> CouldMatch<DomainGoal<I>> for ProgramClause<I>
[src]fn could_match(
&self,
interner: &I,
db: &dyn UnificationDatabase<I>,
other: &DomainGoal<I>
) -> bool
[src]
fn could_match(
&self,
interner: &I,
db: &dyn UnificationDatabase<I>,
other: &DomainGoal<I>
) -> bool
[src]Checks whether self
and other
could possibly match.
impl<I: Interner> Debug for ProgramClause<I>
[src]
impl<I: Interner> Debug for ProgramClause<I>
[src]impl<I: Interner> Fold<I> for ProgramClause<I>
[src]
impl<I: Interner> Fold<I> for ProgramClause<I>
[src]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
fn fold_with<'i>(
self,
folder: &mut dyn Folder<'i, I>,
outer_binder: DebruijnIndex
) -> Fallible<Self::Result> where
I: 'i,
[src]
fn fold_with<'i>(
self,
folder: &mut dyn Folder<'i, I>,
outer_binder: DebruijnIndex
) -> Fallible<Self::Result> where
I: 'i,
[src]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
impl<I: Interner> HasInterner for ProgramClause<I>
[src]
impl<I: Interner> HasInterner for ProgramClause<I>
[src]type Interner = I
type Interner = I
The interner associated with the type.
impl<I: Hash + Interner> Hash for ProgramClause<I> where
I::InternedProgramClause: Hash,
[src]
impl<I: Hash + Interner> Hash for ProgramClause<I> where
I::InternedProgramClause: Hash,
[src]impl<I: Ord + Interner> Ord for ProgramClause<I> where
I::InternedProgramClause: Ord,
[src]
impl<I: Ord + Interner> Ord for ProgramClause<I> where
I::InternedProgramClause: Ord,
[src]impl<I: PartialEq + Interner> PartialEq<ProgramClause<I>> for ProgramClause<I> where
I::InternedProgramClause: PartialEq,
[src]
impl<I: PartialEq + Interner> PartialEq<ProgramClause<I>> for ProgramClause<I> where
I::InternedProgramClause: PartialEq,
[src]fn eq(&self, other: &ProgramClause<I>) -> bool
[src]
fn eq(&self, other: &ProgramClause<I>) -> bool
[src]This method tests for self
and other
values to be equal, and is used
by ==
. Read more
fn ne(&self, other: &ProgramClause<I>) -> bool
[src]
fn ne(&self, other: &ProgramClause<I>) -> bool
[src]This method tests for !=
.
impl<I: PartialOrd + Interner> PartialOrd<ProgramClause<I>> for ProgramClause<I> where
I::InternedProgramClause: PartialOrd,
[src]
impl<I: PartialOrd + Interner> PartialOrd<ProgramClause<I>> for ProgramClause<I> where
I::InternedProgramClause: PartialOrd,
[src]fn partial_cmp(&self, other: &ProgramClause<I>) -> Option<Ordering>
[src]
fn partial_cmp(&self, other: &ProgramClause<I>) -> Option<Ordering>
[src]This method returns an ordering between self
and other
values if one exists. Read more
#[must_use]fn lt(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]fn lt(&self, other: &Rhs) -> bool
1.0.0[src]This method tests less than (for self
and other
) and is used by the <
operator. Read more
#[must_use]fn le(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]fn le(&self, other: &Rhs) -> bool
1.0.0[src]This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
impl<I: Interner> SuperFold<I> for ProgramClause<I>
[src]
impl<I: Interner> SuperFold<I> for ProgramClause<I>
[src]fn super_fold_with<'i>(
self,
folder: &mut dyn Folder<'i, I>,
outer_binder: DebruijnIndex
) -> Fallible<Self::Result> where
I: 'i,
[src]
fn super_fold_with<'i>(
self,
folder: &mut dyn Folder<'i, I>,
outer_binder: DebruijnIndex
) -> Fallible<Self::Result> where
I: 'i,
[src]Recursively folds the value.
impl<I: Interner> SuperVisit<I> for ProgramClause<I>
[src]
impl<I: Interner> SuperVisit<I> for ProgramClause<I>
[src]fn super_visit_with<'i, B>(
&self,
visitor: &mut dyn Visitor<'i, I, BreakTy = B>,
outer_binder: DebruijnIndex
) -> ControlFlow<B> where
I: 'i,
[src]
fn super_visit_with<'i, B>(
&self,
visitor: &mut dyn Visitor<'i, I, BreakTy = B>,
outer_binder: DebruijnIndex
) -> ControlFlow<B> where
I: 'i,
[src]Recursively visits the type contents.
impl<I: Interner> Visit<I> for ProgramClause<I>
[src]
impl<I: Interner> Visit<I> for ProgramClause<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]
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
impl<I: Interner> Zip<I> for ProgramClause<I>
[src]
impl<I: Interner> Zip<I> for ProgramClause<I>
[src]impl<I: Copy + Interner> Copy for ProgramClause<I> where
I::InternedProgramClause: Copy,
[src]
I::InternedProgramClause: Copy,
impl<I: Eq + Interner> Eq for ProgramClause<I> where
I::InternedProgramClause: Eq,
[src]
I::InternedProgramClause: Eq,
impl<I: Interner> StructuralEq for ProgramClause<I>
[src]
impl<I: Interner> StructuralPartialEq for ProgramClause<I>
[src]
Auto Trait Implementations
impl<I> RefUnwindSafe for ProgramClause<I> where
<I as Interner>::InternedProgramClause: RefUnwindSafe,
<I as Interner>::InternedProgramClause: RefUnwindSafe,
impl<I> Send for ProgramClause<I> where
<I as Interner>::InternedProgramClause: Send,
<I as Interner>::InternedProgramClause: Send,
impl<I> Sync for ProgramClause<I> where
<I as Interner>::InternedProgramClause: Sync,
<I as Interner>::InternedProgramClause: Sync,
impl<I> Unpin for ProgramClause<I> where
<I as Interner>::InternedProgramClause: Unpin,
<I as Interner>::InternedProgramClause: Unpin,
impl<I> UnwindSafe for ProgramClause<I> where
<I as Interner>::InternedProgramClause: UnwindSafe,
<I as Interner>::InternedProgramClause: UnwindSafe,
Blanket Implementations
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]pub fn borrow_mut(&mut self) -> &mut T
[src]
pub fn borrow_mut(&mut self) -> &mut T
[src]Mutably borrows from an owned value. Read more
impl<T> Cast for T
[src]
impl<T> Cast for T
[src]fn cast<U>(self, interner: &U::Interner) -> U where
Self: CastTo<U>,
U: HasInterner,
[src]
fn cast<U>(self, interner: &U::Interner) -> U where
Self: CastTo<U>,
U: HasInterner,
[src]Cast a value to type U
using CastTo
.
impl<T, I> CastTo<ProgramClause<I>> for T where
T: CastTo<DomainGoal<I>>,
I: Interner,
[src]
impl<T, I> CastTo<ProgramClause<I>> for T where
T: CastTo<DomainGoal<I>>,
I: Interner,
[src]pub fn cast_to(Self, &I) -> ProgramClause<I>
[src]
pub fn cast_to(Self, &I) -> ProgramClause<I>
[src]Cast a value to type T
.
impl<T, I> CastTo<ProgramClause<I>> for T where
T: CastTo<DomainGoal<I>>,
I: Interner,
[src]
impl<T, I> CastTo<ProgramClause<I>> for T where
T: CastTo<DomainGoal<I>>,
I: Interner,
[src]pub fn cast_to(Self, &I) -> ProgramClause<I>
[src]
pub fn cast_to(Self, &I) -> ProgramClause<I>
[src]Cast a value to type T
.
impl<T, I> CastTo<ProgramClause<I>> for T where
T: CastTo<DomainGoal<I>>,
I: Interner,
[src]
impl<T, I> CastTo<ProgramClause<I>> for T where
T: CastTo<DomainGoal<I>>,
I: Interner,
[src]pub fn cast_to(Self, &I) -> ProgramClause<I>
[src]
pub fn cast_to(Self, &I) -> ProgramClause<I>
[src]Cast a value to type T
.
impl<T, I> CastTo<ProgramClause<I>> for T where
T: CastTo<DomainGoal<I>>,
I: Interner,
[src]
impl<T, I> CastTo<ProgramClause<I>> for T where
T: CastTo<DomainGoal<I>>,
I: Interner,
[src]pub fn cast_to(Self, &I) -> ProgramClause<I>
[src]
pub fn cast_to(Self, &I) -> ProgramClause<I>
[src]Cast a value to type T
.
impl<T, I> CastTo<ProgramClause<I>> for T where
T: CastTo<DomainGoal<I>>,
I: Interner,
[src]
impl<T, I> CastTo<ProgramClause<I>> for T where
T: CastTo<DomainGoal<I>>,
I: Interner,
[src]pub fn cast_to(Self, &I) -> ProgramClause<I>
[src]
pub fn cast_to(Self, &I) -> ProgramClause<I>
[src]Cast a value to type T
.
impl<T, I> CastTo<ProgramClause<I>> for T where
T: CastTo<DomainGoal<I>>,
I: Interner,
[src]
impl<T, I> CastTo<ProgramClause<I>> for T where
T: CastTo<DomainGoal<I>>,
I: Interner,
[src]pub fn cast_to(Self, &I) -> ProgramClause<I>
[src]
pub fn cast_to(Self, &I) -> ProgramClause<I>
[src]Cast a value to type T
.
impl<T, I> CastTo<ProgramClause<I>> for T where
T: CastTo<DomainGoal<I>>,
I: Interner,
[src]
impl<T, I> CastTo<ProgramClause<I>> for T where
T: CastTo<DomainGoal<I>>,
I: Interner,
[src]pub fn cast_to(Self, &I) -> ProgramClause<I>
[src]
pub fn cast_to(Self, &I) -> ProgramClause<I>
[src]Cast a value to type T
.
impl<T, I> CastTo<ProgramClause<I>> for T where
T: CastTo<DomainGoal<I>>,
I: Interner,
[src]
impl<T, I> CastTo<ProgramClause<I>> for T where
T: CastTo<DomainGoal<I>>,
I: Interner,
[src]pub fn cast_to(Self, &I) -> ProgramClause<I>
[src]
pub fn cast_to(Self, &I) -> ProgramClause<I>
[src]Cast a value to type T
.
impl<T, I> CastTo<ProgramClause<I>> for T where
T: CastTo<DomainGoal<I>>,
I: Interner,
[src]
impl<T, I> CastTo<ProgramClause<I>> for T where
T: CastTo<DomainGoal<I>>,
I: Interner,
[src]pub fn cast_to(Self, &I) -> ProgramClause<I>
[src]
pub fn cast_to(Self, &I) -> ProgramClause<I>
[src]Cast a value to type T
.
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]pub fn could_match(&Self, &I, &dyn UnificationDatabase<I>, &T) -> bool
[src]
pub fn could_match(&Self, &I, &dyn UnificationDatabase<I>, &T) -> bool
[src]Checks whether self
and other
could possibly match.
impl<T, I> Shift<I> for T where
T: Fold<I>,
I: Interner,
[src]
impl<T, I> Shift<I> for T where
T: Fold<I>,
I: Interner,
[src]pub fn shifted_in(Self, &I) -> <T as Fold<I>>::Result
[src]
pub fn shifted_in(Self, &I) -> <T as Fold<I>>::Result
[src]Shifts this term in one level of binders.
pub fn shifted_in_from(Self, &I, DebruijnIndex) -> <T as Fold<I>>::Result
[src]
pub fn shifted_in_from(Self, &I, DebruijnIndex) -> <T as Fold<I>>::Result
[src]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
pub fn shifted_out_to(
Self,
&I,
DebruijnIndex
) -> Result<<T as Fold<I>>::Result, NoSolution>
[src]
pub fn shifted_out_to(
Self,
&I,
DebruijnIndex
) -> Result<<T as Fold<I>>::Result, NoSolution>
[src]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
pub fn shifted_out(Self, &I) -> Result<<T as Fold<I>>::Result, NoSolution>
[src]
pub fn shifted_out(Self, &I) -> Result<<T as Fold<I>>::Result, NoSolution>
[src]Shifts this term out one level of binders.
impl<T> ToOwned for T where
T: Clone,
[src]
impl<T> ToOwned for T where
T: Clone,
[src]type Owned = T
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn to_owned(&self) -> T
[src]Creates owned data from borrowed data, usually by cloning. Read more
pub fn clone_into(&self, target: &mut T)
[src]
pub fn clone_into(&self, target: &mut T)
[src]🔬 This is a nightly-only experimental API. (toowned_clone_into
)
recently added
Uses borrowed data to replace owned data, usually by cloning. Read more