Type Alias Constraints

pub type Constraints = Constraints<Interner>;

Aliased Type

struct Constraints { /* private fields */ }

Implementations

impl<I> Constraints<I>

where I: Interner,

pub fn from_fallible<E>( interner: I, elements: impl IntoIterator<Item = Result<impl CastTo<InEnvironment<Constraint<I>>>, E>>, ) -> Result<Constraints<I>, E>

Tries to create a sequence using an iterator of element-like things.

pub fn from_iter( interner: I, elements: impl IntoIterator<Item = impl CastTo<InEnvironment<Constraint<I>>>>, ) -> Constraints<I>

Create a sequence from elements

pub fn from1( interner: I, element: impl CastTo<InEnvironment<Constraint<I>>>, ) -> Constraints<I>

Create a sequence from a single element.

impl<I> Constraints<I>

where I: Interner,

pub fn interned(&self) -> &<I as Interner>::InternedConstraints

Get the interned elements.

pub fn as_slice(&self, interner: I) -> &[InEnvironment<Constraint<I>>]

Returns a slice containing the elements.

pub fn at(&self, interner: I, index: usize) -> &InEnvironment<Constraint<I>>

Index into the sequence.

pub fn empty(interner: I) -> Constraints<I>

Create an empty sequence.

pub fn is_empty(&self, interner: I) -> bool

Check whether this is an empty sequence.

pub fn iter(&self, interner: I) -> Iter<'_, InEnvironment<Constraint<I>>>

Get an iterator over the elements of the sequence.

pub fn len(&self, interner: I) -> usize

Get the length of the sequence.

Trait Implementations

impl<I> Clone for Constraints<I>

where I: Clone + Interner, <I as Interner>::InternedConstraints: Clone,

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<I> Debug for Constraints<I>

where I: Interner,

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

Formats the value using the given formatter.

impl<I> HasInterner for Constraints<I>

where I: Interner,

type Interner = I

The interner associated with the type.

impl<I> Hash for Constraints<I>

where I: Hash + Interner, <I as Interner>::InternedConstraints: Hash,

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> Ord for Constraints<I>

where I: Ord + Interner, <I as Interner>::InternedConstraints: Ord,

fn cmp(&self, other: &Constraints<I>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<I> PartialEq for Constraints<I>

where I: PartialEq + Interner, <I as Interner>::InternedConstraints: PartialEq,

fn eq(&self, other: &Constraints<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> PartialOrd for Constraints<I>

where I: PartialOrd + Interner, <I as Interner>::InternedConstraints: PartialOrd,

fn partial_cmp(&self, other: &Constraints<I>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<I> TypeFoldable<I> for Constraints<I>

where I: Interner,

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

where I: Interner,

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

where Z: Zipper<I>,

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

impl<I> Copy for Constraints<I>

where I: Copy + Interner, <I as Interner>::InternedConstraints: Copy,

impl<I> Eq for Constraints<I>

where I: Eq + Interner, <I as Interner>::InternedConstraints: Eq,

impl<I> StructuralPartialEq for Constraints<I>

where I: Interner,