| /external/clang/test/CXX/conv/conv.qual/ |
| pr6089.cpp | 16 void first_finder( const char*& Search )
18 make_range( Search, is_char_ptr(Search) );
|
| /external/llvm/include/llvm/ADT/ |
| DeltaAlgorithm.h | 63 /// Search - Search for a subset (or subsets) in \p Sets which can be
69 bool Search(const changeset_ty &Changes, const changesetlist_ty &Sets,
73 /// UpdatedSearchState - Callback used when the search state changes.
|
| /external/llvm/autoconf/m4/ |
| check_gnu_make.m4 | 7 dnl Search all the common names for GNU make
|
| /external/llvm/projects/sample/autoconf/m4/ |
| check_gnu_make.m4 | 7 dnl Search all the common names for GNU make
|
| /frameworks/ex/common/java/com/android/common/ |
| Search.java | 27 * Utilities for search implementations.
31 public class Search {
34 * Key for the source identifier set by the application that launched a search intent.
35 * The identifier is search-source specific string. It can be used
36 * by the search provider to keep statistics of where searches are started from.
55 private Search() { } // don't instantiate
58 * Gets a cursor with search suggestions.
61 * @param query The search text entered (so far).
69 * Gets a cursor with search suggestions.
72 * @param query The search text entered (so far)
[all...] |
| /external/chromium-trace/trace-viewer/third_party/closure_linter/closure_linter/ |
| closurizednamespacesinfo.py | 138 namespace = tokenutil.Search(token, TokenType.STRING_TEXT).string
167 namespace = tokenutil.Search(token, TokenType.STRING_TEXT).string
309 namespace = tokenutil.Search(token, TokenType.STRING_TEXT).string
324 namespace = tokenutil.Search(token, TokenType.STRING_TEXT).string
361 doc_start = tokenutil.Search(token, TokenType.DOC_START_BRACE)
362 interface = tokenutil.Search(doc_start, TokenType.COMMENT)
382 # Search backward to determine if this token is the first token of the
395 # Search forward to find other parts of this identifier separated by white
|
| requireprovidesorter.py | 196 name = tokenutil.Search(token, Type.STRING_TEXT).string
231 object_name = tokenutil.Search(token, Type.STRING_TEXT).string
|
| /external/llvm/lib/Support/ |
| DeltaAlgorithm.cpp | 55 if (Search(Changes, Sets, Res))
69 bool DeltaAlgorithm::Search(const changeset_ty &Changes,
|
| /frameworks/base/tools/aidl/ |
| generate_java_rpc.cpp | 178 Type* t = NAMES.Search(arg->type.type.data);
210 Type* returnType = NAMES.Search(method->type.type.data);
241 Type* t = NAMES.Search(arg->type.type.data);
653 resultMethod->parameters.push_back(new Variable(NAMES.Search(method->type.type.data),
660 NAMES.Search(arg->type.type.data), arg->name.data,
699 Type* t = NAMES.Search(arg->type.type.data);
760 Type* t = NAMES.Search(method->type.type.data);
775 Type* t = NAMES.Search(arg->type.type.data);
819 decl->returnType = NAMES.Search(method->type.type.data);
825 NAMES.Search(arg->type.type.data), arg->name.data
[all...] |
| generate_java_binder.cpp | 275 decl->returnType = NAMES.Search(method->type.type.data);
282 NAMES.Search(arg->type.type.data), arg->name.data,
306 Type* t = NAMES.Search(arg->type.type.data);
367 Type* t = NAMES.Search(arg->type.type.data);
388 proxy->returnType = NAMES.Search(method->type.type.data);
395 NAMES.Search(arg->type.type.data), arg->name.data,
434 Type* t = NAMES.Search(arg->type.type.data);
477 Type* t = NAMES.Search(arg->type.type.data);
|
| /packages/apps/QuickSearchBox/src/com/android/quicksearchbox/google/ |
| GoogleSearch.java | 19 import com.android.common.Search;
40 * This class is purely here to get search queries and route them to
47 // Used to figure out which domain to base search requests
51 // "source" parameter for Google search requests from unknown sources (e.g. apps). This will get
115 Log.w(TAG, "Got search intent with no query.");
123 source = appSearchData.getString(Search.SOURCE);
127 // window to place a new search into. So if this exists, we'll pass it back to
|
| /external/regex-re2/re2/ |
| bitstate.cc | 7 // Prog::SearchBitState is a regular expression search with submatch
12 // limits the search to run in time linear in the length of the text.
36 // The usual Search prototype.
37 // Can only call Search once per BitState.
38 bool Search(const StringPiece& text, const StringPiece& context,
48 // Search parameters
52 bool anchored_; // whether search is anchored at text.begin()
53 bool longest_; // whether search wants leftmost-longest match
58 // Search state
93 // Should the search visit the pair ip, p
[all...] |
| nfa.cc | 7 // Prog::SearchNFA, an NFA search.
50 bool Search(const StringPiece& text, const StringPiece& context,
116 Threadq q0_, q1_; // pre-allocated for Search.
400 bool NFA::Search(const StringPiece& text, const StringPiece& const_context,
435 // Save search parameters.
454 fprintf(stderr, "NFA::Search %s (context: %s) anchored=%d longest=%d\n",
459 // Set up search.
566 // If there's a required first byte for an unanchored search
568 // use memchr to search for the byte quickly.
701 if (!nfa.Search(text, context, anchor == kAnchored, kind != kFirstMatch, match, nmatch)
[all...] |
| /external/regex-re2/re2/testing/ |
| backtrack.cc | 7 // Prog::BadSearchBacktrack is a backtracking regular expression search,
17 // - It implements unanchored search by repeated anchored search.
32 // Backtracker holds the state for a backtracking search.
34 // Excluding the search parameters, the main search state
47 // and it has the nice benefit of making the search run in linear time.
53 bool Search(const StringPiece& text, const StringPiece& context,
62 // Search parameters
66 bool anchored_; // whether search is anchored at text.begin(
[all...] |
| regexp_benchmark.cc | 61 fprintf(stderr, "Search: %7lld bytes (peak=%lld)\n", mc.HeapGrowth(), mc.PeakHeapGrowth());
133 // Benchmark: failed search for regexp in random text.
135 // Generate random text that won't contain the search string,
136 // to test worst-case search behavior.
148 // Makes text of size nbytes, then calls run to search
150 void Search(int iters, int nbytes, const char* regexp, SearchImpl* search) {
156 search(iters, regexp, s, Prog::kUnanchored, false);
161 // giving the search loop something to memchr for.
179 void Search_Easy0_CachedDFA(int i, int n) { Search(i, n, EASY0, SearchCachedDFA);
[all...] |
| /external/v8/test/mjsunit/ |
| string-indexof-1.js | 102 // Search for a non-ASCII string in a pure ASCII string.
107 // Search in string containing many non-ASCII chars.
111 // Search for string long enough to trigger complex search with ASCII pattern
|
| /external/libpng/scripts/ |
| makevms.com | 20 $ If F$Search ("Sys$System:MMS.EXE") .nes. "" Then Make = "MMS"
33 $ if f$search("SYS$SYSTEM:DECC$COMPILER.EXE").eqs.""
36 $ if f$search("SYS$SYSTEM:VAXC.EXE").eqs.""
97 $ if f$search("DESCRIP.MMS") .eqs. "" then copy/nolog [.SCRIPTS]DESCRIP.MMS []
110 $ If F$Search(P1) .Eqs. "" Then Goto Makeit
123 $ AFile = F$Search(File)
|
| /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/libpng/contrib/pngminus/ |
| makevms.com | 15 $ if f$search("SYS$SYSTEM:DECC$COMPILER.EXE").eqs.""
18 $ if f$search("SYS$SYSTEM:VAXC.EXE").eqs.""
60 $ If F$Search(P1) .Eqs. "" Then Goto Makeit
73 $ AFile = F$Search(File)
|
| /packages/apps/QuickSearchBox/src/com/android/quicksearchbox/ |
| SearchWidgetProvider.java | 19 import com.android.common.Search;
49 * Search widget provider.
58 * The {@link Search#SOURCE} value used when starting searches from the search widget.
87 * Updates all search widgets.
99 * Gets the component name of this search widget provider.
123 widgetAppData.putString(Search.SOURCE, WIDGET_SEARCH_SOURCE);
132 // Voice search button
167 // Voice Search button
|
| /external/llvm/unittests/IR/ |
| MetadataTest.cpp | 130 TEST(NamedMDNodeTest, Search) {
|
| /external/webkit/LayoutTests/fast/dom/HTMLAnchorElement/script-tests/ |
| set-href-attribute-prevents-rebase.js | 8 debug("Search attribute, update document base URI without attribute having been set");
10 a.href = "?search";
12 shouldBe("a.href", "'http://new_base/?search'");
14 debug("Search attribute, update document base URI after attribute has been set");
17 a.search = "search";
19 shouldBe("a.href", "'http://old_base/?search'");
|
| /external/clang/lib/Frontend/ |
| VerifyDiagnosticConsumer.cpp | 229 bool Search(StringRef S, bool EnsureStartOfWord = false) {
231 P = std::search(C, End, S.begin(), S.end());
242 // Otherwise, skip and search again.
247 // Advance 1-past previous next/search.
248 // Behavior is undefined if previous next/search failed.
271 const char *PEnd; // previous next/search subject end (1-past)
286 // Search for token: expected
287 if (!PH.Search("expected", true))
412 // Search for token: }}
413 if (!PH.Search("}}")) {
[all...] |
| /external/chromium/chrome/common/extensions/docs/examples/api/history/showHistory/ |
| typedUrls.js | 32 // Search history to find up to ten links that a user has typed in,
44 chrome.history.search({
|
| /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...] |
