Struct Repeat 

pub struct Repeat {
    pub min: u64,
    pub max: Option<u64>,
}

Repetition bounds, inclusive on both ends.

max of None is unbounded. A sentinel is deliberately avoided: *18446744073709551615 is a legal bound and would collide with one.

Fields

min: u64

Lower bound.

max: Option<u64>

Upper bound, or None for unbounded.

Implementations

impl Repeat

pub const fn exactly(n: u64) -> Self

n<element> — exactly n repetitions.

pub const fn at_least(n: u64) -> Self

n*<element> — at least n repetitions, unbounded above.

pub const fn bounded(min: u64, max: u64) -> Self

min*max<element>.

pub const fn is_unbounded(&self) -> bool

Whether the upper bound is unbounded.

pub const fn is_valid(&self) -> bool

Whether min <= max.

check rejects the inverted case with InvalidRepeatRange (D18); the recognizer may assume this holds.

pub const fn is_never(&self) -> bool

Whether the body can never match, i.e. max == 0.

Such a body contributes no first-graph edges and holds no coverage units (SCOPE.md 6.4, 6.8, D36).

Trait Implementations

impl Clone for Repeat

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Repeat

impl Debug for Repeat

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

Formats the value using the given formatter.

impl Eq for Repeat

impl Hash for Repeat

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for Repeat

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Repeat