Searched refs:FinderRev (Results 1 - 2 of 2) sorted by relevance

/third_party/rust/crates/memchr/src/memmem/
H A D	mod.rs	56 subsequent searches. This can be done with a [`Finder`] (or a [`FinderRev`] for 228 FindRevIter::new(haystack, FinderRev::new(needle)) in rfind_iter() 270 /// small haystacks, it may be faster to initialize a [`FinderRev`] once, 300 FinderRev::new(needle).rfind(haystack) in rfind() 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> { structure names 580 impl<'n> FinderRev<' impls [all...]
/third_party/rust/crates/memchr/bench/src/memmem/
H A D	imp.rs	74 let finder = memmem::FinderRev::new(needle).into_owned(); 86 PrebuiltIter(memmem::FinderRev::new(needle).into_owned()) 90 pub(crate) struct PrebuiltIter(memmem::FinderRev<'static>); 165 fn finder(needle: &[u8]) -> memmem::FinderRev<'_> { in finder() 198 pub(crate) struct PrebuiltIter(memmem::FinderRev<'static>);

Completed in 2 milliseconds

Indexes created Thu Nov 07 10:32:03 CST 2024