Struct RegexVec  
pub struct RegexVec { /* private fields */ }Implementations§
§impl RegexVec
 
impl RegexVec
pub fn alpha(&self) -> &AlphabetInfo
pub fn lazy_regexes(&self) -> &LexemeSet
pub fn initial_state(&mut self, selected: &LexemeSet) -> StateID
pub fn initial_state(&mut self, selected: &LexemeSet) -> StateID
Create and return the initial state of a DFA for this regex vector
pub fn state_desc(&self, state: StateID) -> &StateDesc
pub fn possible_lookahead_len(&mut self, state: StateID) -> usize
pub fn lookahead_len_for_state(&mut self, state: StateID) -> Option<usize>
pub fn transition(&mut self, state: StateID, b: u8) -> StateID
pub fn transition(&mut self, state: StateID, b: u8) -> StateID
Given a transition (a from-state and a byte) of the DFA for this regex vector, return the to-state. It is taken from the cache, if it is cached, and created otherwise.
pub fn subsume_possible(&mut self, state: StateID) -> bool
pub fn subsume_possible(&mut self, state: StateID) -> bool
“Subsumption” is a feature implementing regex containment. subsume_possible() returns true if it’s possible for this state, false otherwise.
pub fn check_subsume(
    &mut self,
    state: StateID,
    lexeme_idx: LexemeIdx,
    budget: u64,
) -> Result<bool, Error>
pub fn check_subsume( &mut self, state: StateID, lexeme_idx: LexemeIdx, budget: u64, ) -> Result<bool, Error>
Part of the interface for “subsumption”, a feature implementing regex containment.
pub fn next_byte(&mut self, state: StateID) -> NextByte
pub fn next_byte(&mut self, state: StateID) -> NextByte
Check if the there is only one transition out of state. This is an approximation - see docs for NextByte.
pub fn limit_state_to( &mut self, state: StateID, allowed_lexemes: &LexemeSet, ) -> StateID
pub fn total_fuel_spent(&self) -> u64
pub fn lexeme_weight(&mut self, lexeme_idx: LexemeIdx) -> u32
pub fn set_max_states(&mut self, max_states: usize)
pub fn set_fuel(&mut self, fuel: u64)
pub fn get_fuel(&self) -> u64
pub fn has_error(&self) -> bool
pub fn get_error(&self) -> Option<String>
pub fn stats(&self) -> LexerStats
pub fn print_state_table(&self)
Trait Implementations§
Auto Trait Implementations§
impl Freeze for RegexVec
impl RefUnwindSafe for RegexVec
impl Send for RegexVec
impl Sync for RegexVec
impl Unpin for RegexVec
impl UnwindSafe for RegexVec
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
    T: ?Sized,
 
impl<T> BorrowMut<T> for Twhere
    T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
 
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
    T: Clone,
 
impl<T> CloneToUninit for Twhere
    T: Clone,
§impl<T> Downcast for Twhere
    T: AsAny + ?Sized,
 
impl<T> Downcast for Twhere
    T: AsAny + ?Sized,
§fn downcast_ref<T>(&self) -> Option<&T>where
    T: AsAny,
 
fn downcast_ref<T>(&self) -> Option<&T>where
    T: AsAny,
Forward to the method defined on the type 
Any.§fn downcast_mut<T>(&mut self) -> Option<&mut T>where
    T: AsAny,
 
fn downcast_mut<T>(&mut self) -> Option<&mut T>where
    T: AsAny,
Forward to the method defined on the type 
Any.§impl<T> Instrument for T
 
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
 
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
 
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
 
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
 
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts 
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
 
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts 
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more§impl<F, T> IntoSample<T> for Fwhere
    T: FromSample<F>,
 
impl<F, T> IntoSample<T> for Fwhere
    T: FromSample<F>,
fn into_sample(self) -> T
§impl<T> Pointable for T
 
impl<T> Pointable for T
§impl<T> PolicyExt for Twhere
    T: ?Sized,
 
impl<T> PolicyExt for Twhere
    T: ?Sized,
§impl<SS, SP> SupersetOf<SS> for SPwhere
    SS: SubsetOf<SP>,
 
impl<SS, SP> SupersetOf<SS> for SPwhere
    SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
 
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct 
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
 
fn is_in_subset(&self) -> bool
Checks if 
self is actually part of its subset T (and can be converted to it).§fn to_subset_unchecked(&self) -> SS
 
fn to_subset_unchecked(&self) -> SS
Use with care! Same as 
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
 
fn from_subset(element: &SS) -> SP
The inclusion map: converts 
self to the equivalent element of its superset.