Struct StrMatcherSet 

pub struct StrMatcherSet { /* private fields */ }

Available on crate feature strmatch only.

Multi-pattern matcher.

Build-time partition:

• Unanchored Byte / Literal / LiteralSet patterns fold into one shared aho-corasick. One linear scan covers them all – O(M + total_matches).
• Anchored patterns (^foo, bar$, ^baz$) and Regex fall- throughs stay as per-pattern matchers.

The merged AC runs MatchKind::LeftmostLongest – overlapping literals like AKIA vs AKIA1234 resolve to the longer match. Pattern indices survive the merge: SetMatch.pattern_idx always matches the caller’s input order.

Implementations

impl StrMatcherSet

pub fn new<I, S>(patterns: I) -> Result<Self, BuildError>

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

Compile every pattern. Patterns that violate the builder’s min_tier policy with OnBelowMin::Reject fail the build for the entire set – returning the first failing pattern’s error.

Errors

As StrMatcherBuilder::build.

pub fn builder() -> StrMatcherBuilder

Start a builder.

pub fn is_match(&self, hay: &[u8]) -> bool

true if any pattern matches anywhere in the haystack.

pub fn earliest_match(&self, hay: &[u8]) -> Option<SetMatch>

Find the earliest match across all patterns.

Order:

• Lower start wins.
• At the same start, the merged AC applies MatchKind::LeftmostLongest within its literal set, so the longer literal wins among merged patterns (e.g. AKIA1234 over AKIA).
• Across the merge boundary (merged-AC hit vs an individual anchored / regex matcher at the same start), the lower pattern_idx wins – input-order preserved.

pub fn find_iter(&self, hay: &[u8]) -> IntoIter<SetMatch>

Collect every non-overlapping match across all patterns, sorted by (start, pattern_idx).

The merged AC runs MatchKind::LeftmostLongest internally, so when two literals overlap within the merged set, the longer one wins. Across the merge boundary the sort key gives input-order tie-breaking.

When multiple patterns match at the same position, the lower-indexed pattern wins (consistent with the input order). Matches across different patterns may overlap.

pub fn tier_counts(&self) -> [usize; 4]

Per-tier population counts: [Byte, Literal, LiteralSet, Regex]. Useful for operator dashboards / quality gates.

pub fn len(&self) -> usize

Number of patterns in the set.

pub fn is_empty(&self) -> bool

true if the set has no patterns.