Enum rustc_trait_selection::solve::inspect::ProbeStep

source ·

pub enum ProbeStep<'tcx> {
    AddGoal(GoalSource, Canonical<TyCtxt<'tcx>, State<'tcx, Goal<'tcx, Predicate<'tcx>>>>),
    EvaluateGoals(AddedGoalsEvaluation<'tcx>),
    NestedProbe(Probe<'tcx>),
    RecordImplArgs {
        impl_args: Canonical<TyCtxt<'tcx>, State<'tcx, &'tcx RawList<(), GenericArg<'tcx>>>>,
    },
    MakeCanonicalResponse {
        shallow_certainty: Certainty,
    },
}

Variants§

§

AddGoal(GoalSource, Canonical<TyCtxt<'tcx>, State<'tcx, Goal<'tcx, Predicate<'tcx>>>>)

We added a goal to the EvalCtxt which will get proven the next time EvalCtxt::try_evaluate_added_goals is called.

§

EvaluateGoals(AddedGoalsEvaluation<'tcx>)

The inside of a EvalCtxt::try_evaluate_added_goals call.

§

NestedProbe(Probe<'tcx>)

A call to probe while proving the current goal. This is used whenever there are multiple candidates to prove the current goalby .

§

RecordImplArgs

A trait goal was satisfied by an impl candidate.

Fields

§impl_args: Canonical<TyCtxt<'tcx>, State<'tcx, &'tcx RawList<(), GenericArg<'tcx>>>>

§

MakeCanonicalResponse

A call to EvalCtxt::evaluate_added_goals_make_canonical_response with Certainty was made. This is the certainty passed in, so it’s not unified with the certainty of the try_evaluate_added_goals that is done within; if it’s Certainty::Yes, then we can trust that the candidate is “finished” and we didn’t force ambiguity for some reason.

Fields

§shallow_certainty: Certainty

Enum rustc_trait_selection::solve::inspect::ProbeStepCopy item path

Variants§

AddGoal(GoalSource, Canonical<TyCtxt<'tcx>, State<'tcx, Goal<'tcx, Predicate<'tcx>>>>)

EvaluateGoals(AddedGoalsEvaluation<'tcx>)

NestedProbe(Probe<'tcx>)

RecordImplArgs

Fields

MakeCanonicalResponse

Fields

Trait Implementations§

impl<'tcx> PartialEq for ProbeStep<'tcx>

fn eq(&self, other: &ProbeStep<'tcx>) -> bool

fn ne(&self, other: &Rhs) -> bool

impl<'tcx> Eq for ProbeStep<'tcx>

impl<'tcx> StructuralPartialEq for ProbeStep<'tcx>

Auto Trait Implementations§

impl<'tcx> DynSend for ProbeStep<'tcx>

impl<'tcx> DynSync for ProbeStep<'tcx>

impl<'tcx> Freeze for ProbeStep<'tcx>

impl<'tcx> !RefUnwindSafe for ProbeStep<'tcx>

impl<'tcx> Send for ProbeStep<'tcx>

impl<'tcx> Sync for ProbeStep<'tcx>

impl<'tcx> Unpin for ProbeStep<'tcx>

impl<'tcx> !UnwindSafe for ProbeStep<'tcx>

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> AnyEq for Twhere T: Any + PartialEq,

fn equals(&self, other: &(dyn Any + 'static)) -> bool

fn as_any(&self) -> &(dyn Any + 'static)

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<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

fn equivalent(&self, key: &K) -> bool

impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

fn equivalent(&self, key: &K) -> bool

impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

fn equivalent(&self, key: &K) -> bool

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<'tcx, T> ToPredicate<'tcx, T> for T

fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> 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>

Enum rustc_trait_selection::solve::inspect::ProbeStep

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

impl<T> AnyEq for T
where T: Any + PartialEq,

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<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

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<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,