Searched defs:Search (Results 1 - 21 of 21) sorted by relevance

/external/llvm/lib/Support/
H A DDeltaAlgorithm.cpp55 if (Search(Changes, Sets, Res))
69 bool DeltaAlgorithm::Search(const changeset_ty &Changes, function in class:DeltaAlgorithm
/external/chromium-trace/catapult/third_party/closure_linter/closure_linter/
H A Dtokenutil.py148 def Search(start_token, token_types, distance=None, reverse=False): function
438 # Search for a goog.scope statement, which will be 5 tokens before the
590 # Search backward to determine if this token is the first token of the
661 token: Search will be done after this token.
667 Search until end of string as in case of empty string Type.STRING_TEXT is not
/external/regex-re2/re2/testing/
H A Dbacktrack.cc53 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 Dregexp_benchmark.cc61 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/pcre/dist/
H A Dpcregexp.pas78 function Search(AStr: Pchar; ALen : longint) : boolean; virtual; function
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/
H A Dsearch.js0 // 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/ceres-solver/internal/ceres/
H A Dline_search.cc222 void ArmijoLineSearch::Search(const double step_size_estimate, function in class:ceres::internal::ArmijoLineSearch
323 void WolfeLineSearch::Search(const double step_size_estimate, function in class:ceres::internal::WolfeLineSearch
/external/icu/android_icu4j/src/main/java/android/icu/text/
H A DSearchIterator.java93 final class Search { class in class:SearchIterator
155 Search search_ = new Search();
492 * 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 DSearchIterator.java96 final class Search { class in class:SearchIterator
158 Search search_ = new Search();
509 * Search will begin at the start of the text string if a forward
/external/regex-re2/re2/
H A Dbitstate.cc36 // 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 Dnfa.cc50 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 Ddfa.cc75 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 Dstring-search.h16 // 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 Dobjects.cc2603 map->instance_descriptors()->Search(
3361 // - Search the root of the transition tree using FindRootMap.
4599 return array->Search(*key, valid_descriptors) != DescriptorArray::kNotFound;
11376 string = Search(offset_out);
11384 String* ConsStringIterator::Search(int* offset_out) { function in class:v8::internal::__anon18165::ConsStringIterator
/external/vixl/src/vixl/
H A Dinvalset.h123 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( function in class:vixl::InvalSet
/external/webrtc/webrtc/base/
H A Dfileutils_mock.h77 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/clang/lib/Frontend/
H A DVerifyDiagnosticConsumer.cpp235 bool Search(StringRef S, bool EnsureStartOfWord = false) { function in class:__anon1240::ParseHelper
318 // Search for token: expected
319 if (!PH.Search("expected", true))
395 } else if (PP && PH.Search(":")) {
472 // Search for token: }}
/external/compiler-rt/lib/sanitizer_common/scripts/
H A Dcpplint.py411 # 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 Dcpplint.py506 # 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 Dhibernate-search.jarMETA-INF/ META-INF/MANIFEST.MF org/ org/hibernate/ org/hibernate/search/ org/hibernate/search/annotations/ ...
/external/opencv3/samples/java/sbt/sbt/
H A Dsbt-launch.jarmodule.properties org/apache/ivy/Ivy$1.class Ivy.java package org.apache. ...

Completed in 754 milliseconds