Enum rustc_middle::ty::fast_reject::TreatProjections

source ·

pub enum TreatProjections {
    ForLookup,
    NextSolverLookup,
}

Expand description

During fast-rejection, we have the choice of treating projection types as either simplifiable or not, depending on whether we expect the projection to be normalized/rigid.

Variants§

§

ForLookup

In the old solver we don’t try to normalize projections when looking up impls and only access them by using the current self type. This means that if the self type is a projection which could later be normalized, we must not treat it as rigid.

§

NextSolverLookup

We can treat projections in the self type as opaque as we separately look up impls for the normalized self type.

Enum rustc_middle::ty::fast_reject::TreatProjections

Variants§

ForLookup

NextSolverLookup

Trait Implementations§

impl Clone for TreatProjections

fn clone(&self) -> TreatProjections

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

impl Debug for TreatProjections

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

impl PartialEq<TreatProjections> for TreatProjections

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

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

impl Copy for TreatProjections

impl Eq for TreatProjections

impl StructuralEq for TreatProjections

impl StructuralPartialEq for TreatProjections

Auto Trait Implementations§

impl RefUnwindSafe for TreatProjections

impl Send for TreatProjections

impl Sync for TreatProjections

impl Unpin for TreatProjections

impl UnwindSafe for TreatProjections

Blanket Implementations§

impl<T> Aligned for T

const ALIGN: Alignment = _

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

fn type_id(&self) -> TypeId

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, 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<T> From<T> for T

fn from(t: T) -> T

impl<T, U> Into<U> for Twhere U: From<T>,

fn into(self) -> U

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

type Owned = T

fn to_owned(&self) -> T

fn clone_into(&self, target: &mut 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>

impl<Tcx, T> Value<Tcx> for Twhere Tcx: DepContext,

default fn from_cycle_error( tcx: Tcx, cycle: &[QueryInfo], _guar: ErrorGuaranteed ) -> T

Layout§