Enum LowerAvailableDepth

Source

pub enum LowerAvailableDepth {
    Yes,
    No,
}

Expand description

Whether evaluating a given goal should be done with a lower available depth from its parent goal.

Normally, it should be Yes, but among rustc’s predicate goals, normalizes-to goals are exceptions. They act like functions that used for normalizing associated terms while evaluating projection goals with fully unconstrained expected term. We don’t want to lower the available depths for those function-like goals, otherwise we will encounter recursion limit overflows more often.

Variants§

§

LowerAvailableDepth

Enum LowerAvailableDepth Copy item path

Variants§

Yes

No

Trait Implementations§

impl Clone for LowerAvailableDepth

fn clone(&self) -> LowerAvailableDepth

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

impl Copy for LowerAvailableDepth

impl Debug for LowerAvailableDepth

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

Auto Trait Implementations§

impl DynSend for LowerAvailableDepth

impl DynSync for LowerAvailableDepth

impl Freeze for LowerAvailableDepth

impl RefUnwindSafe for LowerAvailableDepth

impl Send for LowerAvailableDepth

impl Sync for LowerAvailableDepth

impl Unpin for LowerAvailableDepth

impl UnsafeUnpin for LowerAvailableDepth

impl UnwindSafe for LowerAvailableDepth

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(self, arena: &'tcx Arena<'tcx>) -> &'tcx mut T

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

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

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

fn allocate_from_iter( arena: &'tcx Arena<'tcx>, iter: impl IntoIterator<Item = T>, ) -> &'tcx 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, dest: *mut u8)

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

fn __clone_box(&self, _: Private) -> *mut ()

impl<T> ErasedDestructor for Twhere T: 'static,

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,

impl<K> IntoQueryKey<K> for K

fn into_query_key(self) -> K

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> Pointable for T

const ALIGN: usize

type Init = T

unsafe fn init(init: <T as Pointable>::Init) -> usize

unsafe fn deref<'a>(ptr: usize) -> &'a T

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

unsafe fn drop(ptr: usize)

impl<T> Same for T

type Output = T

impl<T> ToOwned for Twhere T: Clone,

type Owned = T

fn to_owned(&self) -> T

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

Enum LowerAvailableDepth

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

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<T> DynClone for T
where T: Clone,

impl<T> ErasedDestructor for T
where T: 'static,

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

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,