Struct chalk_ir::ConstrainedSubst

pub struct ConstrainedSubst<I: Interner> {
    pub subst: Substitution<I>,
    pub constraints: Constraints<I>,
}

Combines a substitution (subst) with a set of region constraints (constraints). This represents the result of a query; the substitution stores the values for the query’s unknown variables, and the constraints represents any region constraints that must additionally be solved.

Fields

subst: Substitution<I>

The substitution that is being constrained.

NB: The is_trivial routine relies on the fact that subst is folded first.

constraints: Constraints<I>

Region constraints that constrain the substitution.

Trait Implementations

impl<I: Clone + Interner> Clone for ConstrainedSubst<I>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<I: Debug + Interner> Debug for ConstrainedSubst<I>

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

Formats the value using the given formatter.

impl<I: Interner> Display for ConstrainedSubst<I>

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

Formats the value using the given formatter.

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

type Interner = I

The interner associated with the type.

impl<I: Hash + Interner> Hash for ConstrainedSubst<I>

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: PartialEq + Interner> PartialEq<ConstrainedSubst<I>> for ConstrainedSubst<I>

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

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

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

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

impl<I: Interner> TypeFoldable<I> for ConstrainedSubst<I>

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.

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.

impl<I: Interner> TypeVisitable<I> for ConstrainedSubst<I>

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: Eq + Interner> Eq for ConstrainedSubst<I>

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

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