Struct StateTransTable 

pub struct StateTransTable<S, T> { /* private fields */ }

A state-transition table with symbol type S and tag type T.

Implementations

impl<S, T> StateTransTable<S, T>

pub fn new(dfa: DFA<S, T>) -> Self

where S: Clone + Hash + Eq + Ord + SymbolOp,

Creates a new state-transition table from the given DFA.

pub fn table(&self) -> &[usize]

Returns a reference to the internal transition table, which is a num_equivs * num_states 2d array.

pub fn init_id(&self) -> usize

Returns the ID of the initial state.

pub fn num_states(&self) -> usize

Returns number of states.

pub fn sym_map(&self) -> &BTreeMap<S, (S, usize)>

Returns a reference to the mapping between symbol ranges and equivalence class ID.

The key of the map is the right bound of the range, and the value is (left_bound, equiv_id).

pub fn tags(&self) -> &HashMap<usize, T>

Returns a reference to the mapping between state IDs and tags.

Only the state presents in this map are final states.

pub fn next_state(&self, id: usize, s: &S) -> Option<usize>

where S: Ord,

Returns the ID of the next state after accepting symbol s on the given state.

Returns None if the given state ID is invalid, or the given state can not accept symbol s.

pub fn is_final(&self, id: usize) -> Option<&T>

Checks if the given state ID corresponds to a final state.

Returns [Some(tag)] which tag corresponds to a user-input regular expression, otherwise returns None.

Trait Implementations

impl<S: Debug, T: Debug> Debug for StateTransTable<S, T>

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

Formats the value using the given formatter.

impl<S, T> From<DFA<S, T>> for StateTransTable<S, T>

where S: Clone + Hash + Eq + Ord + SymbolOp,

fn from(dfa: DFA<S, T>) -> Self

Converts to this type from the input type.

impl<S, T> From<RegexMatcher<S, T>> for StateTransTable<S, T>

fn from(matcher: RegexMatcher<S, T>) -> Self

Converts to this type from the input type.