Skip to main content

EvalCtxt

rustc_trait_selection::solve

Struct EvalCtxt 

Source 
pub struct EvalCtxt<'a, D, I = I>
where
    D: SolverDelegate<Interner = I>,
    I: Interner,
{
    delegate: &'a D,
    var_kinds: <I as Interner>::CanonicalVarKinds,
    current_goal_kind: CurrentGoalKind,
    pub(super) var_values: CanonicalVarValues<I>,
    pub(super) max_input_universe: UniverseIndex,
    pub(super) initial_opaque_types_storage_num_entries: <<D as SolverDelegate>::Infcx as InferCtxtLike>::OpaqueTypeStorageEntries,
    pub(super) search_graph: &'a mut SearchGraph<SearchGraphDelegate<D>, I>,
    nested_goals: Vec<(GoalSource, Goal<I, <I as Interner>::Predicate>, Option<GoalStalledOn<I>>)>,
    pub(super) origin_span: <I as Interner>::Span,
    tainted: Result<(), NoSolution>,
    pub(super) opaque_accesses: AccessedOpaques<I>,
    pub(super) inspect: EvaluationStepBuilder<D, I>,
}

Fields§

§delegate: &'a D§var_kinds: <I as Interner>::CanonicalVarKinds§current_goal_kind: CurrentGoalKind§var_values: CanonicalVarValues<I>§max_input_universe: UniverseIndex§initial_opaque_types_storage_num_entries: <<D as SolverDelegate>::Infcx as InferCtxtLike>::OpaqueTypeStorageEntries§search_graph: &'a mut SearchGraph<SearchGraphDelegate<D>, I>§nested_goals: Vec<(GoalSource, Goal<I, <I as Interner>::Predicate>, Option<GoalStalledOn<I>>)>§origin_span: <I as Interner>::Span§tainted: Result<(), NoSolution>§opaque_accesses: AccessedOpaques<I>§inspect: EvaluationStepBuilder<D, I>

Implementations§

Source§

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

This impl block contains no public items.

Logic for -Zassumptions-on-binders stuff

Source§

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

Source

pub fn push_const_arg_has_type_goal( &mut self, param_env: <I as Interner>::ParamEnv, alias: Alias<I, AliasTermKind<I>>, term: <I as Interner>::Term, ) -> Result<(), NoSolutionOrRerunNonErased>

When normalizing a const alias, register a ConstArgHasType goal to ensure the const value’s type matches the declared type.

Auto Trait Implementations§

§

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

§

impl<'a, D, I> DynSend for EvalCtxt<'a, D, I>
where &'a D: DynSend, <I as Interner>::CanonicalVarKinds: DynSend, CanonicalVarValues<I>: DynSend, <<D as SolverDelegate>::Infcx as InferCtxtLike>::OpaqueTypeStorageEntries: DynSend, &'a mut SearchGraph<SearchGraphDelegate<D>, I>: DynSend, Vec<(GoalSource, Goal<I, <I as Interner>::Predicate>, Option<GoalStalledOn<I>>)>: DynSend, <I as Interner>::Span: DynSend, AccessedOpaques<I>: DynSend, EvaluationStepBuilder<D, I>: DynSend,

§

impl<'a, D, I> DynSync for EvalCtxt<'a, D, I>
where &'a D: DynSync, <I as Interner>::CanonicalVarKinds: DynSync, CanonicalVarValues<I>: DynSync, <<D as SolverDelegate>::Infcx as InferCtxtLike>::OpaqueTypeStorageEntries: DynSync, &'a mut SearchGraph<SearchGraphDelegate<D>, I>: DynSync, Vec<(GoalSource, Goal<I, <I as Interner>::Predicate>, Option<GoalStalledOn<I>>)>: DynSync, <I as Interner>::Span: DynSync, AccessedOpaques<I>: DynSync, EvaluationStepBuilder<D, I>: DynSync,

§

impl<'a, D, I> Freeze for EvalCtxt<'a, D, I>
where &'a D: Freeze, <I as Interner>::CanonicalVarKinds: Freeze, CanonicalVarValues<I>: Freeze, <<D as SolverDelegate>::Infcx as InferCtxtLike>::OpaqueTypeStorageEntries: Freeze, &'a mut SearchGraph<SearchGraphDelegate<D>, I>: Freeze, Vec<(GoalSource, Goal<I, <I as Interner>::Predicate>, Option<GoalStalledOn<I>>)>: Freeze, <I as Interner>::Span: Freeze, AccessedOpaques<I>: Freeze, EvaluationStepBuilder<D, I>: Freeze,

