Struct chalk_engine::stack::Stack

pub(crate) struct Stack<I: Interner> {
    stack: Vec<StackEntry<I>>,
}

See Forest.

Fields

stack: Vec<StackEntry<I>>

Stack: as described above, stores the in-progress goals.

Implementations

impl<I: Interner> Stack<I>

pub(crate) fn debug_with<'a>(
    &'a self,
    tables: &'a Tables<I>
) -> StackDebug<'_, I>

impl<I: Interner> Stack<I>

pub(crate) fn is_empty(&self) -> bool

pub(crate) fn is_active(&self, table: TableIndex) -> Option<StackIndex>

Searches the stack to see if table is active. If so, returns its stack index.

pub(crate) fn top_of_stack_from(&self, depth: StackIndex) -> Range<StackIndex>

pub(crate) fn push(
    &mut self,
    table: TableIndex,
    cyclic_minimums: Minimums,
    clock: TimeStamp
) -> StackIndex

fn pop_and_adjust_depth(&mut self) -> bool

Pops the top-most entry from the stack:

• If the stack is now empty, returns false.
• Otherwise, returns true.

pub(crate) fn pop_and_take_caller_strand(
    &mut self
) -> Option<Canonical<Strand<I>>>

Pops the top-most entry from the stack, which should have the depth *depth:

• If the stack is now empty, returns None.
• Otherwise, takes the active strand from the new top and returns it.

pub(crate) fn pop_and_borrow_caller_strand(
    &mut self
) -> Option<&mut Canonical<Strand<I>>>

Pops the top-most entry from the stack, which should have the depth *depth:

• If the stack is now empty, returns None.
• Otherwise, borrows the active strand (mutably) from the new top and returns it.

pub(crate) fn top(&mut self) -> &mut StackEntry<I>

Trait Implementations

impl<I: Debug + Interner> Debug for Stack<I>

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

Formats the value using the given formatter.

impl<I: Interner> Default for Stack<I>

fn default() -> Self

Returns the “default value” for a type.

impl<I: Interner> Index<StackIndex> for Stack<I>

type Output = StackEntry<I>

The returned type after indexing.

fn index(&self, index: StackIndex) -> &StackEntry<I>

Performs the indexing (container[index]) operation.

impl<I: Interner> IndexMut<StackIndex> for Stack<I>

fn index_mut(&mut self, index: StackIndex) -> &mut StackEntry<I>

Performs the mutable indexing (container[index]) operation.