pub(super) struct Candidate<I: Interner> {
pub(super) source: CandidateSource<I>,
pub(super) result: CanonicalResponse<I>,
}
Expand description
A candidate is a possible way to prove a goal.
It consists of both the source
, which describes how that goal would be proven,
and the result
when using the given source
.
Fields§
§source: CandidateSource<I>
§result: CanonicalResponse<I>
Trait Implementations§
Auto Trait Implementations§
impl<I> Freeze for Candidate<I>where
<I as Interner>::DefId: Freeze,
<I as Interner>::DefiningOpaqueTypes: Freeze,
<I as Interner>::CanonicalVars: Freeze,
<I as Interner>::ExternalConstraints: Freeze,
<I as Interner>::GenericArgs: Freeze,
impl<I> RefUnwindSafe for Candidate<I>where
<I as Interner>::DefId: RefUnwindSafe,
<I as Interner>::DefiningOpaqueTypes: RefUnwindSafe,
<I as Interner>::CanonicalVars: RefUnwindSafe,
<I as Interner>::ExternalConstraints: RefUnwindSafe,
<I as Interner>::GenericArgs: RefUnwindSafe,
impl<I> Send for Candidate<I>where
<I as Interner>::DefId: Send,
<I as Interner>::DefiningOpaqueTypes: Send,
<I as Interner>::CanonicalVars: Send,
<I as Interner>::ExternalConstraints: Send,
<I as Interner>::GenericArgs: Send,
impl<I> Sync for Candidate<I>where
<I as Interner>::DefId: Sync,
<I as Interner>::DefiningOpaqueTypes: Sync,
<I as Interner>::CanonicalVars: Sync,
<I as Interner>::ExternalConstraints: Sync,
<I as Interner>::GenericArgs: Sync,
impl<I> Unpin for Candidate<I>where
<I as Interner>::DefId: Unpin,
<I as Interner>::DefiningOpaqueTypes: Unpin,
<I as Interner>::CanonicalVars: Unpin,
<I as Interner>::ExternalConstraints: Unpin,
<I as Interner>::GenericArgs: Unpin,
impl<I> UnwindSafe for Candidate<I>where
<I as Interner>::DefId: UnwindSafe,
<I as Interner>::DefiningOpaqueTypes: UnwindSafe,
<I as Interner>::CanonicalVars: UnwindSafe,
<I as Interner>::ExternalConstraints: UnwindSafe,
<I as Interner>::GenericArgs: UnwindSafe,
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
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<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>
impl<'a, T> Captures<'a> for Twhere
T: ?Sized,
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.