Lines Matching defs:Finder
56 subsequent searches. This can be done with a [`Finder`] (or a [`FinderRev`] for
62 let finder = memmem::Finder::new("foo");
194 FindIter::new(haystack, Finder::new(needle))
234 /// small haystacks, it may be faster to initialize a [`Finder`] once,
263 Finder::new(needle).find(haystack)
314 finder: Finder<'n>,
322 finder: Finder<'n>,
442 /// [`find`] is good enough, but `Finder` is useful when you can meaningfully
446 /// version which permits building a `Finder` that is not connected to
449 pub struct Finder<'n> {
453 impl<'n> Finder<'n> {
456 pub fn new<B: ?Sized + AsRef<[u8]>>(needle: &'n B) -> Finder<'n> {
477 /// use memchr::memmem::Finder;
480 /// assert_eq!(Some(0), Finder::new("foo").find(haystack));
481 /// assert_eq!(Some(4), Finder::new("bar").find(haystack));
482 /// assert_eq!(None, Finder::new("quux").find(haystack));
504 /// use memchr::memmem::Finder;
507 /// let finder = Finder::new(b"foo");
531 pub fn into_owned(self) -> Finder<'static> {
532 Finder { searcher: self.searcher.into_owned() }
546 pub fn as_ref(&self) -> Finder<'_> {
547 Finder { searcher: self.searcher.as_ref() }
714 ) -> Finder<'n> {
715 Finder { searcher: Searcher::new(self.config, needle.as_ref()) }