Struct regex_syntax::hir::Repetition

pub struct Repetition {
    pub kind: RepetitionKind,
    pub greedy: bool,
    pub hir: Box<Hir>,
}

The high-level intermediate representation of a repetition operator.

A repetition operator permits the repetition of an arbitrary sub-expression.

Fields

kind: RepetitionKind

The kind of this repetition operator.

greedy: bool

Whether this repetition operator is greedy or not. A greedy operator will match as much as it can. A non-greedy operator will match as little as it can.

Typically, operators are greedy by default and are only non-greedy when a ? suffix is used, e.g., (expr)* is greedy while (expr)*? is not. However, this can be inverted via the U “ungreedy” flag.

hir: Box<Hir>

The expression being repeated.

Implementations

impl Repetition

pub fn is_match_empty(&self) -> bool

Returns true if and only if this repetition operator makes it possible to match the empty string.

Note that this is not defined inductively. For example, while a* will report true, ()+ will not, even though () matches the empty string and one or more occurrences of something that matches the empty string will always match the empty string. In order to get the inductive definition, see the corresponding method on Hir.

Trait Implementations

impl Clone for Repetition

fn clone(&self) -> Repetition

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Repetition

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

Formats the value using the given formatter.

impl PartialEq<Repetition> for Repetition

fn eq(&self, other: &Repetition) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for Repetition

impl StructuralEq for Repetition

impl StructuralPartialEq for Repetition