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

impl<I: Interner, _TI> Fold<I, _TI> for ConstrainedSubst<I> where
    _TI: TargetInterner<I>, 

type Result = ConstrainedSubst<_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 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: &ConstrainedSubst<I>) -> bool

This method tests for !=.

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

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

impl<I: Interner> Visit<I> for ConstrainedSubst<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.