Type Alias Constraint

pub type Constraint = Constraint<Interner>;

Aliased Type

enum Constraint {
    LifetimeOutlives(Lifetime<Interner>, Lifetime<Interner>),
    TypeOutlives(Ty<Interner>, Lifetime<Interner>),
}

Variants

LifetimeOutlives(Lifetime<Interner>, Lifetime<Interner>)

Outlives constraint 'a: 'b, indicating that the value of 'a must be a superset of the value of 'b.

TypeOutlives(Ty<Interner>, Lifetime<Interner>)

Type outlives constraint T: 'a, indicating that the type T must live at least as long as the value of 'a.

Trait Implementations

impl<I> CastTo<Constraint<I>> for Constraint<I>

where I: Interner,

fn cast_to( self, _interner: <Constraint<I> as HasInterner>::Interner, ) -> Constraint<I>

Cast a value to type T.

impl<I> Clone for Constraint<I>

where I: Clone + Interner,

fn clone(&self) -> Constraint<I>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<I> Debug for Constraint<I>

where I: Interner,

fn fmt(&self, fmt: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<I> HasInterner for Constraint<I>

where I: Interner,

type Interner = I

The interner associated with the type.

impl<I> Hash for Constraint<I>

where I: Hash + Interner,

fn hash<__H>(&self, state: &mut __H)

where __H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<I> PartialEq for Constraint<I>

where I: PartialEq + Interner,

fn eq(&self, other: &Constraint<I>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<I> TypeFoldable<I> for Constraint<I>

where I: Interner,

fn try_fold_with<E>( self, folder: &mut dyn FallibleTypeFolder<I, Error = E>, outer_binder: DebruijnIndex, ) -> Result<Constraint<I>, 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.

fn fold_with( self, folder: &mut dyn TypeFolder<I, Error = Infallible>, 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.

impl<I> TypeVisitable<I> for Constraint<I>

where I: Interner,

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.

impl<I> Zip<I> for Constraint<I>

where I: Interner,

fn zip_with<Z>( zipper: &mut Z, variance: Variance, a: &Constraint<I>, b: &Constraint<I>, ) -> Result<(), NoSolution>

where Z: Zipper<I>,

Uses the zipper to walk through two values, ensuring that they match.

impl<I> Copy for Constraint<I>

where I: Interner, <I as Interner>::InternedLifetime: Copy, <I as Interner>::InternedType: Copy,

impl<I> Eq for Constraint<I>

where I: Eq + Interner,

impl<I> StructuralPartialEq for Constraint<I>

where I: Interner,