Struct rustc_trait_selection::solve::eval_ctxt::NestedGoals
source · pub(super) struct NestedGoals<'tcx> {
pub(super) normalizes_to_hack_goal: Option<Goal<'tcx, NormalizesTo<'tcx>>>,
pub(super) goals: Vec<(GoalSource, Goal<'tcx, Predicate<'tcx>>)>,
}
Fields§
§normalizes_to_hack_goal: Option<Goal<'tcx, NormalizesTo<'tcx>>>
This normalizes-to goal that is 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.
This is not a ‘real’ nested goal. We must not forget to replace the RHS with a fresh inference variable when we evaluate this goal. That can result in a trait solver cycle. This would currently result in overflow but can be can be unsound with more powerful coinduction in the future.
goals: Vec<(GoalSource, Goal<'tcx, Predicate<'tcx>>)>
The rest of the goals which have not yet processed or remain ambiguous.
Implementations§
Trait Implementations§
source§impl<'tcx> Clone for NestedGoals<'tcx>
impl<'tcx> Clone for NestedGoals<'tcx>
source§fn clone(&self) -> NestedGoals<'tcx>
fn clone(&self) -> NestedGoals<'tcx>
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moreAuto Trait Implementations§
impl<'tcx> DynSend for NestedGoals<'tcx>
impl<'tcx> DynSync for NestedGoals<'tcx>
impl<'tcx> Freeze for NestedGoals<'tcx>
impl<'tcx> !RefUnwindSafe for NestedGoals<'tcx>
impl<'tcx> Send for NestedGoals<'tcx>
impl<'tcx> Sync for NestedGoals<'tcx>
impl<'tcx> Unpin for NestedGoals<'tcx>
impl<'tcx> !UnwindSafe for NestedGoals<'tcx>
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
§impl<T> Filterable for T
impl<T> Filterable for T
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<P> IntoQueryParam<P> for P
impl<P> IntoQueryParam<P> for P
fn into_query_param(self) -> P
source§impl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
§impl<T> Pointable for T
impl<T> Pointable for T
source§impl<'tcx, T> ToPredicate<'tcx, T> for T
impl<'tcx, T> ToPredicate<'tcx, T> for T
fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> T
source§impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
default fn from_cycle_error( tcx: Tcx, cycle_error: &CycleError, _guar: ErrorGuaranteed ) -> T
source§impl<T> WithSubscriber for T
impl<T> WithSubscriber for T
source§fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
source§fn with_current_subscriber(self) -> WithDispatch<Self>
fn with_current_subscriber(self) -> WithDispatch<Self>
impl<'a, T> Captures<'a> for Twhere
T: ?Sized,
impl<T> ErasedDestructor for Twhere
T: 'static,
impl<T> MaybeSendSync for T
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: 56 bytes