Struct regex::bytes::SetMatches

pub struct SetMatches { /* fields omitted */ }

A set of matches returned by a regex set.

Implementations

impl SetMatches

pub fn matched_any(&self) -> bool

Whether this set contains any matches.

pub fn matched(&self, regex_index: usize) -> bool

Whether the regex at the given index matched.

The index for a regex is determined by its insertion order upon the initial construction of a RegexSet, starting at 0.

Panics

If regex_index is greater than or equal to self.len().

pub fn len(&self) -> usize

The total number of regexes in the set that created these matches.

pub fn iter(&self) -> SetMatchesIter<'_>

Returns an iterator over indexes in the regex that matched.

This will always produces matches in ascending order of index, where the index corresponds to the index of the regex that matched with respect to its position when initially building the set.

Trait Implementations

impl Clone for SetMatches

fn clone(&self) -> SetMatches

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for SetMatches

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

Formats the value using the given formatter.

impl IntoIterator for SetMatches

type IntoIter = SetMatchesIntoIter

Which kind of iterator are we turning this into?

type Item = usize

The type of the elements being iterated over.

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a> IntoIterator for &'a SetMatches

type IntoIter = SetMatchesIter<'a>

Which kind of iterator are we turning this into?

type Item = usize

The type of the elements being iterated over.

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.