Struct chalk_ir::ProgramClause
source · pub struct ProgramClause<I: Interner> {
pub(crate) interned: I::InternedProgramClause,
}
Expand description
A program clause is a logic expression used to describe a part of the program.
Fields§
§interned: I::InternedProgramClause
Implementations§
source§impl<I: Interner> ProgramClause<I>
impl<I: Interner> ProgramClause<I>
sourcepub fn new(interner: I, clause: ProgramClauseData<I>) -> Self
pub fn new(interner: I, clause: ProgramClauseData<I>) -> Self
Create a new program clause using ProgramClauseData
.
sourcepub fn into_from_env_clause(self, interner: I) -> ProgramClause<I>
pub fn into_from_env_clause(self, interner: I) -> ProgramClause<I>
Change the clause into a FromEnv
clause.
sourcepub fn interned(&self) -> &I::InternedProgramClause
pub fn interned(&self) -> &I::InternedProgramClause
Get the interned program clause.
sourcepub fn data(&self, interner: I) -> &ProgramClauseData<I>
pub fn data(&self, interner: I) -> &ProgramClauseData<I>
Get the program clause data.
Trait Implementations§
source§impl<I, T> CastTo<ProgramClause<I>> for Binders<T>
impl<I, T> CastTo<ProgramClause<I>> for Binders<T>
source§fn cast_to(self, interner: I) -> ProgramClause<I>
fn cast_to(self, interner: I) -> ProgramClause<I>
Cast a value to type
T
.source§impl<I: Interner> CastTo<ProgramClause<I>> for ProgramClause<I>
impl<I: Interner> CastTo<ProgramClause<I>> for ProgramClause<I>
source§fn cast_to(
self,
_interner: <ProgramClause<I> as HasInterner>::Interner,
) -> ProgramClause<I>
fn cast_to( self, _interner: <ProgramClause<I> as HasInterner>::Interner, ) -> ProgramClause<I>
Cast a value to type
T
.source§impl<I: Clone + Interner> Clone for ProgramClause<I>where
I::InternedProgramClause: Clone,
impl<I: Clone + Interner> Clone for ProgramClause<I>where
I::InternedProgramClause: Clone,
source§fn clone(&self) -> ProgramClause<I>
fn clone(&self) -> ProgramClause<I>
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl<I: Interner> CouldMatch<DomainGoal<I>> for ProgramClause<I>
impl<I: Interner> CouldMatch<DomainGoal<I>> for ProgramClause<I>
source§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.source§impl<I: Interner> Debug for ProgramClause<I>
impl<I: Interner> Debug for ProgramClause<I>
source§impl<I: Interner> HasInterner for ProgramClause<I>
impl<I: Interner> HasInterner for ProgramClause<I>
source§impl<I: Hash + Interner> Hash for ProgramClause<I>where
I::InternedProgramClause: Hash,
impl<I: Hash + Interner> Hash for ProgramClause<I>where
I::InternedProgramClause: Hash,
source§impl<I: Ord + Interner> Ord for ProgramClause<I>where
I::InternedProgramClause: Ord,
impl<I: Ord + Interner> Ord for ProgramClause<I>where
I::InternedProgramClause: Ord,
source§fn cmp(&self, other: &ProgramClause<I>) -> Ordering
fn cmp(&self, other: &ProgramClause<I>) -> Ordering
1.21.0 · source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the maximum of two values. Read more
source§impl<I: PartialEq + Interner> PartialEq for ProgramClause<I>where
I::InternedProgramClause: PartialEq,
impl<I: PartialEq + Interner> PartialEq for ProgramClause<I>where
I::InternedProgramClause: PartialEq,
source§fn eq(&self, other: &ProgramClause<I>) -> bool
fn eq(&self, other: &ProgramClause<I>) -> bool
This method tests for
self
and other
values to be equal, and is used
by ==
.source§impl<I: PartialOrd + Interner> PartialOrd for ProgramClause<I>where
I::InternedProgramClause: PartialOrd,
impl<I: PartialOrd + Interner> PartialOrd for ProgramClause<I>where
I::InternedProgramClause: PartialOrd,
source§fn partial_cmp(&self, other: &ProgramClause<I>) -> Option<Ordering>
fn partial_cmp(&self, other: &ProgramClause<I>) -> Option<Ordering>
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self
and other
) and is used by the <=
operator. Read moresource§impl<I: Interner> TypeFoldable<I> for ProgramClause<I>
impl<I: Interner> TypeFoldable<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).
source§fn try_fold_with<E>(
self,
folder: &mut dyn FallibleTypeFolder<I, Error = E>,
outer_binder: DebruijnIndex,
) -> Result<Self, E>
fn try_fold_with<E>( self, folder: &mut dyn FallibleTypeFolder<I, Error = E>, outer_binder: DebruijnIndex, ) -> Result<Self, 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.source§fn fold_with(
self,
folder: &mut dyn TypeFolder<I>,
outer_binder: DebruijnIndex,
) -> Self
fn fold_with( self, folder: &mut dyn TypeFolder<I>, outer_binder: DebruijnIndex, ) -> Self
A convenient alternative to
try_fold_with
for use with infallible
folders. Do not override this method, to ensure coherence with
try_fold_with
.source§impl<I: Interner> TypeSuperFoldable<I> for ProgramClause<I>
impl<I: Interner> TypeSuperFoldable<I> for ProgramClause<I>
source§fn try_super_fold_with<E>(
self,
folder: &mut dyn FallibleTypeFolder<I, Error = E>,
outer_binder: DebruijnIndex,
) -> Result<Self, E>
fn try_super_fold_with<E>( self, folder: &mut dyn FallibleTypeFolder<I, Error = E>, outer_binder: DebruijnIndex, ) -> Result<Self, E>
Recursively folds the value.
source§fn super_fold_with(
self,
folder: &mut dyn TypeFolder<I>,
outer_binder: DebruijnIndex,
) -> Self
fn super_fold_with( self, folder: &mut dyn TypeFolder<I>, outer_binder: DebruijnIndex, ) -> Self
A convenient alternative to
try_super_fold_with
for use with
infallible folders. Do not override this method, to ensure coherence
with try_super_fold_with
.source§impl<I: Interner> TypeSuperVisitable<I> for ProgramClause<I>
impl<I: Interner> TypeSuperVisitable<I> for ProgramClause<I>
source§fn super_visit_with<B>(
&self,
visitor: &mut dyn TypeVisitor<I, BreakTy = B>,
outer_binder: DebruijnIndex,
) -> ControlFlow<B>
fn super_visit_with<B>( &self, visitor: &mut dyn TypeVisitor<I, BreakTy = B>, outer_binder: DebruijnIndex, ) -> ControlFlow<B>
Recursively visits the type contents.
source§impl<I: Interner> TypeVisitable<I> for ProgramClause<I>
impl<I: Interner> TypeVisitable<I> for ProgramClause<I>
source§fn visit_with<B>(
&self,
visitor: &mut dyn TypeVisitor<I, BreakTy = B>,
outer_binder: DebruijnIndex,
) -> ControlFlow<B>
fn visit_with<B>( &self, visitor: &mut dyn TypeVisitor<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.source§impl<I: Interner> Zip<I> for ProgramClause<I>
impl<I: Interner> Zip<I> for ProgramClause<I>
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> StructuralPartialEq for ProgramClause<I>
Auto Trait Implementations§
impl<I> Freeze for ProgramClause<I>
impl<I> RefUnwindSafe for ProgramClause<I>
impl<I> Send for ProgramClause<I>
impl<I> Sync for ProgramClause<I>
impl<I> Unpin for ProgramClause<I>
impl<I> UnwindSafe for ProgramClause<I>
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§impl<T, I> CastTo<ProgramClause<I>> for T
impl<T, I> CastTo<ProgramClause<I>> for T
source§fn cast_to(self, interner: I) -> ProgramClause<I>
fn cast_to(self, interner: I) -> ProgramClause<I>
Cast a value to type
T
.source§impl<T> CloneToUninit for Twhere
T: Copy,
impl<T> CloneToUninit for Twhere
T: Copy,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§default unsafe fn clone_to_uninit(&self, dst: *mut T)
default unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)source§impl<T, I> CouldMatch<T> for T
impl<T, I> CouldMatch<T> for T
source§fn could_match(
&self,
interner: I,
db: &dyn UnificationDatabase<I>,
other: &T,
) -> bool
fn could_match( &self, interner: I, db: &dyn UnificationDatabase<I>, other: &T, ) -> bool
Checks whether
self
and other
could possibly match.source§impl<T, I> Shift<I> for Twhere
T: TypeFoldable<I>,
I: Interner,
impl<T, I> Shift<I> for Twhere
T: TypeFoldable<I>,
I: Interner,
source§fn shifted_in(self, interner: I) -> T
fn shifted_in(self, interner: I) -> T
Shifts this term in one level of binders.
source§fn shifted_in_from(self, interner: I, source_binder: DebruijnIndex) -> T
fn shifted_in_from(self, interner: I, source_binder: DebruijnIndex) -> T
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.source§fn shifted_out_to(
self,
interner: I,
target_binder: DebruijnIndex,
) -> Result<T, NoSolution>
fn shifted_out_to( self, interner: I, target_binder: DebruijnIndex, ) -> Result<T, NoSolution>
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.source§fn shifted_out(self, interner: I) -> Result<T, NoSolution>
fn shifted_out(self, interner: I) -> Result<T, NoSolution>
Shifts this term out one level of binders.
source§impl<T, I> VisitExt<I> for Twhere
I: Interner,
T: TypeVisitable<I>,
impl<T, I> VisitExt<I> for Twhere
I: Interner,
T: TypeVisitable<I>,
source§fn has_free_vars(&self, interner: I) -> bool
fn has_free_vars(&self, interner: I) -> bool
Check whether there are free (non-bound) variables.