Struct EvalCtxt

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: ::CanonicalVars§is_normalizes_to_goal: bool§var_values: CanonicalVarValues§predefined_opaques_in_body: ::PredefinedOpaques§max_input_universe: UniverseIndex§search_graph: &'a mut SearchGraph<SearchGraphDelegate<D>, I>§nested_goals: NestedGoals§tainted: Result<(), NoSolution>§inspect: ProofTreeBuilder<D, I>

Implementations§

§

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

pub fn instantiate_normalizes_to_term( &mut self, goal: Goal<I, NormalizesTo>, term: ::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> DynSend for EvalCtxt<'a, D, I>
where ::CanonicalVars: DynSend, ::PredefinedOpaques: DynSend, D: DynSync + DynSend, ::GenericArgs: DynSend, ::ParamEnv: DynSend, ::Term: DynSend, ::Predicate: DynSend, ::DefiningOpaqueTypes: DynSend, ::DefId: DynSend, ::GenericArg: DynSend, ::ExternalConstraints: DynSend,

§

impl<'a, D, I> DynSync for EvalCtxt<'a, D, I>
where ::CanonicalVars: DynSync, ::PredefinedOpaques: DynSync, D: DynSync, ::GenericArgs: DynSync, ::ParamEnv: DynSync, ::Term: DynSync, ::Predicate: DynSync, ::DefiningOpaqueTypes: DynSync, ::DefId: DynSync, ::GenericArg: DynSync, ::ExternalConstraints: DynSync,

§

impl<'a, D, I> Freeze for EvalCtxt<'a, D, I>
where ::CanonicalVars: Freeze, ::PredefinedOpaques: Freeze, ::GenericArgs: Freeze,

§

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

§

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

§

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

§

Struct EvalCtxtCopy item path

Fields§

Implementations§

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

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

Auto Trait Implementations§

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

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

Blanket Implementations§

impl<T> Aligned for T

const ALIGN: Alignment = _

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

fn type_id(&self) -> TypeId

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

fn borrow(&self) -> &T

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

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

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

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

type Output = R

impl<T> Filterable for T

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

impl<T> From<T> for T

fn from(t: T) -> T

impl<T> Instrument for T

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

fn in_current_span(self) -> Instrumented<Self>

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

fn into(self) -> U

impl<T> IntoEither for T

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

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

impl<P> IntoQueryParam<P> for P

fn into_query_param(self) -> P

impl<T> MaybeResult<T> for T

type Error = !

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

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

impl<T> Pointable for T

const ALIGN: usize = _

type Init = T

unsafe fn init(init: <T as Pointable>::Init) -> usize

unsafe fn deref<'a>(ptr: usize) -> &'a T

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

unsafe fn drop(ptr: usize)

impl<T> Same for T

type Output = T

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

type Error = Infallible

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

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

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

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

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

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

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

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

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

fn vzip(self) -> V

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

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

impl<T> WithSubscriber for T

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

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 Twhere T: Send + Sync,

Layout§

Struct EvalCtxt

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

impl<T> MaybeSendSync for T
where T: Send + Sync,