| /third_party/rust/crates/memchr/bench/src/memmem/ |
| H A D | sliceslice.rs | 4 motivated me to write this particular memmem implementation. In particular, my
27 use memchr::memmem;
45 "memmem/krate/prebuilt/sliceslice-words/words", in search_short_haystack()
50 .map(|needle| memmem::Finder::new(needle.as_bytes())) in search_short_haystack()
67 "memmem/krate_nopre/prebuilt/sliceslice-words/words", in search_short_haystack()
73 memmem::FinderBuilder::new() in search_short_haystack()
74 .prefilter(memmem::Prefilter::None) in search_short_haystack()
93 "memmem/stud/prebuilt/sliceslice-words/words", in search_short_haystack()
113 "memmem/sliceslice/prebuilt/sliceslice-words/words", in search_short_haystack()
143 "memmem/krat in search_long_haystack()
[all...] |
| H A D | imp.rs | 18 /// memchr's implementation of memmem. This is the implementation that we hope
27 use memchr::memmem;
30 memmem::find(haystack.as_bytes(), needle.as_bytes()).is_some()
36 let finder = memmem::Finder::new(needle).into_owned();
44 memmem::find_iter(haystack.as_bytes(), needle.as_bytes())
48 PrebuiltIter(memmem::Finder::new(needle).into_owned())
52 pub(crate) struct PrebuiltIter(memmem::Finder<'static>);
65 use memchr::memmem;
68 memmem::rfind(haystack.as_bytes(), needle.as_bytes()).is_some()
74 let finder = memmem
701 fn memmem( memmem() functions
[all...] |
| /third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/ |
| H A D | memutil_test.cc | 130 EXPECT_EQ(absl::strings_internal::memmem(kHaystack, 0, "", 0), kHaystack); in TEST()
131 EXPECT_EQ(absl::strings_internal::memmem(kHaystack, 10, "012", 3), in TEST()
133 EXPECT_EQ(absl::strings_internal::memmem(kHaystack, 10, "0xx", 1), in TEST()
135 EXPECT_EQ(absl::strings_internal::memmem(kHaystack, 10, "789", 3), in TEST()
137 EXPECT_EQ(absl::strings_internal::memmem(kHaystack, 10, "9xx", 1), in TEST()
139 EXPECT_TRUE(absl::strings_internal::memmem(kHaystack, 10, "9xx", 3) == in TEST()
141 EXPECT_TRUE(absl::strings_internal::memmem(kHaystack, 10, "xxx", 1) == in TEST()
|
| H A D | memutil_benchmark.cc | 29 // three memmem implementations:
30 // - memmem() from memutil.h
73 // If you need case-insensitive, STL search is slightly better than memmem for
81 // STL search is slightly faster than memmem in the medium and pathological
82 // benchmarks. However, the performance of memmem is currently more dependable
100 absl::strings_internal::memmem(kHaystack, kHaystackSize, "b", 1)); in BM_Memmem()
109 absl::strings_internal::memmem(kHaystack, kHaystackSize, "ab", 2)); in BM_MemmemMedium()
117 benchmark::DoNotOptimize(absl::strings_internal::memmem( in BM_MemmemPathological()
300 benchmark::DoNotOptimize(absl::strings_internal::memmem( in BM_MemmemStartup()
|
| /third_party/musl/libc-test/src/functionalext/supplement/string/ |
| H A D | memmem.c | 32 ptr = memmem(buffer, sizeof(buffer), cmp, i); in memmem_0100()
53 ptr = memmem(buffer, sizeof(buffer), "musl", errlen); in memmem_0200()
56 ptr = memmem(buffer, sizeof(buffer), "muls", 3); in memmem_0200()
|
| /third_party/rust/crates/memchr/src/memmem/x86/ |
| H A D | avx.rs | 10 use crate::memmem::{genericsimd, NeedleInfo};
76 use crate::memmem::NeedleInfo;
105 use crate::memmem::{prefilter::PrefilterState, NeedleInfo};
118 use crate::memmem::prefilter::tests::PrefilterTest; in prefilter_permutations()
|
| H A D | sse.rs | 3 use crate::memmem::{genericsimd, NeedleInfo};
58 use crate::memmem::{prefilter::PrefilterState, NeedleInfo};
71 use crate::memmem::prefilter::tests::PrefilterTest; in prefilter_permutations()
|
| /third_party/rust/crates/memchr/src/memmem/ |
| H A D | wasm.rs | 3 use crate::memmem::{genericsimd, NeedleInfo};
46 use crate::memmem::{prefilter::PrefilterState, NeedleInfo};
59 use crate::memmem::prefilter::tests::PrefilterTest; in prefilter_permutations()
|
| H A D | rabinkarp.rs | 209 /// memmem/krate/prebuilt/sliceslice-words/words benchmark.
213 crate::memmem::util::is_prefix(haystack, needle) in is_prefix()
222 crate::memmem::util::is_suffix(haystack, needle) in is_suffix()
|
| H A D | rarebytes.rs | 135 crate::memmem::byte_frequencies::BYTE_FREQUENCIES[b as usize] as usize in rank()
|
| /third_party/json/tests/thirdparty/Fuzzer/test/ |
| H A D | StrstrTest.cpp | 11 // Windows does not have strcasestr and memmem, so we are not testing them.
14 #define memmem(a, b, c, d) true macro
22 memmem(s.data(), s.size(), "kuku", 4) in LLVMFuzzerTestOneInput()
|
| /third_party/rust/crates/memchr/src/memmem/prefilter/x86/ |
| H A D | sse.rs | 3 use crate::memmem::{
38 use crate::memmem::prefilter::tests::PrefilterTest; in prefilter_permutations()
|
| H A D | avx.rs | 3 use crate::memmem::{
38 use crate::memmem::prefilter::tests::PrefilterTest; in prefilter_permutations()
|
| /third_party/rust/crates/memchr/src/memmem/prefilter/ |
| H A D | wasm.rs | 3 use crate::memmem::{
35 use crate::memmem::prefilter::tests::PrefilterTest; in prefilter_permutations()
|
| H A D | fallback.rs | 31 use crate::memmem::{
116 use crate::memmem::prefilter::tests::PrefilterTest; in prefilter_permutations()
|
| /third_party/rust/crates/memchr/bench/src/ |
| H A D | bench.rs | 7 mod memmem; modules
11 memmem::all(c); in all()
|
| /third_party/musl/libc-test/src/functional/ |
| H A D | string_memmem.c | 9 char *q = memmem(p, strlen(s), sub, strlen(sub)); \
11 t_error("memmem("#s" "#tail", %d, "#sub", %d) returned str+%d, wanted 0\n",\
17 char *q = memmem(p, strlen(p), sub, strlen(sub)); \
19 t_error("memmem(%s,%s) returned 0, wanted str+%d\n", #s, #sub, n); \
21 t_error("memmem(%s,%s) returned str+%d, wanted str+%d\n", #s, #sub, q-p, n); \
|
| /third_party/musl/libc-test/src/regression/ |
| H A D | memmem-oob-read.c | 2 // memmem should not access oob data
13 unsigned char *p = memmem(haystack, 8, needle, 8); in main()
15 t_error("memmem(A,8,A,8) returned 0, want A\n"); in main()
|
| H A D | memmem-oob.c | 2 // memmem should not access oob data
11 char *p = memmem("abcde", 4, "cde", 3); in main()
13 t_error("memmem(abcde,4,cde,3) returned %s, want NULL\n", p); in main()
|
| /third_party/rust/crates/memchr/src/ |
| H A D | lib.rs | 12 * The [`memmem`] sub-module provides forward and reverse substring search
49 This example shows how to use the [`memmem`] sub-module to find occurrences of
53 use memchr::memmem;
57 let mut it = memmem::find_iter(haystack, "foo");
69 subsequent searches. This can be done with a [`memmem::Finder`]:
72 use memchr::memmem;
74 let finder = memmem::Finder::new("foo");
179 pub mod memmem; modules
|
| /third_party/json/tests/thirdparty/Fuzzer/ |
| H A D | FuzzerUtilPosix.cpp | 112 return memmem(Data, DataLen, Patt, PattLen); in SearchMemory()
|
| /third_party/musl/porting/liteos_m/user/include/ |
| H A D | string.h | 93 void *memmem(const void *, size_t, const void *, size_t);
|
| /third_party/musl/porting/linux/user/include/ |
| H A D | string.h | 95 void *memmem(const void *, size_t, const void *, size_t);
|
| /third_party/musl/porting/uniproton/kernel/include/ |
| H A D | string.h | 93 void *memmem(const void *, size_t, const void *, size_t);
|
| /third_party/musl/include/ |
| H A D | string.h | 76 void *memmem(const void *, size_t, const void *, size_t);
|