Enum chalk_ir::Constraint
source · pub enum Constraint<I: Interner> {
LifetimeOutlives(Lifetime<I>, Lifetime<I>),
TypeOutlives(Ty<I>, Lifetime<I>),
}
Expand description
A constraint on lifetimes.
When we search for solutions within the trait system, we essentially ignore lifetime constraints, instead gathering them up to return with our solution for later checking. This allows for decoupling between type and region checking in the compiler.
Variants§
LifetimeOutlives(Lifetime<I>, Lifetime<I>)
Outlives constraint 'a: 'b
, indicating that the value of 'a
must be
a superset of the value of 'b
.
TypeOutlives(Ty<I>, Lifetime<I>)
Type outlives constraint T: 'a
, indicating that the type T
must live
at least as long as the value of 'a
.
Trait Implementations§
source§impl<I: Interner> CastTo<Constraint<I>> for Constraint<I>
impl<I: Interner> CastTo<Constraint<I>> for Constraint<I>
source§fn cast_to(
self,
_interner: <Constraint<I> as HasInterner>::Interner,
) -> Constraint<I>
fn cast_to( self, _interner: <Constraint<I> as HasInterner>::Interner, ) -> Constraint<I>
Cast a value to type
T
.source§impl<I: Clone + Interner> Clone for Constraint<I>
impl<I: Clone + Interner> Clone for Constraint<I>
source§fn clone(&self) -> Constraint<I>
fn clone(&self) -> Constraint<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 Constraint<I>
impl<I: Interner> Debug for Constraint<I>
source§impl<I: Interner> HasInterner for Constraint<I>
impl<I: Interner> HasInterner for Constraint<I>
source§impl<I: PartialEq + Interner> PartialEq for Constraint<I>
impl<I: PartialEq + Interner> PartialEq for Constraint<I>
source§fn eq(&self, other: &Constraint<I>) -> bool
fn eq(&self, other: &Constraint<I>) -> bool
This method tests for
self
and other
values to be equal, and is used
by ==
.source§impl<I: Interner> TypeFoldable<I> for Constraint<I>
impl<I: Interner> TypeFoldable<I> for Constraint<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 Constraint<I>
impl<I: Interner> TypeVisitable<I> for Constraint<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 Constraint<I>
impl<I: Interner> Zip<I> for Constraint<I>
impl<I: Interner> Copy for Constraint<I>
impl<I: Eq + Interner> Eq for Constraint<I>
impl<I: Interner> StructuralPartialEq for Constraint<I>
Auto Trait Implementations§
impl<I> Freeze for Constraint<I>
impl<I> RefUnwindSafe for Constraint<I>where
<I as Interner>::InternedLifetime: RefUnwindSafe,
<I as Interner>::InternedType: RefUnwindSafe,
impl<I> Send for Constraint<I>
impl<I> Sync for Constraint<I>
impl<I> Unpin for Constraint<I>
impl<I> UnwindSafe for Constraint<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.