Enum rustc_infer::traits::solve::GoalSource

source ·

pub enum GoalSource {
    Misc,
    ImplWhereBound,
    InstantiateHigherRanked,
}

Expand description

Why a specific goal has to be proven.

This is necessary as we treat nested goals different depending on their source.

Variants§

§

Misc

§

ImplWhereBound

We’re proving a where-bound of an impl.

FIXME(-Znext-solver=coinductive): Explain how and why this changes whether cycles are coinductive.

This also impacts whether we erase constraints on overflow. Erasing constraints is generally very useful for perf and also results in better error messages by avoiding spurious errors. We do not erase overflow constraints in normalizes-to goals unless they are from an impl where-clause. This is necessary due to backwards compatability, cc trait-system-refactor-initiatitive#70.

§

InstantiateHigherRanked

Instantiating a higher-ranked goal and re-proving it.

Enum rustc_infer::traits::solve::GoalSourceCopy item path

Variants§

Misc

ImplWhereBound

InstantiateHigherRanked

Trait Implementations§

impl Clone for GoalSource

fn clone(&self) -> GoalSource

fn clone_from(&mut self, source: &Self)

impl Debug for GoalSource

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

impl Hash for GoalSource

fn hash<__H>(&self, state: &mut __H)where __H: Hasher,

fn hash_slice<H>(data: &[Self], state: &mut H)where H: Hasher, Self: Sized,

impl<__CTX> HashStable<__CTX> for GoalSource

fn hash_stable( &self, __hcx: &mut __CTX, __hasher: &mut StableHasher<SipHasher128>, )

impl PartialEq for GoalSource

fn eq(&self, other: &GoalSource) -> bool

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

impl<I> TypeFoldable<I> for GoalSourcewhere I: Interner,

fn try_fold_with<F>( self, _: &mut F, ) -> Result<GoalSource, <F as FallibleTypeFolder<I>>::Error>where F: FallibleTypeFolder<I>,

fn fold_with<F>(self, _: &mut F) -> GoalSourcewhere F: TypeFolder<I>,

impl<I> TypeVisitable<I> for GoalSourcewhere I: Interner,

fn visit_with<F>(&self, _: &mut F) -> <F as TypeVisitor<I>>::Resultwhere F: TypeVisitor<I>,

impl Copy for GoalSource

impl Eq for GoalSource

impl StructuralPartialEq for GoalSource

Auto Trait Implementations§

impl Freeze for GoalSource

impl RefUnwindSafe for GoalSource

impl Send for GoalSource

impl Sync for GoalSource

impl Unpin for GoalSource

impl UnwindSafe for GoalSource

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<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere T: Copy,

fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut T

fn allocate_from_iter<'a>( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = T>, ) -> &'a mut [T]

impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere T: Copy,

fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut T

fn allocate_from_iter<'a>( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = T>, ) -> &'a mut [T]

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> CloneToUninit for Twhere T: Clone,

unsafe fn clone_to_uninit(&self, dst: *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<Tcx, T> DepNodeParams<Tcx> for Twhere Tcx: DepContext, T: for<'a> HashStable<StableHashingContext<'a>> + Debug,

default fn fingerprint_style() -> FingerprintStyle

default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint

default fn to_debug_str(&self, _: Tcx) -> String

default fn recover(_: Tcx, _: &DepNode) -> Option<T>

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,

Enum rustc_infer::traits::solve::GoalSource

fn hash<H>(&self, state: &mut H)
where __H: Hasher,

fn hash_slice<H>(data: &[Self], state: &mut H)
where H: Hasher, Self: Sized,

impl<CTX> HashStable<CTX> for GoalSource

fn hash_stable( &self, hcx: &mut CTX, __hasher: &mut StableHasher<SipHasher128>, )

impl<I> TypeFoldable<I> for GoalSource
where I: Interner,

fn try_fold_with<F>( self, _: &mut F, ) -> Result<GoalSource, <F as FallibleTypeFolder<I>>::Error>
where F: FallibleTypeFolder<I>,

fn fold_with<F>(self, _: &mut F) -> GoalSource
where F: TypeFolder<I>,

impl<I> TypeVisitable<I> for GoalSource
where I: Interner,

fn visit_with<F>(&self, _: &mut F) -> <F as TypeVisitor<I>>::Result
where F: TypeVisitor<I>,

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

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

impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for T
where T: Copy,

impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for T
where T: Copy,

impl<T> Borrow<T> for T
where T: ?Sized,

impl<T> BorrowMut<T> for T
where T: ?Sized,

impl<T> CloneToUninit for T
where T: Clone,

fn collect_and_apply<I, F>(iter: I, f: F) -> R
where I: Iterator<Item = T>, F: FnOnce(&[T]) -> R,

impl<Tcx, T> DepNodeParams<Tcx> for T
where Tcx: DepContext, T: for<'a> HashStable<StableHashingContext<'a>> + Debug,

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<'tcx, T> IsSuggestable<'tcx> for T
where T: TypeVisitable<TyCtxt<'tcx>> + TypeFoldable<TyCtxt<'tcx>>,

impl<T> ToOwned for T
where T: Clone,

impl<T, U> TryFrom<U> for T
where U: Into<T>,

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

impl<I, T> TypeVisitableExt<I> for T
where I: Interner, T: TypeVisitable<I>,

impl<I, T, U> Upcast<I, U> for T
where U: UpcastFrom<I, 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,