Home
last modified time | relevance | path

Searched refs:memrchr3 (Results 1 - 11 of 11) sorted by relevance

/third_party/rust/crates/memchr/src/tests/memchr/
H A Dmemchr.rs6 memchr2, memchr3, memrchr, memrchr2, memrchr3,
83 test.three(true, memrchr3); in memrchr3_find()
90 test.three(true, fallback::memrchr3); in memrchr3_fallback_find()
132 memrchr3(n1, n2, n3, &corpus) == naive::memrchr3(n1, n2, n3, &corpus) in qc_memrchr3_matches_naive()
H A Dsimple.rs7 use crate::{memchr, memchr2, memchr3, memrchr, memrchr2, memrchr3};
21 assert_eq!(memrchr3(b'a', b'z', b'b', b"abcda"), Some(4)); in simple()
22 assert_eq!(memrchr3(b'z', b'y', b'x', b"abcda"), None); in simple()
/third_party/rust/crates/memchr/src/memchr/
H A Dmod.rs363 /// b == needle3)`, `memrchr3` will use a highly optimized routine that can be
372 /// use memchr::memrchr3;
375 /// assert_eq!(memrchr3(b'k', b'q', b'e', haystack), Some(8));
378 pub fn memrchr3( in memrchr3() functions
387 naive::memrchr3(n1, n2, n3, haystack) in memrchr3()
393 x86::memrchr3(n1, n2, n3, haystack) in memrchr3()
402 fallback::memrchr3(n1, n2, n3, haystack) in memrchr3()
H A Dnaive.rs23 pub fn memrchr3(n1: u8, n2: u8, n3: u8, haystack: &[u8]) -> Option<usize> { in memrchr3() functions
H A Diter.rs1 use crate::{memchr, memchr2, memchr3, memrchr, memrchr2, memrchr3};
170 memrchr3(self.needle1, self.needle2, self.needle3, self.haystack) in next_back()
H A Dfallback.rs245 pub fn memrchr3(n1: u8, n2: u8, n3: u8, haystack: &[u8]) -> Option<usize> { in memrchr3() functions
/third_party/rust/crates/memchr/src/memchr/x86/
H A Dmod.rs139 pub fn memrchr3(n1: u8, n2: u8, n3: u8, haystack: &[u8]) -> Option<usize> { in memrchr3() functions
142 memrchr3, in memrchr3()
H A Dsse2.rs10 // memchr3/memrchr3. There was no observable difference between 64 and 32 bytes
488 pub unsafe fn memrchr3( in memrchr3() functions
H A Davx.rs12 // memchr3/memrchr3. There was no observable difference between 128 and 64
452 pub unsafe fn memrchr3( in memrchr3() functions
/third_party/rust/crates/memchr/bench/src/memchr/
H A Dimp.rs1 use memchr::{memrchr, memrchr2, memrchr3, Memchr, Memchr2, Memchr3};
121 while let Some(i) = memrchr3(b1, b2, b3, &haystack[..end]) { in memrchr3_count()
/third_party/rust/crates/memchr/src/
H A Dlib.rs32 This examples shows how to use `memrchr3` to find occurrences of `a`, `b` or
173 memrchr, memrchr2, memrchr2_iter, memrchr3, memrchr3_iter, memrchr_iter,

Completed in 5 milliseconds