| /external/llvm/lib/Support/ |
| DeltaAlgorithm.cpp | 55 if (Search(Changes, Sets, Res))
69 bool DeltaAlgorithm::Search(const changeset_ty &Changes,
|
| /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/ |
| tokenutil.py | 106 the search.
107 distance: The number of tokens to look through before failing search. Must
108 be positive. If unspecified, will search until the end of the token
110 reverse: When true, search the tokens before this one instead of the tokens
147 def Search(start_token, token_types, distance=None, reverse=False):
153 distance: The number of tokens to look through before failing search. Must
154 be positive. If unspecified, will search until the end of the token
156 reverse: When true, search the tokens before this one instead of the tokens
173 distance: The number of tokens to look through before failing search. Must
174 be positive. If unspecified, will search until the end of the toke
[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/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...] |
| dfa.cc | 5 // A DFA (deterministic finite automaton)-based regular expression search.
7 // The DFA search has two main parts: the construction of the automaton,
73 // If the DFA cannot complete the search (for example, if it is out of
75 bool Search(const StringPiece& text, const StringPiece& context,
250 // Search parameters
273 bool failed; // "out" parameter: whether search gave up
281 // Before each search, the parameters to Search are analyzed by
291 // the other search parameters. Returns true on success,
297 // The generic search loop, inlined to create specialized versions
[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...] |
| objects-inl.h | [all...] |
| /packages/apps/Exchange/exchange2/src/com/android/exchange/adapter/ |
| Search.java | 48 * Implementation of server-side search for EAS using the EmailService API
50 public class Search {
51 // The shortest search query we'll accept
89 // If this isn't an inbox search, then include the collection id
112 EasResponse resp = svc.sendHttpClientPost("Search", s.toByteArray());
125 svc.userLog("Search returned " + code);
131 svc.userLog("Search exception " + e);
148 * Parse the result of a Search command
176 Log.d(Logging.LOG_TAG, "Search status: " + status);
220 mService.userLog("Saved " + ops.size() + " search results")
[all...] |
| /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/openfst/src/include/fst/ |
| matcher.h | 34 // map or search keyed on labels. More generally, they may
146 // Labels >= binary_label will be searched for by binary search,
147 // o.w. linear search is used.
237 if (Search()) {
254 Search();
306 bool Search();
312 Label binary_label_; // Least label for binary search
326 bool SortedMatcher<F>::Search() {
331 // Binary search for match.
360 // Linear search for match
[all...] |
| /frameworks/base/tools/aidl/ |
| Type.cpp | [all...] |
| /external/llvm/lib/Analysis/ |
| ScalarEvolutionExpander.cpp | [all...] |
| /external/chromium/chrome/browser/ui/ |
| browser.cc | [all...] |
