/external/chromium_org/tools/mac/ |
H A D | dump-static-initializers.py | 41 file_match = dsymutil_file_re.search(line) 45 o_file_match = dsymutil_o_file_re.search(line) 49 match = dsymutil_re.search(line)
|
/external/libcxx/test/algorithms/alg.sorting/alg.binary.search/equal.range/ |
H A D | Android.mk | 17 test_makefile := external/libcxx/test/algorithms/alg.sorting/alg.binary.search/equal.range/Android.mk 19 test_name := algorithms/alg.sorting/alg.binary.search/equal.range/equal_range 23 test_name := algorithms/alg.sorting/alg.binary.search/equal.range/equal_range_comp
|
/external/libcxx/test/algorithms/alg.sorting/alg.binary.search/lower.bound/ |
H A D | Android.mk | 17 test_makefile := external/libcxx/test/algorithms/alg.sorting/alg.binary.search/lower.bound/Android.mk 19 test_name := algorithms/alg.sorting/alg.binary.search/lower.bound/lower_bound 23 test_name := algorithms/alg.sorting/alg.binary.search/lower.bound/lower_bound_comp
|
/external/libcxx/test/algorithms/alg.sorting/alg.binary.search/upper.bound/ |
H A D | Android.mk | 17 test_makefile := external/libcxx/test/algorithms/alg.sorting/alg.binary.search/upper.bound/Android.mk 19 test_name := algorithms/alg.sorting/alg.binary.search/upper.bound/upper_bound 23 test_name := algorithms/alg.sorting/alg.binary.search/upper.bound/upper_bound_comp
|
/external/lldb/test/pexpect-2.4/examples/ |
H A D | uptime.py | 44 p.match = re.search('([0-9]+)\s+day',duration) 47 p.match = re.search('([0-9]+):([0-9]+)',duration) 51 p.match = re.search('([0-9]+)\s+min',duration)
|
/external/stlport/test/unit/ |
H A D | 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/chromium_org/chrome/browser/resources/pdf/ |
H A D | main.js | 27 var params = window.location.search.substring(1).split('='); 45 var url = window.location.search.substring(1);
|
/external/chromium_org/chrome/browser/resources/sync_internals/ |
H A D | sync_search.css | 5 #sync-search-query { 9 #sync-search-query[error] { 13 .sync-search-quicklink { 19 #sync-search-status {
|
/external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/common/ |
H A D | checksvnconfigfile.py | 45 errorcode_autoprop = not re.search("^\s*enable-auto-props\s*=\s*yes", config_file, re.MULTILINE) 46 errorcode_png = not re.search("^\s*\*\.png\s*=\s*svn:mime-type=image/png", config_file, re.MULTILINE)
|
/external/libcxx/test/algorithms/alg.nonmodifying/alg.search/ |
H A D | 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(Iter [all...] |
/external/wpa_supplicant_8/hostapd/src/ap/ |
H A D | 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 259 struct wpa_stsl_search search; local 330 struct wpa_stsl_search search; local [all...] |
/external/wpa_supplicant_8/src/ap/ |
H A D | 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 259 struct wpa_stsl_search search; local 330 struct wpa_stsl_search search; local [all...] |
/external/wpa_supplicant_8/wpa_supplicant/src/ap/ |
H A D | 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 259 struct wpa_stsl_search search; local 330 struct wpa_stsl_search search; local [all...] |
/external/chromium_org/chrome/browser/web_dev_style/ |
H A D | regex_check.py | 24 match = re.search(regex, line)
|
/external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/common/config/ |
H A D | urls.py | 79 match = re.search(bug_url_short, string) 82 match = re.search(bug_url_long, string) 91 match = re.search(attachment_url, string) 94 match = re.search(direct_attachment_url, string)
|
/external/chromium_org/third_party/icu/source/test/intltest/ |
H A D | 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/chromium_org/v8/test/promises-aplus/lib/ |
H A D | require.js | 36 if (name.search('./helpers/') === 0) {
|
/external/dhcpcd/dhcpcd-hooks/ |
H A D | 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)\ [all...] |
/external/icu/icu4c/source/layoutex/ |
H A D | LXUtilities.h | 20 static le_int32 search(le_int32 value, const le_int32 array[], le_int32 count);
|
/external/icu/icu4c/source/test/intltest/ |
H A D | 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/ |
H A D | 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/chromium_org/third_party/tcmalloc/chromium/src/windows/ |
H A D | addr2line-pdb.c | 56 char* search; local 93 search = malloc(SEARCH_CAP); 94 if (SymGetSearchPath(process, search, SEARCH_CAP)) { 95 if (strlen(search) + sizeof(";" WEBSYM) > SEARCH_CAP) { 100 strcat(search, ";" WEBSYM); 105 strcpy(search, WEBSYM); /* Use a default value */ 107 if (!SymSetSearchPath(process, search)) {
|
/external/chromium_org/third_party/tcmalloc/vendor/src/windows/ |
H A D | addr2line-pdb.c | 62 char* search; local 100 search = malloc(SEARCH_CAP); 101 if (SymGetSearchPath(process, search, SEARCH_CAP)) { 102 if (strlen(search) + sizeof(";" WEBSYM) > SEARCH_CAP) { 107 strcat(search, ";" WEBSYM); 112 strcpy(search, WEBSYM); /* Use a default value */ 114 if (!SymSetSearchPath(process, search)) {
|
/external/chromium_org/v8/src/ |
H A D | string-search.h | 16 // Class holding constants and methods that apply to all string search variants, 22 // search will not be optimal, since we only build tables for a suffix 32 // there is no search speed degradation. 105 static int SingleCharSearch(StringSearch<PatternChar, SubjectChar>* search, 109 static int LinearSearch(StringSearch<PatternChar, SubjectChar>* search, 113 static int InitialSearch(StringSearch<PatternChar, SubjectChar>* search, 118 StringSearch<PatternChar, SubjectChar>* search, 122 static int BoyerMooreSearch(StringSearch<PatternChar, SubjectChar>* search, 181 // The pattern to search for. 183 // Pointer to implementation of the search 195 SingleCharSearch( StringSearch<PatternChar, SubjectChar>* search, Vector<const SubjectChar> subject, int index) argument 247 LinearSearch( StringSearch<PatternChar, SubjectChar>* search, Vector<const SubjectChar> subject, int index) argument 284 BoyerMooreSearch( StringSearch<PatternChar, SubjectChar>* search, Vector<const SubjectChar> subject, int start_index) argument 407 BoyerMooreHorspoolSearch( StringSearch<PatternChar, SubjectChar>* search, Vector<const SubjectChar> subject, int start_index) argument 492 InitialSearch( StringSearch<PatternChar, SubjectChar>* search, Vector<const SubjectChar> subject, int index) argument [all...] |
/external/chromium_org/third_party/icu/source/i18n/ |
H A D | 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 3185 USearch *search = strsrch->search; local 3291 USearch *search = strsrch->search; local [all...] |