| /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/smack/src/org/jivesoftware/smackx/workgroup/agent/ |
| TranscriptSearchManager.java | 34 * {@link #getSearchForm(String)} or to submit a search form and return the results of
35 * the search {@link #submitSearch(String, Form)}.
56 TranscriptSearch search = new TranscriptSearch();
local
57 search.setType(IQ.Type.GET);
58 search.setTo(serviceJID);
61 new PacketIDFilter(search.getPacketID()));
62 connection.sendPacket(search);
79 * Submits the completed form and returns the result of the transcript search. The result
81 * data that the search may return.
84 * @param completedForm the filled out search form.
89 TranscriptSearch search = new TranscriptSearch(); local
[all...] |
| /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...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.search/ |
| search.pass.cpp | 15 // search(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
28 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia)) == Iter1(ia));
29 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1)) == Iter1(ia));
30 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2)) == Iter1(ia+1));
31 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2)) == Iter1(ia));
32 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3)) == Iter1(ia+2));
33 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3)) == Iter1(ia+2));
34 assert(std::search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3)) == Iter1(ia));
35 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa)) == Iter1(ia+sa-1));
36 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa)) == Iter1(ia+sa-3))
[all...] |
| search_pred.pass.cpp | 15 // search(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
39 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), count_equal()) == Iter1(ia));
42 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), count_equal()) == Iter1(ia));
45 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), count_equal()) == Iter1(ia+1));
48 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), count_equal()) == Iter1(ia));
51 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), count_equal()) == Iter1(ia+2));
54 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), count_equal()) == Iter1(ia+2));
57 assert(std::search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3), count_equal()) == Iter1(ia));
60 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), count_equal()) == Iter1(ia+sa-1));
63 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), count_equal()) == Iter1(ia+sa-3))
[all...] |
| /external/smack/src/org/jivesoftware/smackx/search/ |
| UserSearch.java | 17 package org.jivesoftware.smackx.search;
34 * Implements the protocol currently used to search information repositories on the Jabber network. To date, the jabber:iq:search protocol
35 * has been used mainly to search for people who have registered with user directories (e.g., the "Jabber User Directory" hosted at users.jabber.org).
36 * However, the jabber:iq:search protocol is not limited to user directories, and could be used to search other Jabber information repositories
37 * (such as chatroom directories) or even to provide a Jabber interface to conventional search engines.
39 * The basic functionality is to query an information repository regarding the possible search fields, to send a search query, and to receive search results
69 UserSearch search = new UserSearch(); local
100 UserSearch search = new UserSearch(); local
135 SimpleUserSearch search = new SimpleUserSearch(); local
174 UserSearch search = null; local
[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
|
| /packages/apps/Gallery2/tests/exiftool_parser/ |
| parser.py | 67 _id = re.search("0x[0-9a-f]{4}", s)
71 name = re.search("[0-9]*?\).*?(?:(?: = )|(?: \(SubDirectory\) -->))", s)
75 value = re.search("\(SubDirectory\) -->", s)
79 value = re.search("\(.*\)\n", s)
83 value = re.search("=.*\n", s)
|
| /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.cpp | 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,
|
| /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/skia/src/core/ |
| SkBBoxHierarchy.h | 31 * search.
43 virtual void search(const SkIRect& query, SkTDArray<void*>* results) = 0;
|
| /external/webkit/Source/WebCore/html/ |
| SearchInputType.cpp | 45 return InputTypeNames::search();
|
