Struct ProcessQueue 

pub struct ProcessQueue { /* private fields */ }

Below this many distinct states the C++ RepeatDetector scans a small vector; above it, it switches to a hash set. We always use a hash set — AHashSet makes the small-N case cheap enough that the dual representation is not worth the complexity. Behavior (which states are reported visited) is identical.

FIFO queue of states awaiting predict/complete, with an attached visited set so a state is enqueued at most once per advance round.

Implementations

impl ProcessQueue

pub fn new() -> Self

An empty queue.

pub fn clear_visited(&mut self)

Clear the visited set (called at the start of each advance). The queue itself is asserted empty by the caller.

pub fn is_visited(&self, state: &ParserState) -> bool

True if state has already been seen this round.

pub fn enqueue(&mut self, state: ParserState) -> bool

Enqueue state for predict/complete unless already visited. Returns true if it was newly enqueued.

pub fn mark_visited(&mut self, state: ParserState) -> bool

Mark state visited without enqueuing it for processing. Returns true if it was newly marked. Mirrors the C++ EnqueueWithoutProcessing visited-set side effect; the caller is responsible for adding the state to the scanable list.

pub fn pop(&mut self) -> Option<ParserState>

Pop the next state to process, or None when drained.

pub fn is_empty(&self) -> bool

True if no states are pending.

Trait Implementations

impl Debug for ProcessQueue

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

Formats the value using the given formatter.

impl Default for ProcessQueue

fn default() -> ProcessQueue

Returns the “default value” for a type.