| /external/clang/test/CXX/conv/conv.qual/ |
| pr6089.cpp | 16 void first_finder( const char*& Search )
18 make_range( Search, is_char_ptr(Search) );
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/algorithm/string/ |
| finder.hpp | 45 \param Search A substring to be searched for.
53 first_finder( const RangeT& Search )
59 is_equal>( ::boost::as_literal(Search), is_equal() ) ;
71 const RangeT& Search, PredicateT Comp )
77 PredicateT>( ::boost::as_literal(Search), Comp );
86 \param Search A substring to be searched for.
94 last_finder( const RangeT& Search )
100 is_equal>( ::boost::as_literal(Search), is_equal() );
110 last_finder( const RangeT& Search, PredicateT Comp )
116 PredicateT>( ::boost::as_literal(Search), Comp )
[all...] |
| replace.hpp | 116 Replace the first match of the search substring in the input
123 \param Search A substring to be searched for
138 const Range2T& Search,
144 ::boost::algorithm::first_finder(Search),
155 const Range1T& Search,
160 ::boost::algorithm::first_finder(Search),
166 replace the first match of the search substring in the input
170 \param Search A substring to be searched for
176 const Range1T& Search,
181 ::boost::algorithm::first_finder(Search),
[all...] |
| /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
|
| /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/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...] |
| /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/ceres-solver/internal/ceres/ |
| line_search.h | 31 // Interface for and implementation of various Line search algorithms.
48 // Line search is another name for a one dimensional optimization
49 // algorithm. The name "line search" comes from the fact one
56 // condition used, we get a variety of different line search
79 // Armijo and Wolfe line search parameters.
81 // Solving the line search problem exactly is computationally
82 // prohibitive. Fortunately, line search based optimization
84 // exact solution, the line search algorithm returns a solution
92 // In each iteration of the Armijo / Wolfe line search,
102 // In each iteration of the Armijo / Wolfe line search,
[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...] |
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/algorithm/string/detail/ |
| finder.hpp | 43 first_finderF( const SearchT& Search, PredicateT Comp ) :
44 m_Search(::boost::begin(Search), ::boost::end(Search)), m_Comp(Comp) {}
110 last_finderF( const SearchT& Search, PredicateT Comp ) :
111 m_Search(::boost::begin(Search), ::boost::end(Search)), m_Comp(Comp) {}
224 const SearchT& Search,
227 m_Search(::boost::begin(Search), ::boost::end(Search)),
|
| /external/llvm/lib/Support/ |
| DeltaAlgorithm.cpp | 55 if (Search(Changes, Sets, Res))
69 bool DeltaAlgorithm::Search(const changeset_ty &Changes,
|
| /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/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/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...] |
| /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/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/v8/test/mjsunit/ |
| string-indexof-1.js | 116 // Search for a non-ASCII string in a pure ASCII string.
121 // Search in string containing many non-ASCII chars.
125 // Search for string long enough to trigger complex search with ASCII pattern
|
| /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/v8/src/ |
| transitions.cc | 81 : array->Search(details.kind(), *name, details.attributes(),
128 : array->Search(details.kind(), *name, details.attributes(),
174 int transition = transitions->Search(kind, name, attributes);
508 new_transitions->Search(details.kind(), key, details.attributes());
544 int TransitionArray::Search(PropertyKind kind, Name* name,
|