§

impl<'a, D, I> RefUnwindSafe for EvalCtxt<'a, D, I>
where &'a D: RefUnwindSafe, <I as Interner>::CanonicalVarKinds: RefUnwindSafe, CanonicalVarValues<I>: RefUnwindSafe, <<D as SolverDelegate>::Infcx as InferCtxtLike>::OpaqueTypeStorageEntries: RefUnwindSafe, &'a mut SearchGraph<SearchGraphDelegate<D>, I>: RefUnwindSafe, Vec<(GoalSource, Goal<I, <I as Interner>::Predicate>, Option<GoalStalledOn<I>>)>: RefUnwindSafe, <I as Interner>::Span: RefUnwindSafe, AccessedOpaques<I>: RefUnwindSafe, EvaluationStepBuilder<D, I>: RefUnwindSafe,

§

impl<'a, D, I> Send for EvalCtxt<'a, D, I>
where &'a D: Send, <I as Interner>::CanonicalVarKinds: Send, CanonicalVarValues<I>: Send, <<D as SolverDelegate>::Infcx as InferCtxtLike>::OpaqueTypeStorageEntries: Send, &'a mut SearchGraph<SearchGraphDelegate<D>, I>: Send, Vec<(GoalSource, Goal<I, <I as Interner>::Predicate>, Option<GoalStalledOn<I>>)>: Send, <I as Interner>::Span: Send, AccessedOpaques<I>: Send, EvaluationStepBuilder<D, I>: Send,

§

impl<'a, D, I> Sync for EvalCtxt<'a, D, I>
where &'a D: Sync, <I as Interner>::CanonicalVarKinds: Sync, CanonicalVarValues<I>: Sync, <<D as SolverDelegate>::Infcx as InferCtxtLike>::OpaqueTypeStorageEntries: Sync, &'a mut SearchGraph<SearchGraphDelegate<D>, I>: Sync, Vec<(GoalSource, Goal<I, <I as Interner>::Predicate>, Option<GoalStalledOn<I>>)>: Sync, <I as Interner>::Span: Sync, AccessedOpaques<I>: Sync, EvaluationStepBuilder<D, I>: Sync,

§

impl<'a, D, I> Unpin for EvalCtxt<'a, D, I>
where &'a D: Unpin, <I as Interner>::CanonicalVarKinds: Unpin, CanonicalVarValues<I>: Unpin, <<D as SolverDelegate>::Infcx as InferCtxtLike>::OpaqueTypeStorageEntries: Unpin, &'a mut SearchGraph<SearchGraphDelegate<D>, I>: Unpin, Vec<(GoalSource, Goal<I, <I as Interner>::Predicate>, Option<GoalStalledOn<I>>)>: Unpin, <I as Interner>::Span: Unpin, AccessedOpaques<I>: Unpin, EvaluationStepBuilder<D, I>: Unpin,

§

impl<'a, D, I> UnsafeUnpin for EvalCtxt<'a, D, I>
where &'a D: UnsafeUnpin, <I as Interner>::CanonicalVarKinds: UnsafeUnpin, CanonicalVarValues<I>: UnsafeUnpin, <<D as SolverDelegate>::Infcx as InferCtxtLike>::OpaqueTypeStorageEntries: UnsafeUnpin, &'a mut SearchGraph<SearchGraphDelegate<D>, I>: UnsafeUnpin, Vec<(GoalSource, Goal<I, <I as Interner>::Predicate>, Option<GoalStalledOn<I>>)>: UnsafeUnpin, <I as Interner>::Span: UnsafeUnpin, AccessedOpaques<I>: UnsafeUnpin, EvaluationStepBuilder<D, I>: UnsafeUnpin,

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> ErasedDestructor for T
where T: 'static,

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<K> IntoQueryKey<K> for K

Source§

fn into_query_key(self) -> K

Argument conversion from Self to K. This should always be a very cheap conversion, e.g. LocalDefId::to_def_id.
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> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

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

Initializes a with the given initializer. Read more
Source§

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

Dereferences the given pointer. Read more
Source§

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

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
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<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

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.