| /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
|
| DSAclean.py | 23 if re.compile("label(\s*)=(\s*)\"\s%tmp(.\w*)*(\s*)\"").search(buffer):
|
| /external/skia/src/core/ |
| SkBBoxHierarchy.h | 33 virtual void search(const SkRect& query, SkTDArray<unsigned>* results) const = 0;
|
| /packages/apps/Settings/src/com/android/settings/search/ |
| Indexable.java | 17 package com.android.settings.search;
44 * @param enabled hint telling if the data needs to be considered into the search results
55 * @param enabled hint telling if the data needs to be considered into the search results
|
| SearchIndexableRaw.java | 17 package com.android.settings.search;
23 * Indexable raw data for Search.
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/sec_api/ |
| search_s.h | 9 #include <search.h>
|
| /external/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/icu/icu4c/source/i18n/ |
| usearch.cpp | 138 * @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->text
3191 USearch *search = strsrch->search; local
3297 USearch *search = strsrch->search; local
[all...] |
| /art/tools/ |
| generate-operator-out.py | 55 m = _ENUM_START_RE.search(raw_line)
75 m = re.compile(r'^namespace (\S+) \{').search(raw_line)
79 m = re.compile(r'^\}\s+// namespace').search(raw_line)
85 m = re.compile(r'^\s*(?:class|struct)(?: MANAGED)?(?: PACKED\([0-9]\))? (\S+).* \{').search(raw_line)
89 m = re.compile(r'^\s*\}( .*)?;').search(raw_line)
97 m = _ENUM_END_RE.search(raw_line)
110 m_comment = re.compile(r'// <<(.*?)>>').search(raw_line)
125 m = _ENUM_VALUE_RE.search(line)
138 m_literal = re.compile(r'= (0x[0-9a-f]+|-?[0-9]+|\'.\')').search(rest)
|
| /external/icu/icu4j/main/tests/collate/src/com/ibm/icu/dev/test/search/ |
| SearchTest.java | 13 package com.ibm.icu.dev.test.search;
740 StringSearch search = new StringSearch(pattern, text); local
816 SearchData search = BREAKITERATOREXACT[count]; local
860 SearchData search = BREAKITERATORCANONICAL[count]; local
1085 SearchData search = MATCH[0]; local
1198 SearchData search = BASIC[index]; local
1272 SearchData search = BASICCANONICAL[index]; local
1535 SearchData search = (OVERLAP[count]); local
1584 SearchData search = OVERLAPCANONICAL[count]; local
1750 SearchData search = MATCH[count]; local
1967 TestSearch search = new TestSearch( local
[all...] |
| /external/vixl/tools/ |
| lint.py | 135 if LINT_ERROR_LINE_REGEXP.search(line):
138 elif LINT_DONE_PROC_LINE_REGEXP.search(line):
140 elif LINT_STATUS_LINE_REGEXP.search(line):
149 res = re.search('\d+$', status_line)
193 if SIM_TRACES_REGEXP.search(filename): return False
195 return CPP_EXT_REGEXP.search(filename) != None
|
| /external/icu/icu4c/source/test/intltest/ |
| 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/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| org.apache.lucene_1.9.1.v20100518-1140.jar | |
| org.eclipse.help.base_3.5.2.v201011171123.jar | |
| /external/chromium-trace/trace-viewer/tracing/build/ |
| css_presubmit_checker.py | 55 return re.search(r'(?:^|\S){|{\s*\S+\s*$', line)
60 m = re.search(r'\.(-?[_a-zA-Z0-9-]+).*[,{]\s*$', line)
68 return (line.find('}') >= 0 and re.search(r'[^ }]', line) and
72 return re.search(r'(?<!data):(?!//)\S[^;]+;\s*', line)
82 m = re.search(hex_reg, line)
88 return re.search(small_seconds, line)
91 return re.search(r'\(\s*\'?\s*data:', line)
94 return re.search(r'[_a-zA-Z0-9-](?<!data):(?!//)[^;]+;\s*[^ }]\s*', line)
107 m = re.search(hex_reg, line)
111 ms = int(float(re.search(small_seconds, line).group(1)) * 1000
[all...] |
| /external/icu/icu4c/source/layout/ |
| OpenTypeUtilities.h | 31 static le_int32 search(le_uint16 value, const le_uint16 array[], le_int32 count);
32 static le_int32 search(le_uint32 value, const le_uint32 array[], le_int32 count);
|
| /external/v8/tools/ |
| run-valgrind.py | 64 if LEAK_LINE_MATCHER.search(line):
66 if not LEAK_OKAY_MATCHER.search(line):
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/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...] |
| /bionic/libc/upstream-openbsd/lib/libc/stdlib/ |
| tfind.c | 4 * Tree search generalized from Knuth (6.2.2) Algorithm T just like
14 #include <search.h>
|
| /packages/apps/Browser/src/com/android/browser/search/ |
| SearchEngine.java | 16 package com.android.browser.search;
23 * Interface for search engines.
27 // Used if the search engine is Google
31 * Gets the unique name of this search engine.
36 * Gets the human-readable name of this search engine.
41 * Starts a search.
46 * Gets search suggestions.
51 * Checks whether this search engine supports search suggestions.
56 * Closes this search engine
[all...] |
| /external/libpng/contrib/gregbook/ |
| makevms.com | 13 $ if f$search("[---.zlib]zlib.h").nes."" then zpath = "[---.zlib]"
14 $ if f$search("[--]png.h").nes."" then pngpath = "[--]"
16 $ if f$search("[-.zlib]zlib.h").nes."" then zpath = "[-.zlib]"
17 $ if f$search("[-.libpng]png.h").nes."" then pngpath = "[-.libpng]"
40 $ if f$search("SYS$SYSTEM:DECC$COMPILER.EXE").eqs.""
43 $ if f$search("SYS$SYSTEM:VAXC.EXE").eqs.""
100 $ If F$Search(P1) .Eqs. "" Then Goto Makeit
113 $ AFile = F$Search(File)
|
| /external/selinux/policycoreutils/sepolicy/sepolicy/ |
| communicate.py | 24 search=sepolicy.search variable
41 allows=search([sepolicy.ALLOW],{sepolicy.SOURCE:src,sepolicy.CLASS:tclass, sepolicy.PERMS:perm})
|
| network.py | 24 search=sepolicy.search variable
28 allows=search([sepolicy.ALLOW],{sepolicy.SOURCE:src,sepolicy.CLASS:tclass, sepolicy.PERMS:perm})
|
| /external/libxml2/win32/ |
| configure.js | 168 txt += " include: Additional search path for the compiler, particularily\n";
170 txt += " lib: Additional search path for the linker, particularily\n";
188 if (s.search(/^\/ChangeLog\//) != -1) {
211 if (s.search(/^LIBXML_MAJOR_VERSION=/) != -1) {
214 } else if(s.search(/^LIBXML_MINOR_VERSION=/) != -1) {
217 } else if(s.search(/^LIBXML_MICRO_VERSION=/) != -1) {
220 } else if(s.search(/^LIBXML_MICRO_VERSION_SUFFIX=/) != -1) {
296 if (s.search(/\@VERSION\@/) != -1) {
299 } else if (s.search(/\@LIBXML_VERSION_NUMBER\@/) != -1) {
302 } else if (s.search(/\@LIBXML_VERSION_EXTRA\@/) != -1)
[all...] |
| /external/icu/icu4c/source/test/cintltst/ |
| usrchtst.c | 246 log_err_status(status, "Error: NULL break iterator is valid for opening search\n");
263 log_err("Error: NULL break iterator is valid for opening search\n");
276 log_err_status(status, "Error: Break iterator is valid for opening search\n");
288 log_err("Error: Break iterator is valid for opening search\n");
318 log_err("Error opening search %s\n", u_errorName(status));
330 log_err("Error opening search %s\n", u_errorName(status));
337 const SearchData search)
341 int32_t matchindex = search.offset[count];
348 usearch_setAttribute(strsrch, USEARCH_ELEMENT_COMPARISON, search.elemCompare, &status);
360 matchlength = search.size[count]
774 const SearchData *search = &(BREAKITERATOREXACT[count]); local
881 const SearchData *search = &(OVERLAP[count]); local
1244 SearchData search = BASIC[searchDataIndex ++]; local
1407 SearchData search = MATCH[0]; local
1511 SearchData search = MATCH[count]; local
1745 SearchData search; local
1864 const SearchData *search = &(BREAKITERATORCANONICAL[count]); local
1982 const SearchData *search = &(OVERLAPCANONICAL[count]); local
2299 SearchData search = BASICCANONICAL[searchDataIndex ++]; local
2459 UStringSearch *search = NULL; local
2514 UStringSearch *search; local
2603 UStringSearch *search; local
2897 UChar search[] = local
2908 UChar search[] = local
2919 UChar search[] = { 0x00c9 }; local
[all...] |
