Struct rustc_next_trait_solver::solve::eval_ctxt::NestedGoals

struct NestedGoals<I: Interner> {
    pub normalizes_to_goals: Vec<Goal<I, NormalizesTo<I>>>,
    pub goals: Vec<(GoalSource, Goal<I, I::Predicate>)>,
}

Fields

normalizes_to_goals: Vec<Goal<I, NormalizesTo<I>>>

These normalizes-to goals are treated specially during the evaluation loop. In each iteration we take the RHS of the projection, replace it with a fresh inference variable, and only after evaluating that goal do we equate the fresh inference variable with the actual RHS of the predicate.

This is both to improve caching, and to avoid using the RHS of the projection predicate to influence the normalizes-to candidate we select.

Forgetting to replace the RHS with a fresh inference variable when we evaluate this goal results in an ICE..

goals: Vec<(GoalSource, Goal<I, I::Predicate>)>

The rest of the goals which have not yet processed or remain ambiguous.

Implementations

impl<I: Interner> NestedGoals<I>

fn new() -> Self

fn is_empty(&self) -> bool

Trait Implementations

impl<I> Clone for NestedGoals<I>

where I: Interner,

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<I> Debug for NestedGoals<I>

where I: Interner,

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

Formats the value using the given formatter.

impl<I: Interner, __D: TyDecoder<I = I>> Decodable<__D> for NestedGoals<I>

where Vec<Goal<I, NormalizesTo<I>>>: Decodable<__D>, Vec<(GoalSource, Goal<I, I::Predicate>)>: Decodable<__D>,

fn decode(__decoder: &mut __D) -> Self

impl<I> Default for NestedGoals<I>

where I: Interner,

fn default() -> Self

Returns the “default value” for a type.

impl<I: Interner, __E: TyEncoder<I = I>> Encodable<__E> for NestedGoals<I>

where Vec<Goal<I, NormalizesTo<I>>>: Encodable<__E>, Vec<(GoalSource, Goal<I, I::Predicate>)>: Encodable<__E>,

fn encode(&self, __encoder: &mut __E)

impl<I: Interner, __CTX> HashStable<__CTX> for NestedGoals<I>

where Vec<Goal<I, NormalizesTo<I>>>: HashStable<__CTX>, Vec<(GoalSource, Goal<I, I::Predicate>)>: HashStable<__CTX>,

fn hash_stable(&self, __hcx: &mut __CTX, __hasher: &mut StableHasher)

impl<I, J> Lift<J> for NestedGoals<I>

where I: Interner, J: Interner, Vec<Goal<I, NormalizesTo<I>>>: Lift<J, Lifted = Vec<Goal<J, NormalizesTo<J>>>>, Vec<(GoalSource, Goal<I, I::Predicate>)>: Lift<J, Lifted = Vec<(GoalSource, Goal<J, J::Predicate>)>>,

type Lifted = NestedGoals<J>

fn lift_to_interner(self, interner: J) -> Option<Self::Lifted>

impl<I> TypeFoldable<I> for NestedGoals<I>

where I: Interner, Vec<Goal<I, NormalizesTo<I>>>: TypeFoldable<I>, Vec<(GoalSource, Goal<I, I::Predicate>)>: TypeFoldable<I>,

fn try_fold_with<__F: FallibleTypeFolder<I>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

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 NestedGoals<I>

where I: Interner, Vec<Goal<I, NormalizesTo<I>>>: TypeVisitable<I>, Vec<(GoalSource, Goal<I, I::Predicate>)>: TypeVisitable<I>,

fn visit_with<__V: TypeVisitor<I>>(&self, __visitor: &mut __V) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 48 bytes