/external/chromium_org/chrome/browser/drive/ |
H A D | drive_api_service.cc | 274 CancelCallback DriveAPIService::Search( function in class:drive::DriveAPIService
|
H A D | fake_drive_service.cc | 97 // Search query in the title. 388 CancelCallback FakeDriveService::Search( function in class:drive::FakeDriveService
|
/external/openfst/src/include/fst/ |
H A D | matcher.h | 237 if (Search()) { 254 Search(); 306 bool Search(); 326 bool SortedMatcher<F>::Search() { function in class:fst::SortedMatcher
|
/external/chromium_org/chrome/browser/chromeos/drive/ |
H A D | file_system.cc | 761 void FileSystem::Search(const std::string& search_query, function in class:drive::FileSystem 766 search_operation_->Search(search_query, next_link, callback);
|
H A D | job_scheduler.cc | 306 void JobScheduler::Search(const std::string& search_query, function in class:drive::JobScheduler 313 &DriveServiceInterface::Search,
|
/external/clang/lib/Frontend/ |
H A D | VerifyDiagnosticConsumer.cpp | 238 bool Search(StringRef S, bool EnsureStartOfWord = false) { function in class:__anon17932::ParseHelper 321 // Search for token: expected 322 if (!PH.Search("expected", true)) 398 } else if (PP && PH.Search(":")) { 474 // Search for token: }}
|
/external/chromium_org/third_party/libvpx/source/libvpx/tools/ |
H A D | cpplint.py | 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. 532 def Search(pattern, s): function 1610 if Search(r'\bVLOG\((INFO|ERROR|WARNING|DFATAL|FATAL)\)', line): 1720 if Search('(^|[^:]):($|[^:])', clean_lines.elided[linenum]): 2115 if Search(r'printf\s*\(.*".*%[-+ ]?\d*q', line): 2119 if Search(r'printf\s*\(.*".*%\d+\$', line): 2126 if Search(r'("|\').*\\(%|\[|\(|{)', line): 2133 if Search(r'\b(const|volatile|void|char|short|int|long' 2149 if Search( [all...] |
/external/chromium_org/third_party/re2/re2/ |
H A D | dfa.cc | 77 bool Search(const StringPiece& text, const StringPiece& context, 252 // Search parameters 283 // Before each search, the parameters to Search are analyzed by 1159 // this invocation of Search() has already reset the 1749 bool DFA::Search(const StringPiece& text, function in class:re2::DFA 1913 bool matched = dfa->Search(text, context, anchored,
|
/external/chromium_org/third_party/re2/re2/testing/ |
H A D | regexp_benchmark.cc | 61 fprintf(stderr, "Search: %7lld bytes (peak=%lld)\n", mc.HeapGrowth(), mc.PeakHeapGrowth()); 150 void Search(int iters, int nbytes, const char* regexp, SearchImpl* search) { function in namespace:re2 179 void Search_Easy0_CachedDFA(int i, int n) { Search(i, n, EASY0, SearchCachedDFA); } 180 void Search_Easy0_CachedNFA(int i, int n) { Search(i, n, EASY0, SearchCachedNFA); } 181 void Search_Easy0_CachedPCRE(int i, int n) { Search(i, n, EASY0, SearchCachedPCRE); } 182 void Search_Easy0_CachedRE2(int i, int n) { Search(i, n, EASY0, SearchCachedRE2); } 191 void Search_Easy1_CachedDFA(int i, int n) { Search(i, n, EASY1, SearchCachedDFA); } 192 void Search_Easy1_CachedNFA(int i, int n) { Search(i, n, EASY1, SearchCachedNFA); } 193 void Search_Easy1_CachedPCRE(int i, int n) { Search(i, n, EASY1, SearchCachedPCRE); } 194 void Search_Easy1_CachedRE2(int i, int n) { Search( [all...] |
/external/compiler-rt/lib/sanitizer_common/scripts/ |
H A D | cpplint.py | 411 # The regexp compilation caching is inlined in both Match and Search for 419 def Search(pattern, s): function 1423 if Search('(^|[^:]):($|[^:])', clean_lines.elided[linenum]): 1782 if Search(r'printf\s*\(.*".*%[-+ ]?\d*q', line): 1786 if Search(r'printf\s*\(.*".*%\d+\$', line): 1793 if Search(r'("|\').*\\(%|\[|\(|{)', line): 1800 if Search(r'\b(const|volatile|void|char|short|int|long' 1816 if Search(r'(\w+|[+-]?\d+(\.\d*)?)\s*(<|>)\?=?\s*(\w+|[+-]?\d+)(\.\d*)?', 1821 if Search(r'^\s*const\s*string\s*&\s*\w+\s*;', line): 1876 match = Search(patter [all...] |
/external/libvpx/libvpx/tools/ |
H A D | cpplint.py | 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. 532 def Search(pattern, s): function 1610 if Search(r'\bVLOG\((INFO|ERROR|WARNING|DFATAL|FATAL)\)', line): 1720 if Search('(^|[^:]):($|[^:])', clean_lines.elided[linenum]): 2115 if Search(r'printf\s*\(.*".*%[-+ ]?\d*q', line): 2119 if Search(r'printf\s*\(.*".*%\d+\$', line): 2126 if Search(r'("|\').*\\(%|\[|\(|{)', line): 2133 if Search(r'\b(const|volatile|void|char|short|int|long' 2149 if Search( [all...] |
/external/regex-re2/re2/ |
H A D | dfa.cc | 75 bool Search(const StringPiece& text, const StringPiece& context, 250 // Search parameters 281 // Before each search, the parameters to Search are analyzed by 1157 // this invocation of Search() has already reset the 1747 bool DFA::Search(const StringPiece& text, function in class:re2::DFA 1911 bool matched = dfa->Search(text, context, anchored,
|
/external/regex-re2/re2/testing/ |
H A D | regexp_benchmark.cc | 61 fprintf(stderr, "Search: %7lld bytes (peak=%lld)\n", mc.HeapGrowth(), mc.PeakHeapGrowth()); 150 void Search(int iters, int nbytes, const char* regexp, SearchImpl* search) { function in namespace:re2 179 void Search_Easy0_CachedDFA(int i, int n) { Search(i, n, EASY0, SearchCachedDFA); } 180 void Search_Easy0_CachedNFA(int i, int n) { Search(i, n, EASY0, SearchCachedNFA); } 181 void Search_Easy0_CachedPCRE(int i, int n) { Search(i, n, EASY0, SearchCachedPCRE); } 182 void Search_Easy0_CachedRE2(int i, int n) { Search(i, n, EASY0, SearchCachedRE2); } 191 void Search_Easy1_CachedDFA(int i, int n) { Search(i, n, EASY1, SearchCachedDFA); } 192 void Search_Easy1_CachedNFA(int i, int n) { Search(i, n, EASY1, SearchCachedNFA); } 193 void Search_Easy1_CachedPCRE(int i, int n) { Search(i, n, EASY1, SearchCachedPCRE); } 194 void Search_Easy1_CachedRE2(int i, int n) { Search( [all...] |
/external/chromium_org/v8/src/ |
H A D | objects-inl.h | 1873 int transition = transitions->Search(*key); 2822 int Search(T* array, Name* name, int valid_entries) { function in namespace:v8::internal 2846 int DescriptorArray::Search(Name* name, int valid_descriptors) { function in class:v8::internal::DescriptorArray 2847 return internal::Search<VALID_ENTRIES>(this, name, valid_descriptors); 2859 number = Search(name, number_of_own_descriptors); 5157 int index = transitions()->Search(GetHeap()->elements_transition_symbol()); 5176 if (HasTransitionArray()) return transitions()->Search(name); 5229 int new_target_index = transition_array->Search(key);
|
H A D | objects.cc | 1717 map->instance_descriptors()->Search( 2190 int transition = transitions->Search(key); 2238 int transition = transitions->Search(name); 2365 // - Search the root of the transition tree using FindRootMap. 3129 return array->Search(*key, valid_descriptors) != DescriptorArray::kNotFound; 8205 string = Search(offset_out); 8213 String* ConsStringIteratorOp::Search(int* offset_out) { function in class:v8::internal::ConsStringIteratorOp 8459 position = search.Search(src, position);
|