#[inline]
pub fn memrchr_tpl_iter(
haystack: &[u8],
needle1: u8,
needle2: u8,
needle3: u8,
) -> MemrchrTplIter<'_> {
MemrchrTplIter::new(haystack, needle1, needle2, needle3)
}
pub struct MemrchrTplIter<'a> {
haystack: &'a [u8],
needle1: u8,
needle2: u8,
needle3: u8,
position: usize, }
impl MemrchrTplIter<'_> {
#[inline]
pub fn new(haystack: &[u8], needle1: u8, needle2: u8, needle3: u8) -> MemrchrTplIter<'_> {
MemrchrTplIter {
needle1,
needle2,
needle3,
haystack,
position: haystack.len() + 1,
}
}
}
impl Iterator for MemrchrTplIter<'_> {
type Item = usize;
#[inline]
fn next(&mut self) -> Option<usize> {
if self.position == 0 {
return None;
}
match crate::memrchr_tpl(
&self.haystack[..(self.position - 1)],
self.needle1,
self.needle2,
self.needle3,
) {
Some(idx) => {
self.position = idx + 1;
Some(idx)
}
None => {
self.position = 0;
None
}
}
}
#[inline]
fn size_hint(&self) -> (usize, Option<usize>) {
(0, Some(self.haystack.len()))
}
}
impl DoubleEndedIterator for MemrchrTplIter<'_> {
#[inline]
fn next_back(&mut self) -> Option<Self::Item> {
if self.position > self.haystack.len() {
return None;
}
match crate::memchr_tpl(
&self.haystack[self.position..],
self.needle1,
self.needle2,
self.needle3,
) {
Some(idx) => {
let found = self.position + idx;
self.position = self.position + idx + 1;
Some(found)
}
None => {
self.position = self.haystack.len() + 1;
None
}
}
}
}