Struct chalk_ir::Environment
source · pub struct Environment<I: Interner> {
pub clauses: ProgramClauses<I>,
}
Expand description
The set of assumptions we’ve made so far, and the current number of universal (forall) quantifiers we’re within.
Fields§
§clauses: ProgramClauses<I>
The clauses in the environment.
Implementations§
source§impl<I: Interner> Environment<I>
impl<I: Interner> Environment<I>
sourcepub fn add_clauses<II>(&self, interner: I, clauses: II) -> Selfwhere
II: IntoIterator<Item = ProgramClause<I>>,
pub fn add_clauses<II>(&self, interner: I, clauses: II) -> Selfwhere
II: IntoIterator<Item = ProgramClause<I>>,
Adds (an iterator of) clauses to the environment.
sourcepub fn has_compatible_clause(&self, interner: I) -> bool
pub fn has_compatible_clause(&self, interner: I) -> bool
True if any of the clauses in the environment have a consequence of Compatible
.
Panics if the conditions or constraints of that clause are not empty.
Trait Implementations§
source§impl<I: Clone + Interner> Clone for Environment<I>
impl<I: Clone + Interner> Clone for Environment<I>
source§fn clone(&self) -> Environment<I>
fn clone(&self) -> Environment<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> Debug for Environment<I>
impl<I: Interner> Debug for Environment<I>
source§impl<I: Interner> HasInterner for Environment<I>
impl<I: Interner> HasInterner for Environment<I>
source§impl<I: PartialEq + Interner> PartialEq for Environment<I>
impl<I: PartialEq + Interner> PartialEq for Environment<I>
source§fn eq(&self, other: &Environment<I>) -> bool
fn eq(&self, other: &Environment<I>) -> bool
This method tests for
self
and other
values to be equal, and is used
by ==
.source§impl<I: Interner> TypeFoldable<I> for Environment<I>
impl<I: Interner> TypeFoldable<I> for Environment<I>
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> TypeVisitable<I> for Environment<I>
impl<I: Interner> TypeVisitable<I> for Environment<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 Environment<I>
impl<I: Interner> Zip<I> for Environment<I>
impl<I: Interner> Copy for Environment<I>where
I::InternedProgramClauses: Copy,
impl<I: Eq + Interner> Eq for Environment<I>
impl<I: Interner> StructuralPartialEq for Environment<I>
Auto Trait Implementations§
impl<I> Freeze for Environment<I>
impl<I> RefUnwindSafe for Environment<I>
impl<I> Send for Environment<I>
impl<I> Sync for Environment<I>
impl<I> Unpin for Environment<I>
impl<I> UnwindSafe for Environment<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> 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.