Struct RegexTableBuilder 

pub struct RegexTableBuilder { /* private fields */ }

Builds the regex table, compiling patterns to sparse DFAs.

Each regex is compiled to a sparse DFA and serialized. The table stores both StringId (for pattern display) and offset into the blob (for DFA access).

Index 0 is unused (regex_id 0 means “no regex”).

Implementations

impl RegexTableBuilder

pub fn new() -> Self

pub fn intern( &mut self, pattern: &str, string_id: StringId, ) -> Result<u16, EmitError>

Intern a regex pattern, compiling it to a DFA.

Takes the pattern string and its StringId. Returns the regex ID on success.

pub fn len(&self) -> usize

Number of regexes (including reserved index 0).

pub fn is_empty(&self) -> bool

Whether the builder has any regexes (beyond reserved index 0).

pub fn validate(&self) -> Result<(), EmitError>

Validate that the regex count fits in u16.

pub fn get(&self, string_id: StringId) -> Option<u16>

Lookup a regex ID by StringId.

pub fn emit(&self) -> (Vec<u8>, Vec<u8>)

Emit the regex blob and table.

Returns (blob_bytes, table_bytes).

Table format per entry: string_id (u16) | reserved (u16) | offset (u32) This allows looking up both the pattern string (via StringTable) and DFA bytes.

Trait Implementations

impl Debug for RegexTableBuilder

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

Formats the value using the given formatter.

impl Default for RegexTableBuilder

fn default() -> RegexTableBuilder

Returns the “default value” for a type.