| /external/chromium_org/chrome/browser/resources/chromeos/chromevox/extensions/searchvox/ |
| search.js | 7 * @fileoverview Uses ChromeVox API to enhance the search experience.
10 goog.provide('cvox.Search');
21 cvox.Search = function() {
28 cvox.Search.selectors = {};
33 cvox.Search.webSelectors = {
46 cvox.Search.imageSelectors = {
55 cvox.Search.index;
58 * Array of the search results.
61 cvox.Search.results = [];
67 cvox.Search.panes = []
[all...] |
| /external/chromium_org/base/i18n/ |
| string_search.cc | 39 bool FixedPatternStringSearchIgnoringCaseAndAccents::Search(
44 // Default to basic substring search if usearch fails. According to
47 // substring search will give the correct return value.
75 return FixedPatternStringSearchIgnoringCaseAndAccents(find_this).Search(
|
| /external/chromium_org/chrome/browser/chromeos/drive/file_system/ |
| search_operation.cc | 98 void SearchOperation::Search(const std::string& search_query,
106 scheduler_->Search(
|
| /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_org/components/enhanced_bookmarks/ |
| bookmark_server_search_service.cc | 8 #include "components/enhanced_bookmarks/proto/search.pb.h"
14 "https://www.google.com/stars/search");
33 void BookmarkServerSearchService::Search(const std::string& query) {
|
| /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/chromium_org/third_party/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...] |
| /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...] |
| /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_org/chrome/browser/download/ |
| download_query_unittest.cc | 69 void Search() {
70 query_.Search(mocks_.begin(), mocks_.end(), &results_);
78 Search();
87 Search();
156 Search();
169 Search();
579 Search();
591 Search();
606 Search();
612 std::cout << "Search took " << nanos_per_item_per_filte
[all...] |
| download_query.h | 39 // query.Search(all_items.begin(), all_items.end(), &results);
98 // or malformed. Search() will filter out all DownloadItem*s that do not
101 // Search() for items whose url matches both regexes. You can also pass two
102 // different DownloadStates to AddFilter(), which will cause Search() to
110 // filtering DownloadItem*s, Search() will sort the results primarily by the
113 // to Search() yields four DownloadItems {id:0, error:0, start_time:0}, {id:1,
116 // then with (SORT_START_TIME, DESCENDING), then Search() will return items
120 // Limit the size of search results to |limit|.
126 void Search(InputIterator iter, const InputIterator last,
|
| /external/chromium_org/chrome/browser/drive/ |
| dummy_drive_service.cc | 62 CancelCallback DummyDriveService::Search(
|
| drive_api_service.cc | 274 CancelCallback DriveAPIService::Search(
|
| /external/chromium_org/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/chromium_org/third_party/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/lldb/source/Target/ |
| LanguageRuntime.cpp | 51 Search (Searcher &searcher)
55 m_filter_sp->Search (searcher);
|
| /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/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/chromium_org/chrome/browser/chromeos/drive/ |
| fake_file_system.cc | 174 void FakeFileSystem::Search(const std::string& search_query,
|
| /external/chromium_org/chrome/browser/sync_file_system/drive_backend/ |
| drive_service_on_worker.cc | 279 google_apis::CancelCallback DriveServiceOnWorker::Search(
|
| /external/chromium_org/third_party/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/chromium_org/v8/src/ |
| string-search.h | 13 // String Search object.
16 // Class holding constants and methods that apply to all string search variants,
22 // search will not be optimal, since we only build tables for a suffix
32 // there is no search speed degradation.
78 int Search(Vector<const SubjectChar> subject, int index) {
105 static int SingleCharSearch(StringSearch<PatternChar, SubjectChar>* search,
109 static int LinearSearch(StringSearch<PatternChar, SubjectChar>* search,
113 static int InitialSearch(StringSearch<PatternChar, SubjectChar>* search,
118 StringSearch<PatternChar, SubjectChar>* search,
122 static int BoyerMooreSearch(StringSearch<PatternChar, SubjectChar>* search,
[all...] |
| /external/lldb/source/Core/ |
| SearchFilter.cpp | 128 SearchFilter::Search (Searcher &searcher)
389 SearchFilterByModule::Search (Searcher &searcher)
540 SearchFilterByModuleList::Search (Searcher &searcher)
708 SearchFilterByModuleListAndCU::Search (Searcher &searcher)
|
