Struct RegexSet 

pub struct RegexSet { /* private fields */ }

A multi-pattern set: which patterns match the subject at least once (which-matched).

Mirrors the regex crate’s RegexSet. Bitset order is the construction order of the patterns. Captures are not reported — re-run the individual pattern if groups are needed. Stage-1 is N independent walks with per-pattern early-exit (not a fused single-pass automaton).

Implementations

impl RegexSet

pub fn new<I, S>(patterns: I) -> Result<RegexSet, Error>

where I: IntoIterator<Item = S>, S: AsRef<str>,

Compile every pattern; fails if any pattern is invalid (no silent skip).

pub fn with_flags<I, S>(patterns: I, flags: u32) -> Result<RegexSet, Error>

where I: IntoIterator<Item = S>, S: AsRef<str>,

Compile with a real::flags bitmask (same bits as Regex::with_flags).

pub fn len(&self) -> usize

Number of patterns in the set.

pub fn is_empty(&self) -> bool

Whether the set has no patterns.

pub fn patterns(&self) -> &[String]

The original pattern strings (construction order).

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

True if any pattern matches text (stops at the first hit).

pub fn matches(&self, text: &str) -> Vec<bool>

Which patterns match at least once: bitset of length len, construction order. Index i is true iff pattern i matched.

pub fn matched_ids(&self, text: &str) -> Vec<usize>

Indices of matching patterns (ascending, construction order).

Trait Implementations

impl Drop for RegexSet

fn drop(&mut self)

Executes the destructor for this type.

fn pin_drop(self: Pin<&mut Self>)

🔬This is a nightly-only experimental API. (pin_ergonomics)

Execute the destructor for this type, but different to Drop::drop, it requires self to be pinned.

impl Send for RegexSet

impl Sync for RegexSet