Struct chalk_ir::Constraints

pub struct Constraints<I: Interner> { /* fields omitted */ }

List of interned elements.

Implementations

impl<I: Interner> Constraints<I>

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

Get the interned elements.

impl<I: Interner> Constraints<I>

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

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

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

Returns a slice containing the elements.

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

Create a sequence from elements

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

Index into the sequence.

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

Create a sequence from a single element.

pub fn empty(interner: &I) -> Self

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 + Interner> Clone for Constraints<I> where
    I::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: Copy + Interner> Copy for Constraints<I> where
    I::InternedConstraints: Copy, 

impl<I: Interner> Debug for Constraints<I>

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

Formats the value using the given formatter.

impl<I: Eq + Interner> Eq for Constraints<I> where
    I::InternedConstraints: Eq, 

impl<I: Interner, TI: TargetInterner<I>> Fold<I, TI> for Constraints<I>

type Result = Constraints<TI>

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).

fn fold_with<'i>(
    &self,
    folder: &mut dyn Folder<'i, I, TI>,
    outer_binder: DebruijnIndex
) -> Fallible<Self::Result> where
    I: 'i,
    TI: 'i, 

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.

impl<I: Interner> HasInterner for Constraints<I>

type Interner = I

The interner associated with the type.

impl<I: Hash + Interner> Hash for Constraints<I> where
    I::InternedConstraints: Hash, 

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

Feeds this value into the given Hasher.

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

Feeds a slice of this type into the given Hasher.

impl<I: Ord + Interner> Ord for Constraints<I> where
    I::InternedConstraints: Ord, 

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

This method returns an Ordering between self and other.

#[must_use]fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

#[must_use]fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

#[must_use]fn clamp(self, min: Self, max: Self) -> Self

🔬 This is a nightly-only experimental API. (clamp)

Restrict a value to a certain interval.

impl<I: PartialEq + Interner> PartialEq<Constraints<I>> for Constraints<I> where
    I::InternedConstraints: PartialEq, 

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

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Constraints<I>) -> bool

This method tests for !=.

impl<I: PartialOrd + Interner> PartialOrd<Constraints<I>> for Constraints<I> where
    I::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: &Constraints<I>) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Constraints<I>) -> bool

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

fn gt(&self, other: &Constraints<I>) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Constraints<I>) -> bool

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

impl<I: Interner> StructuralEq for Constraints<I>

impl<I: Interner> StructuralPartialEq for Constraints<I>

impl<I: Interner> Visit<I> for Constraints<I>

fn visit_with<'i, R: VisitResult>(
    &self,
    visitor: &mut dyn Visitor<'i, I, Result = R>,
    outer_binder: DebruijnIndex
) -> R where
    I: 'i, 

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: Interner> Zip<I> for Constraints<I>

fn zip_with<'i, Z: Zipper<'i, I>>(
    zipper: &mut Z,
    a: &Self,
    b: &Self
) -> Fallible<()> where
    I: 'i, 

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