Struct RegexBuf 

pub struct RegexBuf<const N: usize = DEFAULT_NODES, const CCL: usize = DEFAULT_CCL, const MEMO: usize = DEFAULT_MEMO> { /* private fields */ }

An owned, compiled regex pattern with compile-time-fixed storage.

• N — node capacity: max compiled pattern symbols.
• CCL — character-class buffer size in bytes.
• MEMO — memo table size in bytes; use (N * DEFAULT_MATCH_TEXT_LEN + 7) / 8.

For the common case use Regex (a type alias for RegexBuf<32, 64, 256>) so you never spell out the parameters. Use RegexBuf directly only when you need non-default sizes.

Created via RegexBuf::new; the pattern can be updated in-place via RegexBuf::recompile. Use find_at and find_iter to search.

A RegexBuf is always valid — construction fails explicitly via None. Each find_at call stack-allocates and zeros a [u8; MEMO] memo table independently, so RegexBuf is Send + Sync without unsafe.

Implementations

impl<const N: usize, const CCL: usize, const MEMO: usize> RegexBuf<N, CCL, MEMO>

pub fn find_at<'a>(&self, haystack: &'a CStr, start: usize) -> Option<Match<'a>>

Search haystack for the first match of this pattern at or after byte offset start.

Returns None if no match is found. Each call stack-allocates a zero-initialised memo table to cache failed (pattern_node, text_offset) states and eliminate exponential backtracking.

pub fn find_iter<'a, 'b>( &'a self, haystack: &'b CStr, ) -> Matches<'a, 'b, N, CCL, MEMO>

Return an iterator over all non-overlapping matches in haystack.

impl<const N: usize, const CCL: usize, const MEMO: usize> RegexBuf<N, CCL, MEMO>

pub fn new(pattern: &CStr) -> Option<RegexBuf<N, CCL, MEMO>>

Compile pattern into a new RegexBuf.

Returns None if pattern is syntactically invalid or exceeds the node capacity N or character-class buffer CCL.

pub fn recompile(self, pattern: &CStr) -> Option<RegexBuf<N, CCL, MEMO>>

Recompile this RegexBuf with a new pattern, reusing existing storage.

Returns Some on success. On failure returns None and self is dropped — the previous compiled pattern is lost.