/external/llvm/lib/Support/ |
H A D | DeltaAlgorithm.cpp | 55 if (Search(Changes, Sets, Res)) 69 bool DeltaAlgorithm::Search(const changeset_ty &Changes, function in class:DeltaAlgorithm
|
/external/swiftshader/third_party/LLVM/lib/Support/ |
H A D | DeltaAlgorithm.cpp | 55 if (Search(Changes, Sets, Res)) 69 bool DeltaAlgorithm::Search(const changeset_ty &Changes, function in class:DeltaAlgorithm
|
/external/toolchain-utils/bestflags/ |
H A D | flags.py | 41 # Search the numeric flag pattern. 42 def Search(spec): function 101 numeric_flag_match = Search(spec)
|
/external/regex-re2/re2/testing/ |
H A D | backtrack.cc | 53 bool Search(const StringPiece& text, const StringPiece& context, 62 // Search parameters 72 // Search state 94 bool Backtracker::Search(const StringPiece& text, const StringPiece& context, function in class:re2::Backtracker 123 // to text, so have to reallocate on each call to Search. 247 if (!b.Search(text, context, anchored, longest, match, nmatch))
|
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/libjpeg-turbo/doc/html/search/ |
H A D | search.js | 0 // Search script generated by doxygen 235 this.keyTimeout = setTimeout(this.name + '.Search()', 294 this.Search(); 336 this.Search = function() 417 if (searchField.value == this.searchLabel) // clear "Search" term upon entry 439 // The number of matches from the last run of <Search()>. 502 this.Search = function(search)
|
/external/icu/android_icu4j/src/main/java/android/icu/text/ |
H A D | SearchIterator.java | 95 final class Search { class in class:SearchIterator 157 Search search_ = new Search(); 494 * Search will begin at the start of the text string if a forward
|
/external/icu/icu4j/main/classes/collate/src/com/ibm/icu/text/ |
H A D | SearchIterator.java | 98 final class Search { class in class:SearchIterator 160 Search search_ = new Search(); 511 * Search will begin at the start of the text string if a forward
|
/external/regex-re2/re2/ |
H A D | bitstate.cc | 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 58 // Search state 292 // Search text (within context) for prog_. 293 bool BitState::Search(const StringPiece& text, const StringPiece& context, function in class:re2::BitState 296 // Search parameters. 371 if (!b.Search(text, context, anchored, longest, match, nmatch))
|
H A D | nfa.cc | 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, function in class:re2::NFA 454 fprintf(stderr, "NFA::Search %s (context: %s) anchored=%d longest=%d\n", 701 if (!nfa.Search(text, context, anchor == kAnchored, kind != kFirstMatch, match, nmatch))
|
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/v8/src/ |
H A D | string-search.h | 16 // String Search object. 81 int Search(Vector<const SubjectChar> subject, int index) { function in class:v8::internal::StringSearch 234 // Single Character Pattern Search Strategy 253 // Linear Search Strategy 555 // object should be constructed once and the Search function then called 563 return search.Search(subject, start_index);
|
H A D | objects.cc | 3098 map->instance_descriptors()->Search( 3976 // - Search the root of the transition tree using FindRootMap. 5090 return array->Search(*key, valid_descriptors) != DescriptorArray::kNotFound; 11022 string = Search(offset_out); 11030 String* ConsStringIterator::Search(int* offset_out) { function in class:v8::internal::__anon21760::ConsStringIterator
|
/external/webrtc/webrtc/base/ |
H A D | fileutils_mock.h | 77 return FakeDirectoryIterator::Search(std::string("")); 83 return FakeDirectoryIterator::Search(current_name); 86 bool Search(const std::string& current_name) { function in class:rtc::FakeDirectoryIterator
|
/external/vixl/src/ |
H A D | invalset-vixl.h | 136 ElementType* Search(const ElementType& element); 352 VIXL_ASSERT(Search(element) == NULL); 384 ElementType* local_element = Search(element); 394 ElementType* InvalSet<TEMPLATE_INVALSET_P_DEF>::Search( function in class:vixl::InvalSet
|
/external/clang/lib/Frontend/ |
H A D | VerifyDiagnosticConsumer.cpp | 233 bool Search(StringRef S, bool EnsureStartOfWord = false) { function in class:__anon1349::ParseHelper 316 // Search for token: expected 317 if (!PH.Search("expected", true)) 393 } else if (PP && PH.Search(":")) { 470 // Search for token: }}
|
/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/guice/extensions/persist/lib/ |
H A D | hibernate-search.jar | META-INF/ META-INF/MANIFEST.MF org/ org/hibernate/ org/hibernate/search/ org/hibernate/search/annotations/ ... |