| /external/chromium_org/third_party/skia/tools/ |
| misc_utils.py | 18 """Search for regular expression in a file-like object.
22 first match. Does not search across newlines.
40 match = pattern_object.search(line)
47 """Search for regular expression in a string.
57 match = re.search(pattern, input_string)
|
| /external/libcxx/test/algorithms/alg.nonmodifying/alg.search/ |
| 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...] |
| /bionic/libc/bionic/ |
| tdestroy.cpp | 18 #include <search.h>
|
| /developers/build/prebuilts/androidtv/leanback/app/src/main/java/com/example/android/leanback/ |
| SearchActivity.java | 30 setContentView(R.layout.search);
|
| /external/chromium_org/chrome/browser/web_dev_style/ |
| regex_check.py | 24 match = re.search(regex, line)
|
| /external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/common/config/ |
| 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/ |
| 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/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/icu/icu4c/source/layoutex/ |
| LXUtilities.h | 20 static le_int32 search(le_int32 value, const le_int32 array[], le_int32 count);
|
| /external/icu/icu4c/source/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/chromium_org/third_party/tcmalloc/chromium/src/windows/ |
| 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) {
96 fprintf(stderr, "Search path too long\n");
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/ |
| 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) {
103 fprintf(stderr, "Search path too long\n");
107 strcat(search, ";" WEBSYM);
112 strcpy(search, WEBSYM); /* Use a default value */
114 if (!SymSetSearchPath(process, search)) {
|
| /external/chromium_org/v8/src/ |
| string-search.h | 13 // String Search object.
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.
78 int Search(Vector<const SubjectChar> subject, int index) {
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,
[all...] |
| /external/chromium_org/third_party/icu/source/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...] |
| /external/icu/icu4c/source/i18n/ |
| usearch.cpp | 140 * @param strsrch string search data
282 * @param strsrch string search data
354 * @param strsrch string search data
534 * consideration. Forwards search will take the end accents into consideration
535 * for the default shift values and the backwards search will take the prefix
565 * @param strsrch string search data
574 UBreakIterator *breakiterator = strsrch->search->internalBreakIter;
596 * @param strsrch string search data
605 UBreakIterator *breakiterator = strsrch->search->breakIter;
626 const UChar *text = strsrch->search->text
3193 USearch *search = strsrch->search; local
3299 USearch *search = strsrch->search; local
[all...] |
| /art/tools/ |
| generate-operator-out.py | 54 m = _ENUM_START_RE.search(raw_line)
73 m = re.compile(r'^namespace (\S+) \{').search(raw_line)
77 m = re.compile(r'^\}\s+// namespace').search(raw_line)
83 m = re.compile(r'^(?:class|struct)(?: MANAGED)? (\S+).* \{').search(raw_line)
87 m = re.compile(r'^\};').search(raw_line)
95 m = _ENUM_END_RE.search(raw_line)
105 m_comment = re.compile(r'// <<(.*?)>>').search(raw_line)
120 m = _ENUM_VALUE_RE.search(line)
133 m_literal = re.compile(r'= (0x[0-9a-f]+|-?[0-9]+|\'.\')').search(rest)
|
| /external/chromium_org/chrome/common/extensions/docs/static/js/ |
| search.js | 5 // Activate the search box:
7 var form = document.getElementById('chrome-docs-cse-search-form');
21 var element = google.search.cse.element.getElement('results');
33 // Attach autocomplete to the search box
35 google.search.CustomSearchControl.attachAutoCompletionWithOptions(
37 // set to true to prevent the search box form from being submitted, since
38 // the search control displaying the results is on the same page.
44 // Search module is loaded.
|
| samples.js | 8 var SEARCH_PREFIX = 'search:';
29 searchBox.addEventListener('search', filterSamples);
39 // If we have a #fragment that corresponds to a search, prefill the search box
|
| /external/chromium_org/chrome/browser/resources/options/ |
| language_dictionary_overlay.css | 22 #language-dictionary-overlay-search-field {
28 html[dir=rtl] #language-dictionary-overlay-search-field {
37 #language-dictionary-overlay-word-list.no-search-matches {
|
| /external/chromium_org/chrome/browser/ui/webui/options/ |
| search_engine_manager_browsertest.js | 6 * TestFixture for search engine manager WebUI testing.
16 * Browse to the search engine manager.
29 // Test opening the search engine manager has correct location.
|
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| org.apache.lucene_1.9.1.v20100518-1140.jar | |
| /external/chromium-trace/trace-viewer/third_party/web_dev_style/web_dev_style/ |
| css_checker.py | 62 return re.search(r'(?:^|\S){|{\s*\S+\s*$', line)
67 m = re.search(r'\.(-?[_a-zA-Z0-9-]+).*[,{]\s*$', line)
74 return (line.find('}') >= 0 and re.search(r'[^ }]', line) and
78 return re.search(r'(?<!data):(?!//)\S[^;]+;\s*', line)
87 m = re.search(hex_reg, line)
92 return re.search(small_seconds, line)
95 return re.search(r'\(\s*\'?\s*data:', line)
98 return re.search(r'[_a-zA-Z0-9-](?<!data):(?!//)[^;]+;\s*[^ }]\s*', line)
110 m = re.search(hex_reg, line)
114 ms = int(float(re.search(small_seconds, line).group(1)) * 1000
[all...] |
