Struct Match
pub struct Match<'h> { /* private fields */ }
dep_regex_lite
only.Expand description
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.
Since this Match
can only be produced by the top-level Regex
APIs
that only support searching UTF-8 encoded strings, the byte offsets for a
Match
are guaranteed to fall on valid UTF-8 codepoint boundaries. That
is, slicing a &str
with Match::range
is guaranteed to never panic.
Values with this type are created by Regex::find
or
Regex::find_iter
. Other APIs can create Match
values too. For
example, Captures::get
.
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_lite::Regex;
let re = Regex::new(r"\d+").unwrap();
let hay = "numbers: 1234";
let m = re.find(hay).unwrap();
assert_eq!(9, m.start());
assert_eq!(13, m.end());
assert!(!m.is_empty());
assert_eq!(4, m.len());
assert_eq!(9..13, m.range());
assert_eq!("1234", m.as_str());
Implementations§
§impl<'h> Match<'h>
impl<'h> Match<'h>
pub fn start(&self) -> usize ⓘ
pub fn start(&self) -> usize ⓘ
Returns 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()
.
This is guaranteed to fall on a valid UTF-8 codepoint boundary. That is, it will never be an offset that appears between the UTF-8 code units of a UTF-8 encoded Unicode scalar value. Consequently, it is always safe to slice the corresponding haystack using this offset.
pub fn end(&self) -> usize ⓘ
pub fn end(&self) -> usize ⓘ
Returns 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()
.
This is guaranteed to fall on a valid UTF-8 codepoint boundary. That is, it will never be an offset that appears between the UTF-8 code units of a UTF-8 encoded Unicode scalar value. Consequently, it is always safe to slice the corresponding haystack using this offset.
pub fn is_empty(&self) -> bool
pub fn is_empty(&self) -> bool
Returns 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)?
.
pub fn range(&self) -> Range<usize> ⓘ
pub fn range(&self) -> Range<usize> ⓘ
Returns the range over the starting and ending byte offsets of the match in the haystack.
It is always correct to slice the original haystack searched with this range. That is, because the offsets are guaranteed to fall on valid UTF-8 boundaries, the range returned is always valid.
Trait Implementations§
impl<'h> Copy for Match<'h>
impl<'h> Eq for Match<'h>
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> UnwindSafe for Match<'h>
Blanket Implementations§
§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
§type ArchivedMetadata = ()
type ArchivedMetadata = ()
§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> ByteSized for T
impl<T> ByteSized for T
Source§const BYTE_ALIGN: usize = _
const BYTE_ALIGN: usize = _
Source§fn byte_align(&self) -> usize ⓘ
fn byte_align(&self) -> usize ⓘ
Source§fn ptr_size_ratio(&self) -> [usize; 2]
fn ptr_size_ratio(&self) -> [usize; 2]
Source§impl<T, R> Chain<R> for Twhere
T: ?Sized,
impl<T, R> Chain<R> for Twhere
T: ?Sized,
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.Source§impl<T> ExtAny for T
impl<T> ExtAny for T
Source§fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
Source§impl<T> ExtMem for Twhere
T: ?Sized,
impl<T> ExtMem for Twhere
T: ?Sized,
Source§const NEEDS_DROP: bool = _
const NEEDS_DROP: bool = _
Source§fn mem_align_of_val(&self) -> usize ⓘ
fn mem_align_of_val(&self) -> usize ⓘ
Source§fn mem_size_of_val(&self) -> usize ⓘ
fn mem_size_of_val(&self) -> usize ⓘ
Source§fn mem_needs_drop(&self) -> bool
fn mem_needs_drop(&self) -> bool
true
if dropping values of this type matters. Read moreSource§fn mem_forget(self)where
Self: Sized,
fn mem_forget(self)where
Self: Sized,
self
without running its destructor. Read moreSource§fn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
fn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
Source§unsafe fn mem_zeroed<T>() -> T
unsafe fn mem_zeroed<T>() -> T
unsafe_layout
only.T
represented by the all-zero byte-pattern. Read moreSource§unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe_layout
only.T
represented by the all-zero byte-pattern. Read moreSource§fn mem_as_bytes(&self) -> &[u8] ⓘ
fn mem_as_bytes(&self) -> &[u8] ⓘ
unsafe_slice
only.§impl<S> FromSample<S> for S
impl<S> FromSample<S> for S
fn from_sample_(s: S) -> S
Source§impl<T> Hook for T
impl<T> Hook for T
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more§impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
fn into_sample(self) -> T
§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError> ⓘ
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError> ⓘ
§impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
§unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
out
indicating that a T
is niched.