| /external/regex-re2/re2/ |
| 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/chromium_org/chrome/browser/chromeos/drive/ |
| file_system.cc | 761 void FileSystem::Search(const std::string& search_query,
766 search_operation_->Search(search_query, next_link, callback);
[all...] |
| job_scheduler.cc | 306 void JobScheduler::Search(const std::string& search_query,
313 &DriveServiceInterface::Search,
[all...] |
| /external/chromium_org/chrome/browser/devtools/ |
| devtools_file_system_indexer.cc | 62 vector<FilePath> Search(string query);
171 vector<FilePath> Index::Search(string query) {
484 vector<FilePath> file_paths = g_trigram_index.Get().Search(query);
|
| /external/clang/lib/Frontend/ |
| VerifyDiagnosticConsumer.cpp | 238 bool Search(StringRef S, bool EnsureStartOfWord = false) {
240 P = std::search(C, End, S.begin(), S.end());
251 // Otherwise, skip and search again.
280 // Advance 1-past previous next/search.
281 // Behavior is undefined if previous next/search failed.
304 const char *PEnd; // previous next/search subject end (1-past)
321 // Search for token: expected
322 if (!PH.Search("expected", true))
398 } else if (PP && PH.Search(":")) {
474 // Search for token: }
[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/chromium_org/chrome/browser/drive/ |
| fake_drive_service.cc | 69 // Returns true if the entry matches with the search query.
72 // - AND search for multiple words/phrases segmented by space
73 // - Limited attribute search. Only "title:" is supported.
97 // Search query in the title.
362 std::string(), // empty search query
379 std::string(), // empty search query
388 CancelCallback FakeDriveService::Search(
413 // Note: the search implementation here doesn't support quotation unescape,
432 std::string(), // empty search query
[all...] |
| /art/tools/ |
| cpplint.py | 374 matched = _RE_SUPPRESSION.search(raw_line)
411 # The regexp compilation caching is inlined in both Match and Search for
419 def Search(pattern, s):
423 return _regexp_compile_cache[pattern].search(s)
[all...] |
| /external/chromium_org/third_party/libvpx/source/libvpx/tools/ |
| cpplint.py | 469 matched = _RE_SUPPRESSION.search(raw_line)
506 # The regexp compilation caching is inlined in both Match and Search for
517 The compiled regex is kept in a cache shared by Match and Search.
522 s: search string
532 def Search(pattern, s):
536 return _regexp_compile_cache[pattern].search(s)
[all...] |
| /external/chromium_org/third_party/re2/re2/ |
| 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,
75 // If the DFA cannot complete the search (for example, if it is out of
77 bool Search(const StringPiece& text, const StringPiece& context,
252 // Search parameters
275 bool failed; // "out" parameter: whether search gave up
283 // Before each search, the parameters to Search are analyzed by
293 // the other search parameters. Returns true on success,
299 // The generic search loop, inlined to create specialized versions
[all...] |
| /external/chromium_org/third_party/re2/re2/testing/ |
| 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/compiler-rt/lib/sanitizer_common/scripts/ |
| cpplint.py | 374 matched = _RE_SUPPRESSION.search(raw_line)
411 # The regexp compilation caching is inlined in both Match and Search for
419 def Search(pattern, s):
423 return _regexp_compile_cache[pattern].search(s)
[all...] |
| /external/libvpx/libvpx/tools/ |
| cpplint.py | 469 matched = _RE_SUPPRESSION.search(raw_line)
506 # The regexp compilation caching is inlined in both Match and Search for
517 The compiled regex is kept in a cache shared by Match and Search.
522 s: search string
532 def Search(pattern, s):
536 return _regexp_compile_cache[pattern].search(s)
[all...] |
| /external/regex-re2/re2/testing/ |
| 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...] |
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/tools/ |
| cpplint.py | 469 matched = _RE_SUPPRESSION.search(raw_line)
506 # The regexp compilation caching is inlined in both Match and Search for
517 The compiled regex is kept in a cache shared by Match and Search.
522 s: search string
532 def Search(pattern, s):
536 return _regexp_compile_cache[pattern].search(s)
[all...] |
| /external/chromium_org/v8/src/ |
| objects-inl.h | [all...] |
| objects.cc | 35 #include "src/string-search.h"
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| winternl.h | 587 UCHAR Search;
[all...] |
| winnt.h | [all...] |
| /prebuilts/misc/common/icu4j/ |
| icu4j.jar | |
