rustc_trait_selection::solve

Struct EvalCtxt

source 
pub struct EvalCtxt<'a, D, I = I>
where
    D: SolverDelegate<Interner = I>,
    I: Interner,
{
    delegate: &'a D,
    variables: <I as Interner>::CanonicalVars,
    is_normalizes_to_goal: bool,
    pub(super) var_values: CanonicalVarValues<I>,
    predefined_opaques_in_body: <I as Interner>::PredefinedOpaques,
    pub(super) max_input_universe: UniverseIndex,
    pub(super) search_graph: &'a mut SearchGraph<SearchGraphDelegate<D>, I>,
    nested_goals: NestedGoals<I>,
    tainted: Result<(), NoSolution>,
    pub(super) inspect: ProofTreeBuilder<D, I>,
}

Fields§

§delegate: &'a D§variables: <I as Interner>::CanonicalVars§is_normalizes_to_goal: bool§var_values: CanonicalVarValues<I>§predefined_opaques_in_body: <I as Interner>::PredefinedOpaques§max_input_universe: UniverseIndex§search_graph: &'a mut SearchGraph<SearchGraphDelegate<D>, I>§nested_goals: NestedGoals<I>§tainted: Result<(), NoSolution>§inspect: ProofTreeBuilder<D, I>

Implementations§

source§

impl<D, I> EvalCtxt<'_, D, I>
where D: SolverDelegate<Interner = I>, I: Interner,

source

pub fn instantiate_normalizes_to_term( &mut self, goal: Goal<I, NormalizesTo<I>>, term: <I as Interner>::Term, )

When normalizing an associated item, constrain the expected term to term.

We know term to always be a fully unconstrained inference variable, so eq should never fail here. However, in case term contains aliases, we emit nested AliasRelate goals to structurally normalize the alias.

Auto Trait Implementations§

§

impl<'a, D, I> Freeze for EvalCtxt<'a, D, I>
where <D as Deref>::Target: Sized, <I as Interner>::CanonicalVars: Freeze, <I as Interner>::PredefinedOpaques: Freeze, <I as Interner>::GenericArgs: Freeze,

§

impl<'a, D, I> RefUnwindSafe for EvalCtxt<'a, D, I>
where <D as Deref>::Target: Sized, <I as Interner>::CanonicalVars: RefUnwindSafe, <I as Interner>::PredefinedOpaques: RefUnwindSafe, D: RefUnwindSafe, <I as Interner>::GenericArgs: RefUnwindSafe, <I as Interner>::ParamEnv: RefUnwindSafe, <I as Interner>::Term: RefUnwindSafe, <I as Interner>::Predicate: RefUnwindSafe, <I as Interner>::DefId: RefUnwindSafe, <I as Interner>::DefiningOpaqueTypes: RefUnwindSafe, <I as Interner>::GenericArg: RefUnwindSafe, <I as Interner>::ExternalConstraints: RefUnwindSafe,

§

impl<'a, D, I> Send for EvalCtxt<'a, D, I>
where <D as Deref>::Target: Sized, <I as Interner>::CanonicalVars: Send, <I as Interner>::PredefinedOpaques: Send, D: Sync + Send, <I as Interner>::GenericArgs: Send, <I as Interner>::DefiningOpaqueTypes: Send, <I as Interner>::ParamEnv: Send, <I as Interner>::Term: Send, <I as Interner>::Predicate: Send, <I as Interner>::DefId: Send, <I as Interner>::ExternalConstraints: Send, <I as Interner>::GenericArg: Send,

§

impl<'a, D, I> Sync for EvalCtxt<'a, D, I>
where <D as Deref>::Target: Sized, <I as Interner>::CanonicalVars: Sync, <I as Interner>::PredefinedOpaques: Sync, D: Sync, <I as Interner>::GenericArgs: Sync, <I as Interner>::ParamEnv: Sync, <I as Interner>::Term: Sync, <I as Interner>::Predicate: Sync, <I as Interner>::DefiningOpaqueTypes: Sync, <I as Interner>::DefId: Sync, <I as Interner>::GenericArg: Sync, <I as Interner>::ExternalConstraints: Sync,

§

impl<'a, D, I> Unpin for EvalCtxt<'a, D, I>
where <D as Deref>::Target: Sized, <I as Interner>::CanonicalVars: Unpin, <I as Interner>::PredefinedOpaques: Unpin, <I as Interner>::GenericArgs: Unpin, D: Unpin, <I as Interner>::ParamEnv: Unpin, <I as Interner>::Term: Unpin, <I as Interner>::Predicate: Unpin, <I as Interner>::DefId: Unpin,

§

impl<'a, D, I = <D as SolverDelegate>::Interner> !UnwindSafe for EvalCtxt<'a, D, I>

Blanket Implementations§

source§

impl<T> Aligned for T

source§

const ALIGN: Alignment = _

Alignment of Self.
source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T, R> CollectAndApply<T, R> for T

source§

fn collect_and_apply<I, F>(iter: I, f: F) -> R
where I: Iterator<Item = T>, F: FnOnce(&[T]) -> R,

Equivalent to f(&iter.collect::<Vec<_>>()).

source§

type Output = R

source§

impl<T> Filterable for T

source§

fn filterable( self, filter_name: &'static str, ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>

Creates a filterable data provider with the given name for debugging. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T> Instrument for T

source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> IntoEither for T

source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
source§

impl<P> IntoQueryParam<P> for P

source§

fn into_query_param(self) -> P

source§

impl<T> MaybeResult<T> for T

source§

type Error = !

source§

fn from(_: Result<T, <T as MaybeResult<T>>::Error>) -> T

source§

fn to_result(self) -> Result<T, <T as MaybeResult<T>>::Error>

source§

impl<T> Same for T

source§

type Output = T

Should always be Self
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

source§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<I, T, U> Upcast<I, U> for T
where U: UpcastFrom<I, T>,

source§

fn upcast(self, interner: I) -> U

source§

impl<I, T> UpcastFrom<I, T> for T

source§

fn upcast_from(from: T, _tcx: I) -> T

source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

source§

fn vzip(self) -> V

source§

impl<Tcx, T> Value<Tcx> for T
where Tcx: DepContext,

source§

default fn from_cycle_error( tcx: Tcx, cycle_error: &CycleError, _guar: ErrorGuaranteed, ) -> T

source§

impl<T> WithSubscriber for T

source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more
source§

impl<'a, T> Captures<'a> for T
where T: ?Sized,

source§

impl<T> ErasedDestructor for T
where T: 'static,

source§

impl<T> MaybeSendSync for T

Layout§

Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.