| /dports/sysutils/fd/fd-8.3.0/cargo-crates/bstr-0.2.17/src/byteset/ |
| H A D | mod.rs | 17 1 => memchr(byteset[0], haystack),
31 1 => memrchr(byteset[0], haystack),
43 if haystack.is_empty() {
63 if haystack.is_empty() {
67 0 => return Some(haystack.len() - 1),
86 haystack: Vec<u8>,
89 super::find(&haystack, &needles)
93 haystack: Vec<u8>,
96 super::rfind(&haystack, &needles)
100 haystack: Vec<u8>,
[all …]
|
| /dports/devel/sentry-cli/sentry-cli-1.71.0/cargo-crates/bstr-0.2.17/src/byteset/ |
| H A D | mod.rs | 17 1 => memchr(byteset[0], haystack), in find()
31 1 => memrchr(byteset[0], haystack), in rfind()
43 if haystack.is_empty() { in find_not()
63 if haystack.is_empty() { in rfind_not()
67 0 => return Some(haystack.len() - 1), in rfind_not()
86 haystack: Vec<u8>,
89 super::find(&haystack, &needles)
93 haystack: Vec<u8>,
96 super::rfind(&haystack, &needles)
100 haystack: Vec<u8>,
[all …]
|
| /dports/devel/bingrep/bingrep-0.8.5/cargo-crates/bstr-0.2.14/src/byteset/ |
| H A D | mod.rs | 17 1 => memchr(byteset[0], haystack), in find()
31 1 => memrchr(byteset[0], haystack), in rfind()
43 if haystack.is_empty() { in find_not()
63 if haystack.is_empty() { in rfind_not()
67 0 => return Some(haystack.len() - 1), in rfind_not()
87 haystack: Vec<u8>,
90 super::find(&haystack, &needles)
94 haystack: Vec<u8>,
97 super::rfind(&haystack, &needles)
101 haystack: Vec<u8>,
[all …]
|
| /dports/www/monolith/monolith-2.6.1/cargo-crates/bstr-0.2.16/src/byteset/ |
| H A D | mod.rs | 17 1 => memchr(byteset[0], haystack), in find()
31 1 => memrchr(byteset[0], haystack), in rfind()
43 if haystack.is_empty() { in find_not()
63 if haystack.is_empty() { in rfind_not()
67 0 => return Some(haystack.len() - 1), in rfind_not()
86 haystack: Vec<u8>,
89 super::find(&haystack, &needles)
93 haystack: Vec<u8>,
96 super::rfind(&haystack, &needles)
100 haystack: Vec<u8>,
[all …]
|
| /dports/security/libprelude/libprelude-1.2.6/libmissing/tests/ |
| H A D | test-memmem.c | 122 if (haystack != NULL) in main()
125 haystack[0] = 'B'; in main()
129 ASSERT (memmem (haystack, m, needle, n) == haystack + 1); in main()
132 free (haystack); in main()
141 const char *haystack = in main() local
178 free (haystack); in main()
202 free (haystack); in main()
248 const char* p = memmem (haystack, strlen (haystack), in main()
257 const char* p = memmem (haystack, strlen (haystack), in main()
284 ASSERT (haystack); in main()
[all …]
|
| H A D | test-strcasestr.c | 104 if (haystack != NULL)
107 haystack[0] = 'B';
108 haystack[m] = '\0';
112 ASSERT (strcasestr (haystack, needle) == haystack + 1);
115 free (haystack);
124 const char *haystack =
152 haystack[2 * m] = 'B';
163 free (haystack);
171 const char *haystack =
217 ASSERT (p - haystack == 4);
[all …]
|
| /dports/devel/gnulib/gnulib-20140202-stable/tests/ |
| H A D | test-memmem.c | 122 if (haystack != NULL) in main()
125 haystack[0] = 'B'; in main()
129 ASSERT (memmem (haystack, m, needle, n) == haystack + 1); in main()
132 free (haystack); in main()
141 const char *haystack = in main() local
178 free (haystack); in main()
202 free (haystack); in main()
248 const char* p = memmem (haystack, strlen (haystack), in main()
257 const char* p = memmem (haystack, strlen (haystack), in main()
284 ASSERT (haystack); in main()
[all …]
|
| H A D | test-strcasestr.c | 104 if (haystack != NULL) in main()
107 haystack[0] = 'B'; in main()
108 haystack[m] = '\0'; in main()
112 ASSERT (strcasestr (haystack, needle) == haystack + 1); in main()
115 free (haystack); in main()
124 const char *haystack = in main() local
152 haystack[2 * m] = 'B'; in main()
163 free (haystack); in main()
171 const char *haystack = in main() local
217 ASSERT (p - haystack == 4); in main()
[all …]
|
| H A D | test-c-strcasestr.c | 90 if (haystack != NULL) in main()
93 haystack[0] = 'B'; in main()
94 haystack[m] = '\0'; in main()
98 ASSERT (c_strcasestr (haystack, needle) == haystack + 1); in main()
101 free (haystack); in main()
110 const char *haystack = in main() local
138 haystack[2 * m] = 'B'; in main()
149 free (haystack); in main()
157 const char *haystack = in main() local
203 ASSERT (p - haystack == 4); in main()
[all …]
|
| /dports/devel/folly/folly-2021.12.27.00/folly/detail/ |
| H A D | RangeSse42.cpp | 73 assert(haystack.size() > 0u); in qfind_first_byte_of_needles16()
78 (haystack.size() < 16 && in qfind_first_byte_of_needles16()
79 page_for(haystack.end() - 1) != page_for(haystack.data() + 15)) || in qfind_first_byte_of_needles16()
98 for (; i < haystack.size(); i += 16) { in qfind_first_byte_of_needles16()
116 const StringPieceLite haystack, in scanHaystackBlock() argument
121 blockStartIdx + 16 <= haystack.size() || in scanHaystackBlock()
148 int(haystack.size() - blockStartIdx), in scanHaystackBlock()
172 if (haystack.size() < 16 && in qfind_first_byte_of_sse42()
173 page_for(haystack.end() - 1) != page_for(haystack.data() + 16)) { in qfind_first_byte_of_sse42()
175 if (haystack.size() <= 2) { in qfind_first_byte_of_sse42()
[all …]
|
| /dports/benchmarks/fio/fio-3.29/unittests/oslib/ |
| H A D | strcasestr.c | 17 p = strcasestr(haystack, "012");
18 CU_ASSERT_EQUAL(p, haystack);
20 p = strcasestr(haystack, "12345");
21 CU_ASSERT_EQUAL(p, haystack + 1);
26 p = strcasestr(haystack, "");
35 p = strcasestr(haystack, "ABC");
36 CU_ASSERT_EQUAL(p, haystack);
38 p = strcasestr(haystack, "BCD");
44 p = strcasestr(haystack, "");
54 CU_ASSERT_EQUAL(p, haystack);
[all …]
|
| /dports/www/elgg/elgg-3.3.23/vendor/elgg/elgg/engine/tests/phpunit/integration/Elgg/Search/ |
| H A D | SearchServiceIntegrationTest.php | 35 $entity->haystack = $haystack;
75 ['dolor', $haystack, true, true, 1],
76 ['dolor', $haystack, false, true, 1],
77 ['dolor', $haystack, true, false, 0],
78 ['dolor', $haystack, false, false, 0],
80 ['consec', $haystack, true, true, 1],
81 ['consec', $haystack, false, true, 1],
82 ['consec', $haystack, true, false, 0],
83 ['consec', $haystack, false, false, 0],
85 ['sit amet', $haystack, true, true, 1],
[all …]
|
| /dports/devel/idutils/idutils-4.6/gnulib-tests/ |
| H A D | test-strcasestr.c | 103 if (haystack != NULL) in main()
106 haystack[0] = 'B'; in main()
107 haystack[m] = '\0'; in main()
111 ASSERT (strcasestr (haystack, needle) == haystack + 1); in main()
114 free (haystack); in main()
123 const char *haystack = in main() local
151 haystack[2 * m] = 'B'; in main()
162 free (haystack); in main()
170 const char *haystack = in main() local
216 ASSERT (p - haystack == 4); in main()
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/algorithm/example/ |
| H A D | search_example.cpp | 19 const std::string haystack ( "ABACAB is it everywhere!" ); variable
30 …oyer_moore_search ( haystack.begin (), haystack.end (), needle1.begin (), needle1.end ()) != std::… in main()
31 … std::cout << "Found '" << needle1 << "' in '" << haystack << "' (boyer-moore 1)" << std::endl; in main()
33 …std::cout << "Did NOT find '" << needle1 << "' in '" << haystack << "' (boyer-moore 1)" << std::e… in main()
39 …if ( search1 ( haystack.begin (), haystack.end ()) != std::make_pair(haystack.end(), haystack.end(… in main()
40 … std::cout << "Found '" << needle1 << "' in '" << haystack << "' (boyer-moore 2)" << std::endl; in main()
42 …std::cout << "Did NOT find '" << needle1 << "' in '" << haystack << "' (boyer-moore 2)" << std::e… in main()
45 …e_horspool_search ( haystack.begin (), haystack.end (), needle1.begin (), needle1.end ()) != std::… in main()
46 …std::cout << "Found '" << needle1 << "' in '" << haystack << "' (boyer-moore-horspool)" << std::e… in main()
51 …rris_pratt_search ( haystack.begin (), haystack.end (), needle1.begin (), needle1.end ()) != std::… in main()
[all …]
|
| /dports/devel/boost-libs/boost_1_72_0/libs/algorithm/example/ |
| H A D | search_example.cpp | 19 const std::string haystack ( "ABACAB is it everywhere!" ); variable
30 …oyer_moore_search ( haystack.begin (), haystack.end (), needle1.begin (), needle1.end ()) != std::… in main()
31 … std::cout << "Found '" << needle1 << "' in '" << haystack << "' (boyer-moore 1)" << std::endl; in main()
33 …std::cout << "Did NOT find '" << needle1 << "' in '" << haystack << "' (boyer-moore 1)" << std::e… in main()
39 …if ( search1 ( haystack.begin (), haystack.end ()) != std::make_pair(haystack.end(), haystack.end(… in main()
40 … std::cout << "Found '" << needle1 << "' in '" << haystack << "' (boyer-moore 2)" << std::endl; in main()
42 …std::cout << "Did NOT find '" << needle1 << "' in '" << haystack << "' (boyer-moore 2)" << std::e… in main()
45 …e_horspool_search ( haystack.begin (), haystack.end (), needle1.begin (), needle1.end ()) != std::… in main()
46 …std::cout << "Found '" << needle1 << "' in '" << haystack << "' (boyer-moore-horspool)" << std::e… in main()
51 …rris_pratt_search ( haystack.begin (), haystack.end (), needle1.begin (), needle1.end ()) != std::… in main()
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/libs/algorithm/example/ |
| H A D | search_example.cpp | 19 const std::string haystack ( "ABACAB is it everywhere!" ); variable
30 …oyer_moore_search ( haystack.begin (), haystack.end (), needle1.begin (), needle1.end ()) != std::… in main()
31 … std::cout << "Found '" << needle1 << "' in '" << haystack << "' (boyer-moore 1)" << std::endl; in main()
33 …std::cout << "Did NOT find '" << needle1 << "' in '" << haystack << "' (boyer-moore 1)" << std::e… in main()
39 …if ( search1 ( haystack.begin (), haystack.end ()) != std::make_pair(haystack.end(), haystack.end(… in main()
40 … std::cout << "Found '" << needle1 << "' in '" << haystack << "' (boyer-moore 2)" << std::endl; in main()
42 …std::cout << "Did NOT find '" << needle1 << "' in '" << haystack << "' (boyer-moore 2)" << std::e… in main()
45 …e_horspool_search ( haystack.begin (), haystack.end (), needle1.begin (), needle1.end ()) != std::… in main()
46 …std::cout << "Found '" << needle1 << "' in '" << haystack << "' (boyer-moore-horspool)" << std::e… in main()
51 …rris_pratt_search ( haystack.begin (), haystack.end (), needle1.begin (), needle1.end ()) != std::… in main()
[all …]
|
| /dports/devel/hyperscan/boost_1_75_0/libs/algorithm/example/ |
| H A D | search_example.cpp | 19 const std::string haystack ( "ABACAB is it everywhere!" ); variable
30 …oyer_moore_search ( haystack.begin (), haystack.end (), needle1.begin (), needle1.end ()) != std::… in main()
31 … std::cout << "Found '" << needle1 << "' in '" << haystack << "' (boyer-moore 1)" << std::endl; in main()
33 …std::cout << "Did NOT find '" << needle1 << "' in '" << haystack << "' (boyer-moore 1)" << std::e… in main()
39 …if ( search1 ( haystack.begin (), haystack.end ()) != std::make_pair(haystack.end(), haystack.end(… in main()
40 … std::cout << "Found '" << needle1 << "' in '" << haystack << "' (boyer-moore 2)" << std::endl; in main()
42 …std::cout << "Did NOT find '" << needle1 << "' in '" << haystack << "' (boyer-moore 2)" << std::e… in main()
45 …e_horspool_search ( haystack.begin (), haystack.end (), needle1.begin (), needle1.end ()) != std::… in main()
46 …std::cout << "Found '" << needle1 << "' in '" << haystack << "' (boyer-moore-horspool)" << std::e… in main()
51 …rris_pratt_search ( haystack.begin (), haystack.end (), needle1.begin (), needle1.end ()) != std::… in main()
[all …]
|
| /dports/mail/neomutt/neomutt-20211029/test/list/ |
| H A D | mutt_list_find.c | 46 TEST_CHECK(mutt_list_find(&haystack, needle) != NULL); in test_mutt_list_find()
47 mutt_list_clear(&haystack); in test_mutt_list_find()
54 TEST_CHECK(mutt_list_find(&haystack, needle) != NULL); in test_mutt_list_find()
55 mutt_list_clear(&haystack); in test_mutt_list_find()
63 mutt_list_clear(&haystack); in test_mutt_list_find()
71 mutt_list_clear(&haystack); in test_mutt_list_find()
79 mutt_list_clear(&haystack); in test_mutt_list_find()
84 struct ListHead haystack = STAILQ_HEAD_INITIALIZER(haystack); in test_mutt_list_find() local
86 mutt_list_clear(&haystack); in test_mutt_list_find()
91 struct ListHead haystack = STAILQ_HEAD_INITIALIZER(haystack); in test_mutt_list_find() local
[all …]
|
| /dports/devel/libunistring/libunistring-0.9.10/tests/ |
| H A D | test-strstr.c | 123 if (haystack != NULL) in main()
126 haystack[0] = 'B'; in main()
127 haystack[m] = '\0'; in main()
131 ASSERT (strstr (haystack, needle) == haystack + 1); in main()
134 free (haystack); in main()
143 const char *haystack = in main() local
171 haystack[2 * m] = 'B'; in main()
182 free (haystack); in main()
194 const char *haystack = in main() local
265 ASSERT (haystack); in main()
[all …]
|
| /dports/lang/micropython/micropython-1.17/tests/basics/ |
| H A D | containment.py | 7 haystack = "supercalifragilistc" variable
8 for needle in [haystack[i:] for i in range(len(haystack))]:
9 print(needle, "in", haystack, "::", needle in haystack)
10 print(needle, "not in", haystack, "::", needle not in haystack)
11 print(haystack, "in", needle, "::", haystack in needle)
12 print(haystack, "not in", needle, "::", haystack not in needle)
13 for needle in [haystack[:i+1] for i in range(len(haystack))]:
14 print(needle, "in", haystack, "::", needle in haystack)
15 print(needle, "not in", haystack, "::", needle not in haystack)
16 print(haystack, "in", needle, "::", haystack in needle)
[all …]
|
| /dports/lang/gcc11/gcc-11.2.0/libstdc++-v3/testsuite/21_strings/basic_string/operations/contains/char/ |
| H A D | 1.cc | 31 VERIFY(haystack.contains(std::string(""))); in test01()
43 VERIFY(!haystack.contains('\0')); in test01()
44 VERIFY(haystack.contains('n')); in test01()
45 VERIFY(haystack.contains('e')); in test01()
46 VERIFY(haystack.contains('s')); in test01()
47 VERIFY(!haystack.contains('x')); in test01()
49 VERIFY(haystack.contains("")); in test01()
50 VERIFY(haystack.contains("no")); in test01()
51 VERIFY(haystack.contains("needles")); in test01()
52 VERIFY(haystack.contains(" for ")); in test01()
[all …]
|
| /dports/lang/gcc12-devel/gcc-12-20211205/libstdc++-v3/testsuite/21_strings/basic_string/operations/contains/char/ |
| H A D | 1.cc | 31 VERIFY(haystack.contains(std::string(""))); in test01()
43 VERIFY(!haystack.contains('\0')); in test01()
44 VERIFY(haystack.contains('n')); in test01()
45 VERIFY(haystack.contains('e')); in test01()
46 VERIFY(haystack.contains('s')); in test01()
47 VERIFY(!haystack.contains('x')); in test01()
49 VERIFY(haystack.contains("")); in test01()
50 VERIFY(haystack.contains("no")); in test01()
51 VERIFY(haystack.contains("needles")); in test01()
52 VERIFY(haystack.contains(" for ")); in test01()
[all …]
|
| /dports/lang/gcc11-devel/gcc-11-20211009/libstdc++-v3/testsuite/21_strings/basic_string/operations/contains/char/ |
| H A D | 1.cc | 31 VERIFY(haystack.contains(std::string(""))); in test01()
43 VERIFY(!haystack.contains('\0')); in test01()
44 VERIFY(haystack.contains('n')); in test01()
45 VERIFY(haystack.contains('e')); in test01()
46 VERIFY(haystack.contains('s')); in test01()
47 VERIFY(!haystack.contains('x')); in test01()
49 VERIFY(haystack.contains("")); in test01()
50 VERIFY(haystack.contains("no")); in test01()
51 VERIFY(haystack.contains("needles")); in test01()
52 VERIFY(haystack.contains(" for ")); in test01()
[all …]
|
| /dports/misc/cxx_atomics_pic/gcc-11.2.0/libstdc++-v3/testsuite/21_strings/basic_string/operations/contains/char/ |
| H A D | 1.cc | 31 VERIFY(haystack.contains(std::string(""))); in test01()
43 VERIFY(!haystack.contains('\0')); in test01()
44 VERIFY(haystack.contains('n')); in test01()
45 VERIFY(haystack.contains('e')); in test01()
46 VERIFY(haystack.contains('s')); in test01()
47 VERIFY(!haystack.contains('x')); in test01()
49 VERIFY(haystack.contains("")); in test01()
50 VERIFY(haystack.contains("no")); in test01()
51 VERIFY(haystack.contains("needles")); in test01()
52 VERIFY(haystack.contains(" for ")); in test01()
[all …]
|
| /dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/perfetto/ui/src/base/ |
| H A D | binary_search.ts | 22 return (needle >= haystack[i]) ? i : -1;
26 const midValue = haystack[mid];
38 if (haystack[i] <= needle) {
46 const midValue = haystack[mid];
53 while (haystack[i] !== needle) i++;
54 while (haystack[j - 1] !== needle) j--;
60 return searchImpl(haystack, needle, 0, haystack.length);
71 if (haystack[i] === needle) return range;
97 if (!haystack.length) return [-1, -1];
99 const left = search(haystack, needle);
[all …]
|