| /external/dnsmasq/bld/ |
| pkg-wrapper | 3 search=$1
6 if grep "^\#.*define.*$search" config.h 2>&1 >/dev/null || \
7 grep $search 2>&1 >/dev/null ; then
|
| /external/webkit/JavaScriptCore/tests/mozilla/ecma_3/Unicode/ |
| uc-004.js | 38 reportCompare (0, ary[Number(i)].search(/^\Sfoo$/),
41 reportCompare (-1, ary[Number(i)].search(/^\sfoo$/),
|
| uc-002.js | 38 reportCompare (0, str.search(/^\sfoo$/),
|
| /external/webkit/JavaScriptCore/tests/mozilla/js1_2/regexp/ |
| string_search.js | 24 Description: 'Tests the search method on Strings using regular expressions'
33 var TITLE = 'String: search';
41 // 'abcdefg'.search(/d/)
42 testcases[count++] = new TestCase ( SECTION, "'abcdefg'.search(/d/)",
43 3, 'abcdefg'.search(/d/));
45 // 'abcdefg'.search(/x/)
46 testcases[count++] = new TestCase ( SECTION, "'abcdefg'.search(/x/)",
47 -1, 'abcdefg'.search(/x/));
49 // 'abcdefg123456hijklmn'.search(/\d+/)
50 testcases[count++] = new TestCase ( SECTION, "'abcdefg123456hijklmn'.search(/\d+/)"
[all...] |
| /external/dnsmasq/contrib/openvpn/ |
| dhclient-enter-hooks | 14 if [ -n "$SEARCH" ]; then
15 echo search $SEARCH >> $RESOLVCONF
18 echo search $new_domain_name >> $RESOLVCONF
|
| /external/webkit/JavaScriptCore/tests/mozilla/js1_5/Regress/ |
| regress-179524.js | 43 * it is NOT converted to one, unlike the case for str.match(), str.search().
86 * Now try the same thing with str.search()
89 actual = str.search(re);
94 actual = str.search(re, 'i');
99 actual = str.search(re, 'g', '');
104 actual = str.search(re, 'z', new Object(), new Date());
202 * Now test str.search() where the first argument is not a regexp object.
208 actual = str.search('a');
209 expect = str.search(/a/);
213 actual = str.search('a', 'i')
[all...] |
| /external/stlport/test/unit/ |
| search_test.cpp | 46 location = search((int*)v1, (int*)v1 + 6, (int*)v3, (int*)v3 + 2);
49 location = search((int*)v2, (int*)v2 + 6, (int*)v3, (int*)v3 + 2);
62 location = search(v1.begin(), v1.end(), v2.begin(), v2.end());
68 location = search(v1.begin(), v1.end(), v2.begin(), v2.end());
79 char const** location = search((char const**)grades, (char const**)grades + gradeCount, (char const**)letters, (char const**)letters + letterCount, str_equal);
84 location = search((char const**)grades, (char const**)grades + gradeCount, (char const**)letters, (char const**)letters + letterCount, str_equal);
|
| /ndk/sources/android/stlport/test/unit/ |
| search_test.cpp | 46 location = search((int*)v1, (int*)v1 + 6, (int*)v3, (int*)v3 + 2);
49 location = search((int*)v2, (int*)v2 + 6, (int*)v3, (int*)v3 + 2);
62 location = search(v1.begin(), v1.end(), v2.begin(), v2.end());
68 location = search(v1.begin(), v1.end(), v2.begin(), v2.end());
79 char const** location = search((char const**)grades, (char const**)grades + gradeCount, (char const**)letters, (char const**)letters + letterCount, str_equal);
84 location = search((char const**)grades, (char const**)grades + gradeCount, (char const**)letters, (char const**)letters + letterCount, str_equal);
|
| /external/icu4c/layout/ |
| OpenTypeUtilities.h | 25 static le_int32 search(le_uint16 value, const le_uint16 array[], le_int32 count);
26 static le_int32 search(le_uint32 value, const le_uint32 array[], le_int32 count);
|
| /external/netcat/scripts/ |
| websearch | 2 ## Hit the major search engines. Hose the [large] output to a file!
11 test "${1}" = "" && echo 'Needs argument[s] to search for!' && exit 1
24 doquery "/bin/search?p=${PLUSARG}&n=300&w=w&s=a" search.yahoo.com 80
29 # the infoseek lamers want "registration" before they do a real search, but...
43 search.opentext.com 80
|
| /external/chromium/third_party/icu/source/test/intltest/ |
| srchtest.h | 45 const SearchData *search);
46 UBool assertEqual(const SearchData *search);
47 UBool assertCanonicalEqual(const SearchData *search);
48 UBool assertEqualWithAttribute(const SearchData *search,
|
| srchtest.cpp | 251 const SearchData *search)
255 int32_t matchindex = search->offset[count];
264 int32_t matchlength = search->size[count];
288 matchindex = search->offset[count];
303 matchindex = search->offset[count];
305 int32_t matchlength = search->size[count];
328 matchindex = count > 0 ? search->offset[count - 1] : -1;
345 UBool StringSearchTest::assertEqual(const SearchData *search)
349 Collator *collator = getCollator(search->collator);
350 BreakIterator *breaker = getBreakIterator(search->breaker)
792 const SearchData *search = &(BREAKITERATOREXACT[count]); local
887 const SearchData *search = &(OVERLAP[count]); local
1190 SearchData search = BASIC[index ++]; local
1313 SearchData search = MATCH[0]; local
1375 SearchData search = MATCH[count]; local
1578 const SearchData *search; local
1650 const SearchData *search = &(BREAKITERATORCANONICAL[count]); local
1755 const SearchData *search = &(OVERLAPCANONICAL[count]); local
2020 SearchData search = BASICCANONICAL[index ++]; local
[all...] |
| /external/icu4c/layoutex/ |
| LXUtilities.h | 20 static le_int32 search(le_int32 value, const le_int32 array[], le_int32 count);
|
| /external/icu4c/test/intltest/ |
| srchtest.h | 45 const SearchData *search);
46 UBool assertEqual(const SearchData *search);
47 UBool assertCanonicalEqual(const SearchData *search);
48 UBool assertEqualWithAttribute(const SearchData *search,
|
| srchtest.cpp | 253 const SearchData *search)
257 int32_t matchindex = search->offset[count];
260 strsrch->setAttribute(USEARCH_ELEMENT_COMPARISON, search->elemCompare, status);
272 int32_t matchlength = search->size[count];
297 matchindex = search->offset[count];
312 matchindex = search->offset[count];
314 int32_t matchlength = search->size[count];
337 matchindex = count > 0 ? search->offset[count - 1] : -1;
355 UBool StringSearchTest::assertEqual(const SearchData *search)
359 Collator *collator = getCollator(search->collator)
802 const SearchData *search = &(BREAKITERATOREXACT[count]); local
897 const SearchData *search = &(OVERLAP[count]); local
1200 SearchData search = BASIC[index ++]; local
1323 SearchData search = MATCH[0]; local
1385 SearchData search = MATCH[count]; local
1588 const SearchData *search; local
1660 const SearchData *search = &(BREAKITERATORCANONICAL[count]); local
1765 const SearchData *search = &(OVERLAPCANONICAL[count]); local
2030 SearchData search = BASICCANONICAL[index ++]; local
[all...] |
| /external/webkit/JavaScriptCore/tests/mozilla/ecma/String/ |
| 15.5.4.7-3.js | 32 so as to search all of the string.
115 function LastIndexOf( string, search, position ) {
117 search = String( search );
129 result7 = search.length;
142 if ( string.charAt(k+j) != search.charAt(j) ){
|
| /external/icu4c/i18n/ |
| usearch.cpp | 148 * @param strsrch string search data
290 * @param strsrch string search data
365 * @param strsrch string search data
547 * consideration. Forwards search will take the end accents into consideration
548 * for the default shift values and the backwards search will take the prefix
578 * @param strsrch string search data
587 UBreakIterator *breakiterator = strsrch->search->internalBreakIter;
609 * @param strsrch string search data
618 UBreakIterator *breakiterator = strsrch->search->breakIter;
639 const UChar *text = strsrch->search->text
3185 USearch *search = strsrch->search; local
3291 USearch *search = strsrch->search; local
[all...] |
| /external/icu4c/test/cintltst/ |
| usrchtst.c | 246 log_err_status(status, "Error: NULL break iterator is valid for opening search\n");
263 log_err("Error: NULL break iterator is valid for opening search\n");
276 log_err_status(status, "Error: Break iterator is valid for opening search\n");
288 log_err("Error: Break iterator is valid for opening search\n");
318 log_err("Error opening search %s\n", u_errorName(status));
330 log_err("Error opening search %s\n", u_errorName(status));
337 const SearchData search)
342 int32_t matchindex = search.offset[count];
346 usearch_setAttribute(strsrch, USEARCH_ELEMENT_COMPARISON, search.elemCompare, &status);
358 uint32_t matchlength = search.size[count]
675 const SearchData *search = &(BREAKITERATOREXACT[count]); local
782 const SearchData *search = &(OVERLAP[count]); local
1145 SearchData search = BASIC[searchDataIndex ++]; local
1308 SearchData search = MATCH[0]; local
1412 SearchData search = MATCH[count]; local
1646 SearchData search; local
1765 const SearchData *search = &(BREAKITERATORCANONICAL[count]); local
1883 const SearchData *search = &(OVERLAPCANONICAL[count]); local
2200 SearchData search = BASICCANONICAL[searchDataIndex ++]; local
2360 UStringSearch *search = NULL; local
2415 UStringSearch *search; local
2504 UStringSearch *search; local
[all...] |
| /external/chromium/third_party/icu/source/test/cintltst/ |
| usrchtst.c | 246 log_err_status(status, "Error: NULL break iterator is valid for opening search\n");
263 log_err("Error: NULL break iterator is valid for opening search\n");
276 log_err_status(status, "Error: Break iterator is valid for opening search\n");
288 log_err("Error: Break iterator is valid for opening search\n");
318 log_err("Error opening search %s\n", u_errorName(status));
330 log_err("Error opening search %s\n", u_errorName(status));
337 const SearchData search)
342 int32_t matchindex = search.offset[count];
352 uint32_t matchlength = search.size[count];
375 matchindex = search.offset[count]
668 const SearchData *search = &(BREAKITERATOREXACT[count]); local
775 const SearchData *search = &(OVERLAP[count]); local
1138 SearchData search = BASIC[index ++]; local
1301 SearchData search = MATCH[0]; local
1405 SearchData search = MATCH[count]; local
1639 SearchData search; local
1758 const SearchData *search = &(BREAKITERATORCANONICAL[count]); local
1876 const SearchData *search = &(OVERLAPCANONICAL[count]); local
2193 SearchData search = BASICCANONICAL[index ++]; local
2353 UStringSearch *search = NULL; local
2408 UStringSearch *search; local
2497 UStringSearch *search; local
[all...] |
| /external/webkit/WebCore/css/ |
| themeWin.css | 41 input[type="search"] {
64 input[type="search"]:disabled {
68 input[type="search"]::-webkit-search-cancel-button {
72 input[type="search"]::-webkit-search-results-decoration {
76 input[type="search"]::-webkit-search-results-button {
|
| /external/chromium/third_party/icu/source/i18n/ |
| usearch.cpp | 146 * @param strsrch string search data
288 * @param strsrch string search data
359 * @param strsrch string search data
537 * consideration. Forwards search will take the end accents into consideration
538 * for the default shift values and the backwards search will take the prefix
568 * @param strsrch string search data
577 UBreakIterator *breakiterator = strsrch->search->internalBreakIter;
599 * @param strsrch string search data
608 UBreakIterator *breakiterator = strsrch->search->breakIter;
629 const UChar *text = strsrch->search->text
3189 USearch *search = strsrch->search; local
3295 USearch *search = strsrch->search; local
[all...] |
| /external/v8/tools/ |
| run-valgrind.py | 64 if LEAK_LINE_MATCHER.search(line):
66 if not LEAK_OKAY_MATCHER.search(line):
|
| /libcore/luni/src/test/java/tests/api/java/util/ |
| StackTest.java | 174 assertEquals(array.length - i, stack.search(array[i]));
179 * @tests java.util.Stack#search(java.lang.Object)
184 method = "search",
188 // Test for method int java.util.Stack.search(java.lang.Object)
195 assertEquals("Search returned incorrect value for equivalent object", 3, s
196 .search(item1));
197 assertEquals("Search returned incorrect value for equal object", 3, s
198 .search("Ichi"));
200 assertEquals("Search returned incorrect value for equivalent object at top of stack",
201 1, s.search(item2))
[all...] |
| /external/bluetooth/bluez/test/ |
| sdptest.c | 63 sdp_list_t *search, *attrids; local
77 search = sdp_list_append(NULL, &uuid);
81 //sdp_service_search_attr_async(session, search,
84 sdp_service_search_async(session, search, 0xffff);
88 sdp_list_free(search, NULL);
|
| /external/webkit/WebKitTools/Scripts/webkitpy/ |
| grammar.py | 36 if re.search("h$", noun):
|
