rustc_type_ir::search_graph

Struct StackEntry

Source 
struct StackEntry<X: Cx> {
    input: X::Input,
    available_depth: AvailableDepth,
    reached_depth: StackDepth,
    heads: CycleHeads,
    encountered_overflow: bool,
    has_been_used: Option<UsageKind>,
    nested_goals: NestedGoals<X>,
    provisional_result: Option<X::Result>,
}
Expand description

Stack entries of the evaluation stack. Its fields tend to be lazily when popping a child goal or completely immutable.

Fields§

§input: X::Input§available_depth: AvailableDepth

The available depth of a given goal, immutable.

§reached_depth: StackDepth

The maximum depth reached by this stack entry, only up-to date for the top of the stack and lazily updated for the rest.

§heads: CycleHeads

All cycle heads this goal depends on. Lazily updated and only up-to date for the top of the stack.

§encountered_overflow: bool

Whether evaluating this goal encountered overflow. Lazily updated.

§has_been_used: Option<UsageKind>

Whether this goal has been used as the root of a cycle. This gets eagerly updated when encountering a cycle.

§nested_goals: NestedGoals<X>

The nested goals of this goal, see the doc comment of the type.

§provisional_result: Option<X::Result>

Starts out as None and gets set when rerunning this goal in case we encounter a cycle.

Trait Implementations§

Source§

impl<X> Debug for StackEntry<X>
where X: Cx,

Source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<X> DynSend for StackEntry<X>
where <X as Cx>::Input: DynSend, <X as Cx>::Result: DynSend,

§

impl<X> DynSync for StackEntry<X>
where <X as Cx>::Input: DynSync, <X as Cx>::Result: DynSync,

§

impl<X> Freeze for StackEntry<X>
where <X as Cx>::Input: Freeze, <X as Cx>::Result: Freeze,

§

impl<X> RefUnwindSafe for StackEntry<X>
where <X as Cx>::Input: RefUnwindSafe, <X as Cx>::Result: RefUnwindSafe,

§

impl<X> Send for StackEntry<X>
where <X as Cx>::Input: Send, <X as Cx>::Result: Send,

§

impl<X> Sync for StackEntry<X>
where <X as Cx>::Input: Sync, <X as Cx>::Result: Sync,

§

impl<X> Unpin for StackEntry<X>
where <X as Cx>::Input: Unpin, <X as Cx>::Result: Unpin,

§

impl<X> UnwindSafe for StackEntry<X>
where <X as Cx>::Input: UnwindSafe, <X as Cx>::Result: UnwindSafe,

Blanket Implementations§

Source§

impl<T> Aligned for T

Source§

const ALIGN: Alignment

Alignment of Self.
Source§

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

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

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

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

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

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T, R> CollectAndApply<T, R> for T

Source§

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

Equivalent to f(&iter.collect::<Vec<_>>()).

Source§

type Output = R

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T> Instrument for T

Source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
Source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
Source§

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

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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 more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

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

Initializes a with the given initializer. Read more
Source§

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

Dereferences the given pointer. Read more
Source§

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

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

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

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

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

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<I, T, U> Upcast<I, U> for T
where U: UpcastFrom<I, T>,

Source§

fn upcast(self, interner: I) -> U

Source§

impl<I, T> UpcastFrom<I, T> for T

Source§

fn upcast_from(from: T, _tcx: I) -> T

Source§

impl<T> WithSubscriber for T

Source§

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

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

impl<'a, T> Captures<'a> for T
where 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.