| /prebuilts/go/darwin-x86/src/sort/ |
| search.go | 5 // This file implements binary search.
9 // Search uses binary search to find and return the smallest index i
11 // f(i) == true implies f(i+1) == true. That is, Search requires that
13 // and then true for the (possibly empty) remainder; Search returns
14 // the first true index. If there is no such index, Search returns n.
17 // Search calls f(i) only for i in the range [0, n).
19 // A common use of Search is to find the index i for a value x in
26 // the call Search(len(data), func(i int) bool { return data[i] >= 23 })
38 // i := sort.Search(len(data), func(i int) bool { return data[i] >= x }
[all...] |
| /prebuilts/go/linux-x86/src/sort/ |
| search.go | 5 // This file implements binary search.
9 // Search uses binary search to find and return the smallest index i
11 // f(i) == true implies f(i+1) == true. That is, Search requires that
13 // and then true for the (possibly empty) remainder; Search returns
14 // the first true index. If there is no such index, Search returns n.
17 // Search calls f(i) only for i in the range [0, n).
19 // A common use of Search is to find the index i for a value x in
26 // the call Search(len(data), func(i int) bool { return data[i] >= 23 })
38 // i := sort.Search(len(data), func(i int) bool { return data[i] >= x }
[all...] |
| /external/llvm/lib/Support/ |
| DeltaAlgorithm.cpp | 55 if (Search(Changes, Sets, Res))
69 bool DeltaAlgorithm::Search(const changeset_ty &Changes,
|
| /external/swiftshader/third_party/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/toolchain-utils/bestflags/ |
| flags.py | 41 # Search the numeric flag pattern.
42 def Search(spec):
43 return rx.search(spec)
101 numeric_flag_match = Search(spec)
|
| /device/linaro/bootloader/edk2/ShellPkg/Library/UefiShellDebug1CommandsLib/Edit/ |
| MainTextEditor.c | 113 search string in file buffer
125 search string in file buffer, and replace it with another str
540 search string in file buffer
557 // Below is the scenario of Search command:
558 // 1. An Input Bar will be prompted : "Enter Search String:".
559 // IF user press ESC, Search command ends.
560 // IF user just press Enter, Search command ends.
561 // IF user inputs the search string, do Step 2.
563 // 2. IF input search string is found, cursor will move to the first
565 // IF input search string is not found, a Status String
[all...] |
| /external/libjpeg-turbo/doc/html/search/ |
| search.js | 0 // Search script generated by doxygen
32 function convertToId(search)
35 for (i=0;i<search.length;i++)
37 var c = search.charAt(i);
83 /* A class handling everything associated with the search panel.
133 // Called when focus is added or removed from the search field.
151 // show search selection popup
163 // show search selection popup
184 // Called when the content of the search field is changed.
217 else if (e.keyCode==27) // Escape out of the search fiel
[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/icu/android_icu4j/src/main/java/android/icu/text/ |
| SearchIterator.java | 17 * methods to search for a pattern within a text string. Instances of
23 * Subclasses provide concrete implementations of various search algorithms.
95 final class Search {
105 /** Flag to indicate if overlapping search is to be done.
133 /** Flag indicates if we are doing a forwards search */
136 /** Flag indicates if we are at the start of a string search.
137 This indicates that we are in forward search and at the start of m_text. */
157 Search search_ = new Search();
175 * 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 | 16 * methods to search for a pattern within a text string. Instances of
22 * Subclasses provide concrete implementations of various search algorithms.
98 final class Search {
108 /** Flag to indicate if overlapping search is to be done.
136 /** Flag indicates if we are doing a forwards search */
139 /** Flag indicates if we are at the start of a string search.
140 This indicates that we are in forward search and at the start of m_text. */
160 Search search_ = new Search();
179 * Sets the position in the target text at which the next search will start
[all...] |
| /external/v8/src/ |
| string-search.h | 16 // String Search object.
19 // Class holding constants and methods that apply to all string search variants,
25 // search will not be optimal, since we only build tables for a suffix
35 // there is no search speed degradation.
81 int Search(Vector<const SubjectChar> subject, int index) {
108 static int SingleCharSearch(StringSearch<PatternChar, SubjectChar>* search,
112 static int LinearSearch(StringSearch<PatternChar, SubjectChar>* search,
116 static int InitialSearch(StringSearch<PatternChar, SubjectChar>* search,
121 StringSearch<PatternChar, SubjectChar>* search,
125 static int BoyerMooreSearch(StringSearch<PatternChar, SubjectChar>* search,
[all...] |
| objects.cc | 64 #include "src/string-search.h"
[all...] |
| /external/vixl/src/ |
| invalset-vixl.h | 56 // structure to provide fast insertion *and* fast search and deletion
62 // the case) and perform a binary search. When deleting an element we do not
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(
505 // Perform a binary search through the elements while ignoring invalid
|
| /external/clang/lib/Frontend/ |
| VerifyDiagnosticConsumer.cpp | 233 bool Search(StringRef S, bool EnsureStartOfWord = false) {
235 P = std::search(C, End, S.begin(), S.end());
246 // Otherwise, skip and search again.
275 // Advance 1-past previous next/search.
276 // Behavior is undefined if previous next/search failed.
299 const char *PEnd; // previous next/search subject end (1-past)
316 // Search for token: expected
317 if (!PH.Search("expected", true))
393 } else if (PP && PH.Search(":")) {
470 // Search for token: }
[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...] |
| /external/google-styleguide/cpplint/ |
| cpplint.py | 590 matched = Search(r'\bNOLINT(NEXTLINE)?\b(\([^)]+\))?', raw_line)
619 if _SEARCH_C_FILE.search(line):
622 if _SEARCH_KERNEL_FILE.search(line):
653 # The regexp compilation caching is inlined in both Match and Search for
664 The compiled regex is kept in a cache shared by Match and Search.
669 s: search string
679 def Search(pattern, s):
683 return _regexp_compile_cache[pattern].search(s)
[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...] |
| /tools/repohooks/tools/ |
| cpplint.py | 591 matched = Search(r'\bNOLINT(NEXTLINE)?\b(\([^)]+\))?', raw_line)
620 if _SEARCH_C_FILE.search(line):
623 if _SEARCH_KERNEL_FILE.search(line):
654 # The regexp compilation caching is inlined in both Match and Search for
665 The compiled regex is kept in a cache shared by Match and Search.
670 s: search string
680 def Search(pattern, s):
684 return _regexp_compile_cache[pattern].search(s)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| winternl.h | 587 UCHAR Search;
[all...] |
| winnt.h | [all...] |
| /external/guice/extensions/persist/lib/ |
| hibernate-search.jar | |
| /prebuilts/tools/common/m2/repository/net/sourceforge/pmd/pmd/5.1.1/ |
| pmd-5.1.1.jar | |
| /external/kotlinc/lib/ |
| kotlin-compiler.jar | |
| /prebuilts/gradle-plugin/com/android/tools/external/com-intellij/intellij-core/26.0.0/ |
| intellij-core-26.0.0.jar | |
