Enum AmbiguousSubmatchMode

pub enum AmbiguousSubmatchMode {
    Greedy,
}

Variants

Greedy

While not POSIX standard, the greedy method for determining ambiguous submatches is able to be implemented the most efficiently in the general case. This is based on the popular Perl regex rules for ambiguous submatching.

• Quantifiers match as much as possible while allowing the rest to match
• Alternations prioritize the earlier options
• Since it is greedy, the leftmost quantifier/alternations will match first.

Trait Implementations

impl Clone for AmbiguousSubmatchMode

fn clone(&self) -> AmbiguousSubmatchMode

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for AmbiguousSubmatchMode

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

Formats the value using the given formatter.

impl PartialEq for AmbiguousSubmatchMode

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl Copy for AmbiguousSubmatchMode

impl Eq for AmbiguousSubmatchMode

impl StructuralPartialEq for AmbiguousSubmatchMode