Struct MatchRef 

pub struct MatchRef<'c> {
    pub start: usize,
    pub end: usize,
    /* private fields */
}

One match, borrowing the cursor that produced it.

crate::Match owns a share of the pattern’s register names, which costs the two atomics of a clone and a drop and gives every match a destructor to run. Over fifty thousand matches that is 30.2 nanoseconds each, measured against the same loop building matches that bind nothing. A caller that reads each match in turn and keeps none of them pays neither here.

Borrowed from the cursor and not from the input, so a view is invalidated by asking for the next match. MatchRef::to_match takes an owned copy where one is wanted.

Fields

start: usize

Inclusive start byte offset of the match in the input.

end: usize

Exclusive end byte offset of the match in the input.

Implementations

impl<'c> MatchRef<'c>

pub fn span(&self) -> Span

The match’s own span.

pub fn captures(&self) -> &[Span]

The spans this match’s registers bound, in the order Self::names holds their names.

pub fn names(&self) -> &[String]

The register names, in the order Self::captures holds their spans.

pub fn group<'h>(&self, name: &str, input: &'h [u8]) -> Option<&'h [u8]>

The bytes the register called name bound, or None where the pattern has no such register.

pub fn to_match(&self) -> Match

This match as an owned one, which is where the share of the names and the destructor that come with it are paid for.