Struct FixedPointStack

pub struct FixedPointStack<Input, Output> { /* private fields */ }

Implementations

impl<Input, Output> FixedPointStack<Input, Output>

where Input: Value, Output: Value,

pub fn search(&mut self, input: &Input) -> Option<Output>

Search backwards through the stack, looking for the given input.

If it is found, return Some with the current outputs, and mark it as needing fixed point iteration.

If not, return None.

The fixed-point mark is returned when the stack is popped and is used as part of the fixed point algorithm.

pub fn push(&mut self, input: &Input, output: Output)

Push an entry onto the stack, indicating it is currently being evaluated. There must not already be an entry for input.

pub fn update_output(&mut self, input: &Input, output: Output) -> bool

Add outputs to the top-most stack entry, which must be for input. Returns true if another iteration is needed before reaching a fixed point.

pub fn pop(&mut self, input: &Input) -> Output

Pops the top entry from the stack, returning the saved outputs.

Trait Implementations

impl<Input, Output> Default for FixedPointStack<Input, Output>

fn default() -> Self

Returns the “default value” for a type.