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
sourceimpl<I: Interner> CastTo<Constraint<I>> for Constraint<I>
impl<I: Interner> CastTo<Constraint<I>> for Constraint<I>
sourcefn 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
.
sourceimpl<I: Clone + Interner> Clone for Constraint<I>
impl<I: Clone + Interner> Clone for Constraint<I>
sourcefn clone(&self) -> Constraint<I>
fn clone(&self) -> Constraint<I>
Returns a copy of the value. Read more
1.0.0 · sourcefn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source
. Read more
sourceimpl<I: Interner> Debug for Constraint<I>
impl<I: Interner> Debug for Constraint<I>
sourceimpl<I: Interner> Fold<I> for Constraint<I>
impl<I: Interner> Fold<I> for Constraint<I>
type Result = Constraint<I>
type Result = Constraint<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
sourcefn fold_with<E>(
self,
folder: &mut dyn Folder<I, Error = E>,
outer_binder: DebruijnIndex
) -> Result<Self::Result, E>
fn fold_with<E>(
self,
folder: &mut dyn Folder<I, Error = E>,
outer_binder: DebruijnIndex
) -> Result<Self::Result, 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. Read more
sourceimpl<I: Interner> HasInterner for Constraint<I>
impl<I: Interner> HasInterner for Constraint<I>
type Interner = I
type Interner = I
The interner associated with the type.
sourceimpl<I: Hash + Interner> Hash for Constraint<I>
impl<I: Hash + Interner> Hash for Constraint<I>
sourceimpl<I: PartialEq + Interner> PartialEq<Constraint<I>> for Constraint<I>
impl<I: PartialEq + Interner> PartialEq<Constraint<I>> for Constraint<I>
sourcefn 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 ==
. Read more
sourcefn ne(&self, other: &Constraint<I>) -> bool
fn ne(&self, other: &Constraint<I>) -> bool
This method tests for !=
.
sourceimpl<I: Interner> Visit<I> for Constraint<I>
impl<I: Interner> Visit<I> for Constraint<I>
sourcefn visit_with<B>(
&self,
visitor: &mut dyn Visitor<I, BreakTy = B>,
outer_binder: DebruijnIndex
) -> ControlFlow<B>
fn visit_with<B>(
&self,
visitor: &mut dyn Visitor<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. Read more
sourceimpl<I: Interner> Zip<I> for Constraint<I>
impl<I: Interner> Zip<I> for Constraint<I>
impl<I: Interner> Copy for Constraint<I> where
I::InternedLifetime: Copy,
I::InternedType: Copy,
impl<I: Eq + Interner> Eq for Constraint<I>
impl<I: Interner> StructuralEq for Constraint<I>
impl<I: Interner> StructuralPartialEq for Constraint<I>
Auto Trait Implementations
impl<I> RefUnwindSafe for Constraint<I> where
<I as Interner>::InternedLifetime: RefUnwindSafe,
<I as Interner>::InternedType: RefUnwindSafe,
impl<I> Send for Constraint<I> where
<I as Interner>::InternedLifetime: Send,
<I as Interner>::InternedType: Send,
impl<I> Sync for Constraint<I> where
<I as Interner>::InternedLifetime: Sync,
<I as Interner>::InternedType: Sync,
impl<I> Unpin for Constraint<I> where
<I as Interner>::InternedLifetime: Unpin,
<I as Interner>::InternedType: Unpin,
impl<I> UnwindSafe for Constraint<I> where
<I as Interner>::InternedLifetime: UnwindSafe,
<I as Interner>::InternedType: UnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceimpl<T> Cast for T
impl<T> Cast for T
sourcefn cast<U>(self, interner: U::Interner) -> U where
Self: CastTo<U>,
U: HasInterner,
fn cast<U>(self, interner: U::Interner) -> U where
Self: CastTo<U>,
U: HasInterner,
Cast a value to type U
using CastTo
.
sourceimpl<T, I> CouldMatch<T> for T where
T: Zip<I> + HasInterner<Interner = I> + ?Sized,
I: Interner,
impl<T, I> CouldMatch<T> for T where
T: Zip<I> + HasInterner<Interner = I> + ?Sized,
I: Interner,
sourcefn 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.
sourceimpl<T, I> Shift<I> for T where
T: Fold<I>,
I: Interner,
impl<T, I> Shift<I> for T where
T: Fold<I>,
I: Interner,
sourcefn shifted_in(self, interner: I) -> <T as Fold<I>>::Result
fn shifted_in(self, interner: I) -> <T as Fold<I>>::Result
Shifts this term in one level of binders.
sourcefn shifted_in_from(
self,
interner: I,
source_binder: DebruijnIndex
) -> <T as Fold<I>>::Result
fn shifted_in_from(
self,
interner: I,
source_binder: DebruijnIndex
) -> <T as Fold<I>>::Result
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
sourcefn shifted_out_to(
self,
interner: I,
target_binder: DebruijnIndex
) -> Result<<T as Fold<I>>::Result, NoSolution>
fn shifted_out_to(
self,
interner: I,
target_binder: DebruijnIndex
) -> Result<<T as Fold<I>>::Result, 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. Read more
sourcefn shifted_out(self, interner: I) -> Result<<T as Fold<I>>::Result, NoSolution>
fn shifted_out(self, interner: I) -> Result<<T as Fold<I>>::Result, NoSolution>
Shifts this term out one level of binders.
sourceimpl<T> ToOwned for T where
T: Clone,
impl<T> ToOwned for T where
T: Clone,
type Owned = T
type Owned = T
The resulting type after obtaining ownership.
sourcefn clone_into(&self, target: &mut T)
fn clone_into(&self, target: &mut T)
toowned_clone_into
)Uses borrowed data to replace owned data, usually by cloning. Read more