pub(in solve) struct ProbeCtxt<'me, 'a, D, I, F, T>where
D: SolverDelegate<Interner = I>,
I: Interner,{
ecx: &'me mut EvalCtxt<'a, D, I>,
probe_kind: F,
_result: PhantomData<T>,
}Fields§
§ecx: &'me mut EvalCtxt<'a, D, I>§probe_kind: F§_result: PhantomData<T>Implementations§
Source§impl<D, I, F, T> ProbeCtxt<'_, '_, D, I, F, T>where
F: FnOnce(&Result<T, NoSolution>) -> ProbeKind<I>,
D: SolverDelegate<Interner = I>,
I: Interner,
impl<D, I, F, T> ProbeCtxt<'_, '_, D, I, F, T>where
F: FnOnce(&Result<T, NoSolution>) -> ProbeKind<I>,
D: SolverDelegate<Interner = I>,
I: Interner,
pub(in solve) fn enter_single_candidate( self, f: impl FnOnce(&mut EvalCtxt<'_, D>) -> Result<T, NoSolutionOrRerunNonErased>, ) -> (Result<T, NoSolutionOrRerunNonErased>, CandidateHeadUsages)
pub(in solve) fn enter( self, f: impl FnOnce(&mut EvalCtxt<'_, D>) -> Result<T, NoSolutionOrRerunNonErased>, ) -> Result<T, NoSolutionOrRerunNonErased>
pub(in solve) fn enter_without_propagated_nested_goals( self, f: impl FnOnce(&mut EvalCtxt<'_, D>) -> Result<T, NoSolutionOrRerunNonErased>, ) -> Result<T, NoSolutionOrRerunNonErased>
pub(in solve) fn enter_inner( self, f: impl FnOnce(&mut EvalCtxt<'_, D>) -> Result<T, NoSolutionOrRerunNonErased>, propagated_nested_goals: Vec<(GoalSource, Goal<I, I::Predicate>, Option<GoalStalledOn<I>>)>, ) -> Result<T, NoSolutionOrRerunNonErased>
Auto Trait Implementations§
impl<'me, 'a, D, I, F, T> !UnwindSafe for ProbeCtxt<'me, 'a, D, I, F, T>
impl<'me, 'a, D, I, F, T> DynSend for ProbeCtxt<'me, 'a, D, I, F, T>
impl<'me, 'a, D, I, F, T> DynSync for ProbeCtxt<'me, 'a, D, I, F, T>
impl<'me, 'a, D, I, F, T> Freeze for ProbeCtxt<'me, 'a, D, I, F, T>
impl<'me, 'a, D, I, F, T> RefUnwindSafe for ProbeCtxt<'me, 'a, D, I, F, T>
impl<'me, 'a, D, I, F, T> Send for ProbeCtxt<'me, 'a, D, I, F, T>
impl<'me, 'a, D, I, F, T> Sync for ProbeCtxt<'me, 'a, D, I, F, T>
impl<'me, 'a, D, I, F, T> Unpin for ProbeCtxt<'me, 'a, D, I, F, T>
impl<'me, 'a, D, I, F, T> UnsafeUnpin for ProbeCtxt<'me, 'a, D, I, F, T>
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
Mutably borrows from an owned value. Read more
Source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
impl<T> ErasedDestructor for Twhere
T: 'static,
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<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
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 moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
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 moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
Source§impl<I, T> UpcastFrom<I, T> for T
impl<I, T> UpcastFrom<I, T> for T
fn upcast_from(from: T, _tcx: I) -> 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> ⓘ
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.