Struct RegexConstraint 

pub struct RegexConstraint { /* private fields */ }

Constrains generation to strings that match a regular expression.

Uses a minimal NFA engine (no external crate). Supported syntax:

• Literals, . (any char), *, +, ?
• Alternation |
• Grouping (...)
• Character classes [abc], [a-z], [^x]
• Escapes: \d, \D, \w, \W, \s, \S, \n, \r, \t

Implementations

impl RegexConstraint

pub fn new(pattern: &str) -> Result<Self, ConstraintError>

Build a new constraint from pattern.

pub fn is_match(pattern: &str, text: &str) -> bool

Test whether text fully matches pattern.

pub fn current_partial(&self) -> &str

The text matched so far.

pub fn char_is_valid(&self, ch: char) -> bool

Check whether character ch would keep the NFA in a live (non-dead) state.

Trait Implementations

impl TokenConstraint for RegexConstraint

fn allowed_tokens( &self, _generated: &[u32], vocab_size: usize, ) -> Option<Vec<bool>>

Given the tokens generated so far, return a bitmask of allowed next tokens.

fn advance(&mut self, token: u32) -> bool

Called after a token is committed.

fn is_complete(&self) -> bool

Returns true if the current state is a valid terminal state.

fn reset(&mut self)

Reset the constraint to its initial state.

fn name(&self) -> &str

Human-readable name for debugging and logging.