Searched refs:search (Results 1 - 25 of 400) sorted by relevance

1234567891011>>

/external/dnsmasq/bld/
H A Dpkg-wrapper3 search=$1
6 if grep "^\#.*define.*$search" config.h 2>&1 >/dev/null || \
7 grep $search 2>&1 >/dev/null ; then
/external/clang/test/Preprocessor/Inputs/microsoft-header-search/a/
H A Dfindme.h3 #warning findme.h successfully included using MS search rule
/external/clang/test/Preprocessor/Inputs/microsoft-header-search/
H A Dfindme.h3 #error Wrong findme.h included, MSVC header search incorrec
/external/v8/test/mjsunit/
H A Dstring-search.js29 var r = str.search('a');
37 var r = s.search(s);
/external/pdfium/fpdfsdk/src/
H A Dfpdftext_embeddertest.cpp155 FPDF_SCHHANDLE search = FPDFText_FindStart(textpage, nope, 0, 0); local
156 EXPECT_NE(nullptr, search);
157 EXPECT_EQ(0, FPDFText_GetSchResultIndex(search));
158 EXPECT_EQ(0, FPDFText_GetSchCount(search));
161 EXPECT_FALSE(FPDFText_FindNext(search));
162 EXPECT_EQ(0, FPDFText_GetSchResultIndex(search));
163 EXPECT_EQ(0, FPDFText_GetSchCount(search));
166 EXPECT_FALSE(FPDFText_FindPrev(search));
167 EXPECT_EQ(0, FPDFText_GetSchResultIndex(search));
168 EXPECT_EQ(0, FPDFText_GetSchCount(search));
[all...]
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/
H A Dsearch.pass.cpp15 // 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(Iter
[all...]
H A Dsearch_pred.pass.cpp15 // 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/vogar/
H A D.vogarconfig.example19 # a list of directories to search for jar files when using --suggest-classpaths
20 --jar-search-dir <ANDROID_ROOT>/out/target/common/obj/JAVA_LIBRARIES/
21 --jar-search-dir <SOME_OTHER_DIR>
/external/dnsmasq/contrib/openvpn/
H A Ddhclient-enter-hooks15 echo search $SEARCH >> $RESOLVCONF
18 echo search $new_domain_name >> $RESOLVCONF
/external/skia/tools/
H A Dmisc_utils.py22 first match. Does not search across newlines.
40 match = pattern_object.search(line)
57 match = re.search(pattern, input_string)
/external/lldb/test/pexpect-2.4/examples/
H A Duptime.py44 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/selinux/policycoreutils/sepolicy/sepolicy/
H A Dbooleans.py24 search=sepolicy.search variable
34 allows=search([sepolicy.ALLOW],{sepolicy.SOURCE:src,sepolicy.CLASS:tclass, sepolicy.PERMS:perm})
H A Dcommunicate.py24 search=sepolicy.search variable
41 allows=search([sepolicy.ALLOW],{sepolicy.SOURCE:src,sepolicy.CLASS:tclass, sepolicy.PERMS:perm})
/external/wpa_supplicant_8/hostapd/src/ap/
H A Dpeerkey_auth.c41 struct wpa_stsl_search *search = ctx; local
42 if (os_memcmp(search->addr, sm->addr, ETH_ALEN) == 0) {
43 search->sm = sm;
86 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
260 struct wpa_stsl_search search; local
331 struct wpa_stsl_search search; local
[all...]
/external/wpa_supplicant_8/src/ap/
H A Dpeerkey_auth.c41 struct wpa_stsl_search *search = ctx; local
42 if (os_memcmp(search->addr, sm->addr, ETH_ALEN) == 0) {
43 search->sm = sm;
86 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
260 struct wpa_stsl_search search; local
331 struct wpa_stsl_search search; local
[all...]
/external/wpa_supplicant_8/wpa_supplicant/src/ap/
H A Dpeerkey_auth.c41 struct wpa_stsl_search *search = ctx; local
42 if (os_memcmp(search->addr, sm->addr, ETH_ALEN) == 0) {
43 search->sm = sm;
86 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
260 struct wpa_stsl_search search; local
331 struct wpa_stsl_search search; local
[all...]
/external/dhcpcd/dhcpcd-hooks/
H A D20-resolv.conf14 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 DLXUtilities.h20 static le_int32 search(le_int32 value, const le_int32 array[], le_int32 count);
/external/icu/icu4c/source/test/intltest/
H A Dsrchtest.h45 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 DDSAextract.py62 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/
H A DSkBBoxHierarchy.h33 virtual void search(const SkRect& query, SkTDArray<unsigned>* results) const = 0;
/external/v8/test/promises-aplus/lib/
H A Drequire.js36 if (name.search('./helpers/') === 0) {
/external/v8/src/
H A Dstring-search.h16 // 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/icu/icu4c/source/i18n/
H A Dusearch.cpp138 * @param strsrch string search data
280 * @param strsrch string search data
352 * @param strsrch string search data
532 * consideration. Forwards search will take the end accents into consideration
533 * for the default shift values and the backwards search will take the prefix
563 * @param strsrch string search data
572 UBreakIterator *breakiterator = strsrch->search->internalBreakIter;
594 * @param strsrch string search data
603 UBreakIterator *breakiterator = strsrch->search->breakIter;
624 const UChar *text = strsrch->search
3191 USearch *search = strsrch->search; local
3297 USearch *search = strsrch->search; local
[all...]
/external/icu/icu4j/main/tests/collate/src/com/ibm/icu/dev/test/search/
H A DSearchTest.java13 package com.ibm.icu.dev.test.search;
567 boolean assertCanonicalEqual(SearchData search) { argument
568 Collator collator = getCollator(search.collator);
569 BreakIterator breaker = getBreakIterator(search.breaker);
572 String text = search.text;
573 String pattern = search.pattern;
578 collator.setStrength(search.strength);
582 strsrch.setElementComparisonType(search.cmpType);
585 errln("Error opening string search" + e.getMessage());
589 if (!assertEqualWithStringSearch(strsrch, search)) {
599 assertEqual(SearchData search) argument
627 assertEqualWithAttribute(SearchData search, boolean canonical, boolean overlap) argument
657 assertEqualWithStringSearch(StringSearch strsrch, SearchData search) argument
[all...]

Completed in 1946 milliseconds

1234567891011>>