Struct chalk_ir::InEnvironment
source · pub struct InEnvironment<G: HasInterner> {
pub environment: Environment<G::Interner>,
pub goal: G,
}
Expand description
A goal with an environment to solve it in.
Fields§
§environment: Environment<G::Interner>
§goal: G
Implementations§
source§impl<G: HasInterner> InEnvironment<G>
impl<G: HasInterner> InEnvironment<G>
sourcepub fn new(environment: &Environment<G::Interner>, goal: G) -> Self
pub fn new(environment: &Environment<G::Interner>, goal: G) -> Self
Creates a new environment/goal pair.
sourcepub fn map<OP, H>(self, op: OP) -> InEnvironment<H>where
OP: FnOnce(G) -> H,
H: HasInterner<Interner = G::Interner>,
pub fn map<OP, H>(self, op: OP) -> InEnvironment<H>where OP: FnOnce(G) -> H, H: HasInterner<Interner = G::Interner>,
Maps the goal without touching the environment.
Trait Implementations§
source§impl<T, U, I> CastTo<InEnvironment<U>> for InEnvironment<T>where
T: HasInterner<Interner = I> + CastTo<U>,
U: HasInterner<Interner = I>,
I: Interner,
impl<T, U, I> CastTo<InEnvironment<U>> for InEnvironment<T>where T: HasInterner<Interner = I> + CastTo<U>, U: HasInterner<Interner = I>, I: Interner,
source§fn cast_to(self, interner: U::Interner) -> InEnvironment<U>
fn cast_to(self, interner: U::Interner) -> InEnvironment<U>
Cast a value to type
T
.source§impl<G: Clone + HasInterner> Clone for InEnvironment<G>where
G::Interner: Clone,
impl<G: Clone + HasInterner> Clone for InEnvironment<G>where G::Interner: Clone,
source§fn clone(&self) -> InEnvironment<G>
fn clone(&self) -> InEnvironment<G>
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<G: Debug + HasInterner> Debug for InEnvironment<G>where
G::Interner: Debug,
impl<G: Debug + HasInterner> Debug for InEnvironment<G>where G::Interner: Debug,
source§impl<G: HasInterner> HasInterner for InEnvironment<G>
impl<G: HasInterner> HasInterner for InEnvironment<G>
§type Interner = <G as HasInterner>::Interner
type Interner = <G as HasInterner>::Interner
The interner associated with the type.
source§impl<G: Hash + HasInterner> Hash for InEnvironment<G>where
G::Interner: Hash,
impl<G: Hash + HasInterner> Hash for InEnvironment<G>where G::Interner: Hash,
source§impl<G: PartialEq + HasInterner> PartialEq<InEnvironment<G>> for InEnvironment<G>where
G::Interner: PartialEq,
impl<G: PartialEq + HasInterner> PartialEq<InEnvironment<G>> for InEnvironment<G>where G::Interner: PartialEq,
source§fn eq(&self, other: &InEnvironment<G>) -> bool
fn eq(&self, other: &InEnvironment<G>) -> bool
This method tests for
self
and other
values to be equal, and is used
by ==
.source§impl<G, _I> TypeFoldable<_I> for InEnvironment<G>where
_I: Interner,
G: HasInterner<Interner = _I> + TypeFoldable<_I> + HasInterner,
impl<G, _I> TypeFoldable<_I> for InEnvironment<G>where _I: Interner, G: HasInterner<Interner = _I> + TypeFoldable<_I> + HasInterner,
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<G, _I> TypeVisitable<_I> for InEnvironment<G>where
_I: Interner,
G: HasInterner<Interner = _I> + TypeVisitable<_I> + HasInterner,
impl<G, _I> TypeVisitable<_I> for InEnvironment<G>where _I: Interner, G: HasInterner<Interner = _I> + TypeVisitable<_I> + HasInterner,
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<T: HasInterner<Interner = I> + Zip<I>, I: Interner> Zip<I> for InEnvironment<T>
impl<T: HasInterner<Interner = I> + Zip<I>, I: Interner> Zip<I> for InEnvironment<T>
impl<G: HasInterner<Interner = I> + Copy, I: Interner> Copy for InEnvironment<G>where I::InternedProgramClauses: Copy,
impl<G: Eq + HasInterner> Eq for InEnvironment<G>where G::Interner: Eq,
impl<G: HasInterner> StructuralEq for InEnvironment<G>
impl<G: HasInterner> StructuralPartialEq for InEnvironment<G>
Auto Trait Implementations§
impl<G> RefUnwindSafe for InEnvironment<G>where G: RefUnwindSafe, <<G as HasInterner>::Interner as Interner>::InternedProgramClauses: RefUnwindSafe,
impl<G> Send for InEnvironment<G>where G: Send, <<G as HasInterner>::Interner as Interner>::InternedProgramClauses: Send,
impl<G> Sync for InEnvironment<G>where G: Sync, <<G as HasInterner>::Interner as Interner>::InternedProgramClauses: Sync,
impl<G> Unpin for InEnvironment<G>where G: Unpin, <<G as HasInterner>::Interner as Interner>::InternedProgramClauses: Unpin,
impl<G> UnwindSafe for InEnvironment<G>where G: UnwindSafe, <<G as HasInterner>::Interner as Interner>::InternedProgramClauses: UnwindSafe,
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> CouldMatch<T> for Twhere
T: Zip<I> + HasInterner<Interner = I> + ?Sized,
I: Interner,
impl<T, I> CouldMatch<T> for Twhere T: Zip<I> + HasInterner<Interner = I> + ?Sized, I: Interner,
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.