Lines Matching refs:FinderRev
56 subsequent searches. This can be done with a [`Finder`] (or a [`FinderRev`] for
228 FindRevIter::new(haystack, FinderRev::new(needle))
270 /// small haystacks, it may be faster to initialize a [`FinderRev`] once,
300 FinderRev::new(needle).rfind(haystack)
378 finder: FinderRev<'n>,
388 finder: FinderRev<'n>,
569 /// using [`rfind`] is good enough, but `FinderRev` is useful when you can
573 /// version which permits building a `FinderRev` that is not connected to
576 pub struct FinderRev<'n> {
580 impl<'n> FinderRev<'n> {
583 pub fn new<B: ?Sized + AsRef<[u8]>>(needle: &'n B) -> FinderRev<'n> {
607 /// use memchr::memmem::FinderRev;
610 /// assert_eq!(Some(0), FinderRev::new("foo").rfind(haystack));
611 /// assert_eq!(Some(4), FinderRev::new("bar").rfind(haystack));
612 /// assert_eq!(None, FinderRev::new("quux").rfind(haystack));
635 /// use memchr::memmem::FinderRev;
638 /// let finder = FinderRev::new(b"foo");
662 pub fn into_owned(self) -> FinderRev<'static> {
663 FinderRev { searcher: self.searcher.into_owned() }
677 pub fn as_ref(&self) -> FinderRev<'_> {
678 FinderRev { searcher: self.searcher.as_ref() }
723 ) -> FinderRev<'n> {
724 FinderRev { searcher: SearcherRev::new(needle.as_ref()) }