Struct LexerSpec  
pub struct LexerSpec {
    pub lexemes: Vec<LexemeSpec>,
    pub regex_builder: RegexBuilder,
    pub no_forcing: bool,
    pub allow_initial_skip: bool,
    pub num_extra_lexemes: usize,
    pub skip_by_class: Vec<LexemeIdx>,
    pub current_class: LexemeClass,
    pub special_token_rx: Option<ExprRef>,
    pub has_stop: bool,
    pub has_max_tokens: bool,
    pub has_temperature: bool,
    pub grammar_warnings: Vec<(String, usize)>,
    /* private fields */
}Fields§
§lexemes: Vec<LexemeSpec>§regex_builder: RegexBuilder§no_forcing: bool§allow_initial_skip: bool§num_extra_lexemes: usize§skip_by_class: Vec<LexemeIdx>§current_class: LexemeClass§special_token_rx: Option<ExprRef>§has_stop: bool§has_max_tokens: bool§has_temperature: bool§grammar_warnings: Vec<(String, usize)>Implementations§
§impl LexerSpec
 
impl LexerSpec
pub fn new() -> Result<LexerSpec, Error>
pub fn render_warnings(&self) -> Vec<String>
pub fn can_rollback(&self) -> bool
pub fn check_rollback(&self) -> Result<(), Error>
pub fn has_forced_bytes(&self, lex_spec: &LexemeSpec, bytes: &[u8]) -> bool
pub fn has_forced_bytes(&self, lex_spec: &LexemeSpec, bytes: &[u8]) -> bool
Check if the lexeme always matches bytes.
pub fn setup_lexeme_class( &mut self, skip: RegexAst, ) -> Result<LexemeClass, Error>
pub fn alloc_lexeme_set(&self) -> LexemeSet
pub fn alloc_grammar_set(&self) -> SimpleVob
pub fn lexeme_set(&self, cond: impl Fn(&LexemeSpec) -> bool) -> LexemeSet
pub fn all_lexemes(&self) -> LexemeSet
pub fn lazy_lexemes(&self) -> LexemeSet
pub fn eos_ending_lexemes(&self) -> LexemeSet
pub fn token_range_lexemes(&self, possible: &LexemeSet) -> Vec<&LexemeSpec>
pub fn is_nullable(&self, idx: LexemeIdx) -> bool
pub fn to_regex_vec(&self, limits: &mut ParserLimits) -> Result<RegexVec, Error>
pub fn add_rx_and_stop( &mut self, name: String, body_rx: RegexAst, stop_rx: RegexAst, lazy: bool, max_tokens: usize, is_suffix: bool, ) -> Result<LexemeIdx, Error>
pub fn add_simple_literal( &mut self, name: String, literal: &str, contextual: bool, ) -> Result<LexemeIdx, Error>
pub fn add_special_token( &mut self, name: String, token_ranges: Vec<RangeInclusive<u32>>, ) -> Result<LexemeIdx, Error>
pub fn add_greedy_lexeme( &mut self, name: String, rx: RegexAst, contextual: bool, json_options: Option<JsonQuoteOptions>, max_tokens: usize, ) -> Result<LexemeIdx, Error>
pub fn add_extra_lexemes(&mut self, extra_lexemes: &[String])
pub fn extra_lexeme(&self, idx: usize) -> LexemeIdx
pub fn dbg_lexeme_set(&self, vob: &LexemeSet) -> String
pub fn lexeme_spec(&self, idx: LexemeIdx) -> &LexemeSpec
pub fn cost(&self) -> u64
pub fn skip_id(&self, class: LexemeClass) -> LexemeIdx
pub fn lexeme_def_to_string(&self, idx: LexemeIdx) -> String
pub fn dbg_lexeme_set_ext(&self, vob: &SimpleVob) -> String
Trait Implementations§
Auto Trait Implementations§
impl Freeze for LexerSpec
impl RefUnwindSafe for LexerSpec
impl Send for LexerSpec
impl Sync for LexerSpec
impl Unpin for LexerSpec
impl UnwindSafe for LexerSpec
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.