HomeSort by relevance Sort by last modified time
    Searched refs:search (Results 26 - 50 of 593) sorted by null

12 3 4 5 6 7 8 91011>>

  /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/
StackTest.java 128 * @tests java.util.Stack#search(java.lang.Object)
131 // Test for method int java.util.Stack.search(java.lang.Object)
138 assertEquals("Search returned incorrect value for equivalent object", 3, s
139 .search(item1));
140 assertEquals("Search returned incorrect value for equal object", 3, s
141 .search("Ichi"));
143 assertEquals("Search returned incorrect value for equivalent object at top of stack",
144 1, s.search(item2));
145 assertEquals("Search returned incorrect value for equal object at top of stack",
146 1, s.search("Ni"))
    [all...]
  /external/v8/src/
string-search.h 36 // String Search object.
39 // Class holding constants and methods that apply to all string search variants,
45 // search will not be optimal, since we only build tables for a suffix
55 // there is no search speed degradation.
101 int Search(Vector<const SubjectChar> subject, int index) {
128 static int SingleCharSearch(StringSearch<PatternChar, SubjectChar>* search,
132 static int LinearSearch(StringSearch<PatternChar, SubjectChar>* search,
136 static int InitialSearch(StringSearch<PatternChar, SubjectChar>* search,
141 StringSearch<PatternChar, SubjectChar>* search,
145 static int BoyerMooreSearch(StringSearch<PatternChar, SubjectChar>* search,
    [all...]
  /external/webkit/Source/JavaScriptCore/tests/mozilla/ecma/String/
15.5.4.7-3.js 32 so as to search all of the string.
115 function LastIndexOf( string, search, position ) {
117 search = String( search );
129 result7 = search.length;
142 if ( string.charAt(k+j) != search.charAt(j) ){
  /external/icu4c/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/icu4c/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/chrome/common/extensions/docs/css/
print.css 3 div#gsc-search-box {display: none;}
  /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...]
  /external/v8/tools/
run-valgrind.py 64 if LEAK_LINE_MATCHER.search(line):
66 if not LEAK_OKAY_MATCHER.search(line):
  /external/llvm/utils/
DSAclean.py 23 if re.compile("label(\s*)=(\s*)\"\s%tmp(.\w*)*(\s*)\"").search(buffer):
  /external/webkit/Tools/Scripts/webkitpy/tool/
grammar.py 35 if re.search("h$", noun):
  /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/webkit/Tools/Scripts/webkitpy/style/checkers/
changelog.py 49 if re.search("Unreviewed", line, re.IGNORECASE):
51 if re.search("build", line, re.IGNORECASE) and re.search("fix", line, re.IGNORECASE):
cpp.py 144 def search(pattern, s): function
148 return _regexp_compile_cache[pattern].search(s)
188 matched = search(pattern, s)
    [all...]
  /external/icu4c/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...]
  /external/icu4c/test/perf/strsrchperf/
strsrchperf.h 56 StringSearchPerfFunction(StrSrchFn func, BoyerMooreSearch *search, const UChar *source, int32_t sourceLen, const UChar *pattern, int32_t patternLen) {
62 bms = search;
65 StringSearchPerfFunction(StrSrchFn func, UStringSearch* search, const UChar* source,int32_t sourceLen, const UChar* pattern, int32_t patternLen) {
71 srch = search;
104 while (bms->search(offset, start, end)) {
112 /* NOTE: No Boyer-Moore backward search yet... */
113 while (bms->search(offset, start, end)) {
  /packages/apps/Email/src/org/apache/commons/io/
IOCase.java 206 * @param search the start to search for, not null
210 public boolean checkRegionMatches(String str, int strStartIndex, String search) {
211 return str.regionMatches(!sensitive, strStartIndex, search, 0, search.length());
  /bionic/libc/upstream-netbsd/libc/stdlib/
tfind.c 4 * Tree search generalized from Knuth (6.2.2) Algorithm T just like
22 #include <search.h>
  /external/chromium/android/
prefix.h 37 using std::search;
  /packages/apps/Browser/src/com/android/browser/preferences/
LabPreferencesFragment.java 26 import com.android.browser.search.SearchEngine;
  /external/icu4c/samples/strsrch/
strsrch.cpp 60 UStringSearch * search = 0; variable
227 * Creates a string search
234 search = usearch_openFromCollator(pattern, -1, source, -1, collator, NULL,
240 usearch_setAttribute(search, USEARCH_OVERLAP, USEARCH_ON, &status);
243 usearch_setAttribute(search, USEARCH_CANONICAL_MATCH, USEARCH_ON,
247 fprintf(stderr, "Error setting search attributes\n");
256 int32_t offset = usearch_next(search, &status);
262 usearch_getMatchedLength(search));
263 offset = usearch_next(search, &status);
269 fprintf(stdout, "End of search\n")
    [all...]
  /external/webkit/Source/WebCore/workers/
WorkerLocation.idl 41 readonly attribute DOMString search;
  /external/webkit/Tools/Scripts/webkitpy/common/config/
build.py 114 if re.search(r"(?:^|/)%s/" % directory, file):
119 if re.search(pattern, file):

Completed in 522 milliseconds

12 3 4 5 6 7 8 91011>>