| /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/chromium_org/chrome/browser/resources/print_preview/search/ |
| search_box.css | 5 .search-box {
10 .search-box-icon {
21 .search-box-input {
|
| destination_search.css | 5 #destination-search {
9 #destination-search.transparent {
15 #destination-search .page {
19 #destination-search .user-info {
31 [dir='rtl'] #destination-search .user-info {
36 #destination-search > .page > .close-button {
40 #destination-search .search-box {
45 #destination-search .lists {
50 #destination-search .lists > *
[all...] |
| /external/chromium_org/tools/memory_watcher/scripts/ |
| finditem.pl | 8 my $search = shift;
28 elsif ($line =~ m/$search/) {
53 my $search = shift;
56 process_raw($filename, $search);
|
| /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/chromium_org/chrome/browser/resources/options/ |
| search_engine_manager.css | 5 #search-engine-manager-page {
9 .search-engine-list input {
14 .search-engine-list > div {
18 .search-engine-list .favicon {
28 .search-engine-list .name-column {
36 .search-engine-list .name-column :last-child {
40 .search-engine-list .keyword-column {
46 .search-engine-list .url-column {
51 .search-engine-list .keyword-column,
52 .search-engine-list .url-column
[all...] |
| password_manager.css | 10 #password-search-column {
16 html[dir=rtl] #password-search-column {
|
| search_page.css | 5 .search-hidden {
9 .search-highlighted {
13 /* Container for the elements that make up the search bubble. */
14 .search-bubble {
20 /* Create a z-context for search-bubble-innards, its after and before. */
25 .search-bubble-innards {
35 .search-bubble-innards::before {
48 .search-bubble-innards::after {
66 .search-bubble-wrapper {
|
| /external/chromium_org/chrome/browser/resources/gaia_auth/ |
| util.js | 9 function getUrlSearchParams(search) {
12 if (search) {
14 search = search.substring(1);
15 var pairs = search.split('&');
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/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/chromium_org/tools/grit/grit/tool/ |
| toolbar_preprocess.py | 40 if self._LINE_FEED_PH.search(line):
43 if self._PH_COMMENT.search(line):
44 mm = self._COMMENT.search(line)
53 mo = self._IDS_COMMAND_MACRO.search(line)
|
| /external/dnsmasq/contrib/openvpn/ |
| dhclient-enter-hooks | 14 if [ -n "$SEARCH" ]; then
15 echo search $SEARCH >> $RESOLVCONF
18 echo search $new_domain_name >> $RESOLVCONF
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib-tk/test/test_tkinter/ |
| test_text.py | 22 self.assertRaises(Tkinter.TclError, text.search, None, '1.0')
23 self.assertRaises(Tkinter.TclError, text.search, 'a', None)
24 self.assertRaises(Tkinter.TclError, text.search, None, None)
27 self.assertRaises(Tkinter.TclError, text.search, '', 0)
32 self.assertEqual(text.search('-test', '1.0', 'end'), '1.2')
33 self.assertEqual(text.search('test', '1.0', 'end'), '1.3')
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib-tk/test/test_tkinter/ |
| test_text.py | 22 self.assertRaises(Tkinter.TclError, text.search, None, '1.0')
23 self.assertRaises(Tkinter.TclError, text.search, 'a', None)
24 self.assertRaises(Tkinter.TclError, text.search, None, None)
27 self.assertRaises(Tkinter.TclError, text.search, '', 0)
32 self.assertEqual(text.search('-test', '1.0', 'end'), '1.2')
33 self.assertEqual(text.search('test', '1.0', 'end'), '1.3')
|
| /packages/apps/UnifiedEmail/src/com/android/mail/ui/ |
| SearchMailActionBarView.java | 32 * This class is used to show a custom actionbar for the search activity. This doesn't have any
83 * Remove focus from the search field to avoid
85 * 2. The search suggestions shown up.
88 // Remove focus from the search action menu in search results mode so
90 final MenuItem search = getSearch(); local
91 if (search != null) {
92 final SearchView searchWidget = (SearchView) search.getActionView();
101 final MenuItem search = getSearch(); local
102 if (search != null)
[all...] |
| /packages/apps/Camera2/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/chromium_org/chrome/browser/resources/sync_internals/ |
| sync_search.css | 5 #sync-search-query {
9 #sync-search-query[error] {
13 #sync-search-status {
|
| /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...] |
