pub enum CanonicalGoalEvaluationKind<I: Interner> {
Overflow,
Evaluation {
final_revision: Probe<I>,
},
}
Variants§
Trait Implementations§
Source§impl<I> Debug for CanonicalGoalEvaluationKind<I>where
I: Interner,
impl<I> Debug for CanonicalGoalEvaluationKind<I>where
I: Interner,
Source§impl<I> Hash for CanonicalGoalEvaluationKind<I>where
I: Interner,
impl<I> Hash for CanonicalGoalEvaluationKind<I>where
I: Interner,
Source§impl<I> PartialEq for CanonicalGoalEvaluationKind<I>where
I: Interner,
impl<I> PartialEq for CanonicalGoalEvaluationKind<I>where
I: Interner,
impl<I> Eq for CanonicalGoalEvaluationKind<I>where
I: Interner,
Auto Trait Implementations§
impl<I> DynSend for CanonicalGoalEvaluationKind<I>
impl<I> DynSync for CanonicalGoalEvaluationKind<I>
impl<I> Freeze for CanonicalGoalEvaluationKind<I>where
<I as Interner>::CanonicalVars: Freeze,
<I as Interner>::DefId: Freeze,
<I as Interner>::GenericArgs: Freeze,
<I as Interner>::ExternalConstraints: Freeze,
impl<I> RefUnwindSafe for CanonicalGoalEvaluationKind<I>where
<I as Interner>::CanonicalVars: RefUnwindSafe,
<I as Interner>::DefId: RefUnwindSafe,
<I as Interner>::GenericArgs: RefUnwindSafe,
<I as Interner>::ExternalConstraints: RefUnwindSafe,
<I as Interner>::ParamEnv: RefUnwindSafe,
<I as Interner>::Predicate: RefUnwindSafe,
impl<I> Send for CanonicalGoalEvaluationKind<I>
impl<I> Sync for CanonicalGoalEvaluationKind<I>
impl<I> Unpin for CanonicalGoalEvaluationKind<I>
impl<I> UnwindSafe for CanonicalGoalEvaluationKind<I>where
<I as Interner>::CanonicalVars: UnwindSafe,
<I as Interner>::DefId: UnwindSafe,
<I as Interner>::GenericArgs: UnwindSafe,
<I as Interner>::ExternalConstraints: UnwindSafe,
<I as Interner>::ParamEnv: UnwindSafe,
<I as Interner>::Predicate: 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, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.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>
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.