| /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/LayoutTests/fast/dom/HTMLAnchorElement/script-tests/ |
| set-href-attribute-search.js | 1 description('Test setting the search attribute of the URL in HTMLAnchorElement .');
5 debug("Set search without '?'");
7 a.search = "value=key";
10 // IE8 does not encode spaces in search string
11 debug("Set search that starts with '?' and contains spaces");
13 a.search = "?val ue= key?";
16 debug("Set search to a malformed URL");
18 a.search = "%";
22 debug("Set search containing '#'");
25 a.search = "?value#key"
[all...] |
| /external/webkit/Source/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/Source/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...] |
| /sdk/ddms/libs/ddmuilib/tests/src/com/android/ddmuilib/logcat/ |
| LogCatFilterTest.java | 102 assertEquals(true, search("word1 with", msg)); //$NON-NLS-1$
103 assertEquals(true, search("text:w.* ", msg)); //$NON-NLS-1$
104 assertEquals(false, search("absent", msg)); //$NON-NLS-1$
111 assertEquals(false, search("t.*", msg)); //$NON-NLS-1$
112 assertEquals(true, search("tag:t.*", msg)); //$NON-NLS-1$
119 assertEquals(false, search("123", msg)); //$NON-NLS-1$
120 assertEquals(true, search("pid:123", msg)); //$NON-NLS-1$
127 assertEquals(false, search("dalv.*", msg)); //$NON-NLS-1$
128 assertEquals(true, search("app:dal.*k", msg)); //$NON-NLS-1$
137 // treated as a case sensitive search
151 private boolean search(String query, LogCatMessage message) { method in class:LogCatFilterTest
[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/Source/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/tests/device/test-gnustl-full/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/tests/device/test-stlport/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);
|
| /libcore/luni/src/test/java/tests/api/java/util/ |
| StackTest.java | 138 assertEquals(array.length - i, stack.search(array[i]));
143 * java.util.Stack#search(java.lang.Object)
146 // Test for method int java.util.Stack.search(java.lang.Object)
153 assertEquals("Search returned incorrect value for equivalent object", 3, s
154 .search(item1));
155 assertEquals("Search returned incorrect value for equal object", 3, s
156 .search("Ichi"));
158 assertEquals("Search returned incorrect value for equivalent object at top of stack",
159 1, s.search(item2));
160 assertEquals("Search returned incorrect value for equal object at top of stack"
[all...] |
| /external/wpa_supplicant_8/src/ap/ |
| peerkey_auth.c | 41 struct wpa_stsl_search *search = ctx; local
42 if (os_memcmp(search->addr, sm->addr, ETH_ALEN) == 0) {
43 search->sm = sm;
85 struct wpa_stsl_search search; local
104 search.addr = kde.mac_addr;
105 search.sm = NULL;
106 if (wpa_auth_for_each_sta(wpa_auth, wpa_stsl_select_sta, &search) ==
107 0 || search.sm == NULL) {
133 wpa_auth_logger(wpa_auth, search.sm->addr, LOGGER_DEBUG,
136 __wpa_send_eapol(wpa_auth, search.sm
259 struct wpa_stsl_search search; local
330 struct wpa_stsl_search search; local
[all...] |
| /bionic/libc/bionic/ |
| tdestroy.c | 18 #include <search.h>
|
| /external/dhcpcd/dhcpcd-hooks/ |
| 20-resolv.conf | 14 local interfaces= header= search= srvs= servers= x=
26 # Build the search list
29 search=$(cd "$resolv_conf_dir"; \
30 key_get_value "search " ${interfaces})
34 search="$search $@"
38 [ -n "$search" ] && search="search $(uniqify $search)\n
[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 | 255 const SearchData *search)
259 int32_t matchindex = search->offset[count];
263 strsrch->setAttribute(USEARCH_ELEMENT_COMPARISON, search->elemCompare, status);
276 matchlength = search->size[count];
301 matchindex = search->offset[count];
317 matchindex = search->offset[count];
319 matchlength = search->size[count];
343 matchindex = count > 0 ? search->offset[count - 1] : -1;
363 matchindex = search->offset[count];
385 matchlength = search->size[count]
907 const SearchData *search = &(BREAKITERATOREXACT[count]); local
1002 const SearchData *search = &(OVERLAP[count]); local
1295 SearchData search = BASIC[index ++]; local
1418 SearchData search = MATCH[0]; local
1480 SearchData search = MATCH[count]; local
1683 const SearchData *search; local
1755 const SearchData *search = &(BREAKITERATORCANONICAL[count]); local
1860 const SearchData *search = &(OVERLAPCANONICAL[count]); local
2125 SearchData search = BASICCANONICAL[index ++]; local
[all...] |
| /external/llvm/utils/ |
| DSAextract.py | 62 if not arrowexp.search(buffer):
67 if regexp.search(buffer):
95 if arrowexp.search(buffer):
104 elif nodeexp.search(buffer): #this is a node line
|
| /external/webkit/Source/WebCore/html/ |
| SearchInputType.cpp | 45 return InputTypeNames::search();
|
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
| StackTest.java | 128 * @tests java.util.Stack#search(java.lang.Object)
131 // Test for method int java.util.Stack.search(java.lang.Object)
138 assertEquals("Search returned incorrect value for equivalent object", 3, s
139 .search(item1));
140 assertEquals("Search returned incorrect value for equal object", 3, s
141 .search("Ichi"));
143 assertEquals("Search returned incorrect value for equivalent object at top of stack",
144 1, s.search(item2));
145 assertEquals("Search returned incorrect value for equal object at top of stack",
146 1, s.search("Ni"))
[all...] |
| /external/v8/src/ |
| string-search.h | 36 // String Search object.
39 // Class holding constants and methods that apply to all string search variants,
45 // search will not be optimal, since we only build tables for a suffix
55 // there is no search speed degradation.
101 int Search(Vector<const SubjectChar> subject, int index) {
128 static int SingleCharSearch(StringSearch<PatternChar, SubjectChar>* search,
132 static int LinearSearch(StringSearch<PatternChar, SubjectChar>* search,
136 static int InitialSearch(StringSearch<PatternChar, SubjectChar>* search,
141 StringSearch<PatternChar, SubjectChar>* search,
145 static int BoyerMooreSearch(StringSearch<PatternChar, SubjectChar>* search,
[all...] |
| /external/webkit/Source/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...] |
