Struct Match
pub struct Match<'h> { /* private fields */ }
Represents a single match of a regex in a haystack.
A Match contains both the start and end byte offsets of the match and the
actual substring corresponding to the range of those byte offsets. It is
guaranteed that start <= end. When start == end, the match is empty.
Unlike the top-level Match type, this Match type is produced by APIs
that search &[u8] haystacks. This means that the offsets in a Match can
point to anywhere in the haystack, including in a place that splits the
UTF-8 encoding of a Unicode scalar value.
The lifetime parameter 'h refers to the lifetime of the matched of the
haystack that this match was produced from.
Numbering
The byte offsets in a Match form a half-open interval. That is, the
start of the range is inclusive and the end of the range is exclusive.
For example, given a haystack abcFOOxyz and a match of FOO, its byte
offset range starts at 3 and ends at 6. 3 corresponds to F and
6 corresponds to x, which is one past the end of the match. This
corresponds to the same kind of slicing that Rust uses.
For more on why this was chosen over other schemes (aside from being consistent with how Rust the language works), see this discussion and Dijkstra's note on a related topic.
Example
This example shows the value of each of the methods on Match for a
particular search.
use Regex;
let re = new.unwrap;
let hay = "Greek: αβγδ".as_bytes;
let m = re.find.unwrap;
assert_eq!;
assert_eq!;
assert!;
assert_eq!;
assert_eq!;
assert_eq!;
Implementations
impl<'h> Match<'h>
fn start(&self) -> usizeReturns the byte offset of the start of the match in the haystack. The start of the match corresponds to the position where the match begins and includes the first byte in the match.
It is guaranteed that
Match::start() <= Match::end().Unlike the top-level
Matchtype, the start offset may appear anywhere in the haystack. This includes between the code units of a UTF-8 encoded Unicode scalar value.fn end(&self) -> usizeReturns the byte offset of the end of the match in the haystack. The end of the match corresponds to the byte immediately following the last byte in the match. This means that
&slice[start..end]works as one would expect.It is guaranteed that
Match::start() <= Match::end().Unlike the top-level
Matchtype, the start offset may appear anywhere in the haystack. This includes between the code units of a UTF-8 encoded Unicode scalar value.fn is_empty(&self) -> boolReturns true if and only if this match has a length of zero.
Note that an empty match can only occur when the regex itself can match the empty string. Here are some examples of regexes that can all match the empty string:
^,^$,\b,a?,a*,a{0},(foo|\d+|quux)?.fn len(&self) -> usizeReturns the length, in bytes, of this match.
fn range(&self) -> Range<usize>Returns the range over the starting and ending byte offsets of the match in the haystack.
fn as_bytes(&self) -> &'h [u8]Returns the substring of the haystack that matched.
Trait Implementations
impl<'h> Clone for Match<'h>
fn clone(&self) -> Self
impl<'h> Copy for Match<'h>
impl<'h> Debug for Match<'h>
fn fmt(&self, f: &mut Formatter<'_>) -> Result
impl<'h> Eq for Match<'h>
impl<'h> PartialEq for Match<'h>
fn eq(&self, other: &Self) -> bool
impl<'h> StructuralPartialEq for Match<'h>
Auto Trait Implementations
impl<'h> Freeze for Match<'h>
impl<'h> RefUnwindSafe for Match<'h>
impl<'h> Send for Match<'h>
impl<'h> Sync for Match<'h>
impl<'h> Unpin for Match<'h>
impl<'h> UnsafeUnpin for Match<'h>
impl<'h> UnwindSafe for Match<'h>
Blanket Implementations
impl<T> Any for Match<'h>
where
T: 'static + ?Sized,
fn type_id(&self) -> TypeId
impl<T> Borrow<T> for Match<'h>
where
T: ?Sized,
fn borrow(&self) -> &T
impl<T> BorrowMut<T> for Match<'h>
where
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
impl<T> CloneToUninit for Match<'h>
where
T: Clone,
unsafe fn clone_to_uninit(&self, dest: *mut u8)
impl<T> From<T> for Match<'h>
fn from(t: T) -> TReturns the argument unchanged.
impl<T> ToOwned for Match<'h>
where
T: Clone,
type Owned = T;fn to_owned(&self) -> Tfn clone_into(&self, target: &mut T)
impl<T, U> Into<U> for Match<'h>
where
U: From<T>,
fn into(self) -> UCalls
U::from(self).That is, this conversion is whatever the implementation of
[From]<T> for Uchooses to do.
impl<T, U> TryFrom<U> for Match<'h>
where
U: Into<T>,
type Error = never;fn try_from(value: U) -> Result<T, never>
impl<T, U> TryInto<U> for Match<'h>
where
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error;fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>