| /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/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/ceres-solver/internal/ceres/ |
| line_search.cc | 95 *error = string("Invalid line search algorithm type: ") +
97 string(", unable to create line search.");
165 // We are expanding the search (during a Wolfe bracketing phase) using
222 void ArmijoLineSearch::Search(const double step_size_estimate,
244 // As the Armijo line search algorithm always uses the initial point, for
274 StringPrintf("Line search failed: Armijo failed to find a point "
293 StringPrintf("Line search failed: step_size too small: %.5e "
323 void WolfeLineSearch::Search(const double step_size_estimate,
389 << "Starting line search zoom phase with bracket_low: "
544 // We have shrunk the search bracket to a width less than our tolerance
[all...] |
| /external/chromium-trace/catapult/third_party/closure_linter/closure_linter/ |
| tokenutil.py | 107 the search.
108 distance: The number of tokens to look through before failing search. Must
109 be positive. If unspecified, will search until the end of the token
111 reverse: When true, search the tokens before this one instead of the tokens
148 def Search(start_token, token_types, distance=None, reverse=False):
154 distance: The number of tokens to look through before failing search. Must
155 be positive. If unspecified, will search until the end of the token
157 reverse: When true, search the tokens before this one instead of the tokens
174 distance: The number of tokens to look through before failing search. Must
175 be positive. If unspecified, will search until the end of the toke
[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/pcre/dist/ |
| pcregexp.pas | 78 function Search(AStr: Pchar; ALen : longint) : boolean; virtual;
530 function TpcRegExp.Search( AStr: Pchar; ALen : longint):boolean;
533 Search:=SearchNext(AStr,ALen);
741 if Search(nil,I) then
773 pcGrepMatch:=PpcRE^.Search(pchar(AStr),Length(AStr));
782 if PpcRE^.Search(pchar(AStr),Length(AStr)) then
794 pcFastGrepMatch:=PpcRE^.Search(pchar(AStr),Length(AStr));
802 if PpcRE^.Search(pchar(AStr),Length(AStr)) then
|
| /external/libjpeg-turbo/doc/html/search/ |
| search.js | 0 // Search script generated by doxygen
32 function convertToId(search)
35 for (i=0;i<search.length;i++)
37 var c = search.charAt(i);
83 /* A class handling everything associated with the search panel.
133 // Called when focus is added or removed from the search field.
151 // show search selection popup
163 // show search selection popup
184 // Called when the content of the search field is changed.
217 else if (e.keyCode==27) // Escape out of the search fiel
[all...] |
| /external/webrtc/webrtc/base/ |
| fileutils_mock.h | 77 return FakeDirectoryIterator::Search(std::string(""));
83 return FakeDirectoryIterator::Search(current_name);
86 bool Search(const std::string& current_name) {
|
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| SearchIterator.java | 15 * methods to search for a pattern within a text string. Instances of
21 * Subclasses provide concrete implementations of various search algorithms.
93 final class Search {
103 /** Flag to indicate if overlapping search is to be done.
131 /** Flag indicates if we are doing a forwards search */
134 /** Flag indicates if we are at the start of a string search.
135 This indicates that we are in forward search and at the start of m_text. */
155 Search search_ = new Search();
173 * Sets the position in the target text at which the next search will start
[all...] |
| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/text/ |
| SearchIterator.java | 14 * methods to search for a pattern within a text string. Instances of
20 * Subclasses provide concrete implementations of various search algorithms.
96 final class Search {
106 /** Flag to indicate if overlapping search is to be done.
134 /** Flag indicates if we are doing a forwards search */
137 /** Flag indicates if we are at the start of a string search.
138 This indicates that we are in forward search and at the start of m_text. */
158 Search search_ = new Search();
177 * Sets the position in the target text at which the next search will start
[all...] |
| /external/v8/src/ |
| string-search.h | 16 // String Search object.
19 // Class holding constants and methods that apply to all string search variants,
25 // search will not be optimal, since we only build tables for a suffix
35 // there is no search speed degradation.
81 int Search(Vector<const SubjectChar> subject, int index) {
108 static int SingleCharSearch(StringSearch<PatternChar, SubjectChar>* search,
112 static int LinearSearch(StringSearch<PatternChar, SubjectChar>* search,
116 static int InitialSearch(StringSearch<PatternChar, SubjectChar>* search,
121 StringSearch<PatternChar, SubjectChar>* search,
125 static int BoyerMooreSearch(StringSearch<PatternChar, SubjectChar>* search,
[all...] |
| objects.cc | 48 #include "src/string-search.h"
[all...] |
| /external/vixl/src/vixl/ |
| invalset.h | 56 // structure to provide fast insertion *and* fast search and deletion
62 // the case) and perform a binary search. When deleting an element we do not
123 ElementType* Search(const ElementType& element);
283 VIXL_ASSERT(Search(element) == NULL);
315 ElementType* local_element = Search(element);
323 ElementType* InvalSet<TEMPLATE_INVALSET_P_DEF>::Search(
435 // Perform a binary search through the elements while ignoring invalid
|
| /external/clang/lib/Frontend/ |
| VerifyDiagnosticConsumer.cpp | 235 bool Search(StringRef S, bool EnsureStartOfWord = false) {
237 P = std::search(C, End, S.begin(), S.end());
248 // Otherwise, skip and search again.
277 // Advance 1-past previous next/search.
278 // Behavior is undefined if previous next/search failed.
301 const char *PEnd; // previous next/search subject end (1-past)
318 // Search for token: expected
319 if (!PH.Search("expected", true))
395 } else if (PP && PH.Search(":")) {
472 // Search for token: }
[all...] |
| /art/tools/ |
| cpplint.py | 378 matched = _RE_SUPPRESSION.search(raw_line)
415 # The regexp compilation caching is inlined in both Match and Search for
423 def Search(pattern, s):
427 return _regexp_compile_cache[pattern].search(s)
[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...] |
| /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...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| winternl.h | 587 UCHAR Search;
[all...] |
| /external/guice/extensions/persist/lib/ |
| hibernate-search.jar | |
| /prebuilts/tools/common/m2/repository/org/jetbrains/kotlin/kdoc/0.12.613/ |
| kdoc-0.12.613.jar | |
