Struct StackRecognizer

pub struct StackRecognizer<S, R>
where
    S: Copy,
    R: FunctionalRecognizer<S>,
{ /* private fields */ }

Implementations

impl<S, R> StackRecognizer<S, R>

where S: Copy, R: FunctionalRecognizer<S>,

pub fn from(rec: R) -> StackRecognizer<S, R>

pub fn reset(&mut self)

pub fn recognizer(&self) -> &R

pub fn recognizer_mut(&mut self) -> &mut R

Trait Implementations

impl<S, R> Clone for StackRecognizer<S, R>

where S: Clone + Copy, R: Clone + FunctionalRecognizer<S>,

fn clone(&self) -> StackRecognizer<S, R>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<S, R> Debug for StackRecognizer<S, R>

where S: Copy + Debug, R: FunctionalRecognizer<S>,

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

Formats the value using the given formatter.

impl<S, R> Recognizer for StackRecognizer<S, R>

where S: Copy + Debug, R: FunctionalRecognizer<S>,

fn pop_bytes(&mut self, num: usize)

for _ in 0..num { stack.pop() }

fn trie_finished(&mut self)

Called when iteration over the trie is finished Stack has exactly one element then, except when iteration started from non-root node. In that case, the stack may have more than one element, and trie_finished() needs to pop the excessive elements.

fn collapse(&mut self)

“Collapse” the stack so that it consists only of its former top element. X = stack.top(); stack.empty(); stack.push(X)

fn special_allowed(&mut self, tok: SpecialToken) -> bool

check if stack.top() transitions via tok to a viable state

fn get_error(&mut self) -> Option<String>

Check if there are any errors to be reported to the user.

fn try_push_byte(&mut self, byte: u8) -> bool

This combines push_byte and byte_allowed into one function for performance.

fn byte_allowed(&mut self, byte: u8) -> bool

check if stack.top() transitions via byte to a viable state

fn trie_started(&mut self)

Called when iteration over the trie is started