pub struct Two { /* private fields */ }Expand description
Finds all occurrences of two bytes in a haystack.
That is, this reports matches of one of two possible bytes. For example,
searching for a or b in afoobar would report matches at offsets 0,
4 and 5.
Implementations§
Source§impl Two
impl Two
Sourcepub fn new(needle1: u8, needle2: u8) -> Two
pub fn new(needle1: u8, needle2: u8) -> Two
Create a new searcher that finds occurrences of the two needle bytes given.
Sourcepub fn find(&self, haystack: &[u8]) -> Option<usize>
pub fn find(&self, haystack: &[u8]) -> Option<usize>
Return the first occurrence of one of the needle bytes in the given
haystack. If no such occurrence exists, then None is returned.
The occurrence is reported as an offset into haystack. Its maximum
value for a non-empty haystack is haystack.len() - 1.
Sourcepub fn rfind(&self, haystack: &[u8]) -> Option<usize>
pub fn rfind(&self, haystack: &[u8]) -> Option<usize>
Return the last occurrence of one of the needle bytes in the given
haystack. If no such occurrence exists, then None is returned.
The occurrence is reported as an offset into haystack. Its maximum
value for a non-empty haystack is haystack.len() - 1.
Sourcepub unsafe fn find_raw(
&self,
start: *const u8,
end: *const u8,
) -> Option<*const u8>
pub unsafe fn find_raw( &self, start: *const u8, end: *const u8, ) -> Option<*const u8>
Like find, but accepts and returns raw pointers.
When a match is found, the pointer returned is guaranteed to be
>= start and < end.
This routine is useful if you’re already using raw pointers and would like to avoid converting back to a slice before executing a search.
§Safety
- Both
startandendmust be valid for reads. - Both
startandendmust point to an initialized value. - Both
startandendmust point to the same allocated object and must either be in bounds or at most one byte past the end of the allocated object. - Both
startandendmust be derived from a pointer to the same object. - The distance between
startandendmust not overflowisize. - The distance being in bounds must not rely on “wrapping around” the address space.
Note that callers may pass a pair of pointers such that start >= end.
In that case, None will always be returned.
Sourcepub unsafe fn rfind_raw(
&self,
start: *const u8,
end: *const u8,
) -> Option<*const u8>
pub unsafe fn rfind_raw( &self, start: *const u8, end: *const u8, ) -> Option<*const u8>
Like rfind, but accepts and returns raw pointers.
When a match is found, the pointer returned is guaranteed to be
>= start and < end.
This routine is useful if you’re already using raw pointers and would like to avoid converting back to a slice before executing a search.
§Safety
- Both
startandendmust be valid for reads. - Both
startandendmust point to an initialized value. - Both
startandendmust point to the same allocated object and must either be in bounds or at most one byte past the end of the allocated object. - Both
startandendmust be derived from a pointer to the same object. - The distance between
startandendmust not overflowisize. - The distance being in bounds must not rely on “wrapping around” the address space.
Note that callers may pass a pair of pointers such that start >= end.
In that case, None will always be returned.