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§
Auto Trait Implementations§
impl<X> Freeze for StackEntry<X>
impl<X> RefUnwindSafe for StackEntry<X>
impl<X> Send for StackEntry<X>
impl<X> Sync for StackEntry<X>
impl<X> Unpin for StackEntry<X>
impl<X> UnwindSafe for StackEntry<X>
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
source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
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>
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>
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<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.