| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
| algorithmfwd.h | 110 search
163 * @defgroup binary_search_algorithms Binary Search
166 * These algorithms are variations of a classic binary search, and
175 * proposed resolution reinterprets binary search. Instead of
525 // search
722 search(_FIter1, _FIter1, _FIter2, _FIter2);
726 search(_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate);
|
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| algorithmfwd.h | 108 search
160 * @defgroup binary_search_algorithms Binary Search Algorithms
163 * These algorithms are variations of a classic binary search, and
172 * proposed resolution reinterprets binary search. Instead of
520 // search
713 search(_FIter1, _FIter1, _FIter2, _FIter2);
717 search(_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate);
|
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| algorithmfwd.h | 108 search
160 * @defgroup binary_search_algorithms Binary Search Algorithms
163 * These algorithms are variations of a classic binary search, and
172 * proposed resolution reinterprets binary search. Instead of
520 // search
713 search(_FIter1, _FIter1, _FIter2, _FIter2);
717 search(_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate);
|
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| algorithmfwd.h | 108 search
160 * @defgroup binary_search_algorithms Binary Search Algorithms
163 * These algorithms are variations of a classic binary search, and
172 * proposed resolution reinterprets binary search. Instead of
520 // search
713 search(_FIter1, _FIter1, _FIter2, _FIter2);
717 search(_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate);
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/bits/ |
| algorithmfwd.h | 108 search
160 * @defgroup binary_search_algorithms Binary Search Algorithms
163 * These algorithms are variations of a classic binary search, and
172 * proposed resolution reinterprets binary search. Instead of
520 // search
713 search(_FIter1, _FIter1, _FIter2, _FIter2);
717 search(_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate);
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| algorithmfwd.h | 110 search
163 * @defgroup binary_search_algorithms Binary Search
166 * These algorithms are variations of a classic binary search, and
175 * proposed resolution reinterprets binary search. Instead of
525 // search
722 search(_FIter1, _FIter1, _FIter2, _FIter2);
726 search(_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate);
|
| /build/tools/releasetools/ |
| edify_generator.py | 52 m = x.search(cmd)
|
| /external/chromium/chrome/common/extensions/docs/server/ |
| chromeextensionsdocs.py | 174 match = re.search(r'<updatecheck Version="\d+\.\d+\.(\d+)\.\d+"', result.content)
|
| /external/chromium/testing/gmock/scripts/ |
| gmock_doctor.py | 160 if re.search(regex, msg):
|
| /external/chromium/third_party/libjingle/source/talk/base/ |
| stringutils.h | 325 // Replaces all occurrences of "search" with "replace".
326 void replace_substrs(const char *search,
|
| /external/chromium-trace/trace-viewer/third_party/pywebsocket/src/mod_pywebsocket/ |
| dispatch.py | 122 if _SOURCE_PATH_PATTERN.search(path):
|
| /external/elfutils/libdw/ |
| dwarf_getlocation.c | 56 #include <search.h>
328 /* Insert a record in the search tree so that we can find it again
|
| /external/guava/guava/src/com/google/common/primitives/ |
| generate.sh | 184 * @param array the array to search for the sequence {@code target}
185 * @param target the array to search for as a sub-sequence of {@code array}
|
| /external/llvm/utils/ |
| llvm-compilers-check | 328 if re.search("End of search list", str(line)) is not None:
333 if re.search("#include <...> search starts", str(line)) is not None:
|
| /external/openfst/src/include/fst/extensions/ngram/ |
| ngram-fst.h | 818 const Label* search = lower_bound(start, end, label); local
819 if (search != end && *search == label) {
820 size_t state = search - start;
|
| /external/protobuf/gtest/test/ |
| gtest_filter_unittest.py | 311 param_tests_present = PARAM_TEST_REGEX.search(
|
| /external/skia/src/pdf/ |
| SkPDFFont.cpp | 155 // if the data was NUL terminated so that we can use strstr() to search it.
458 // typing char id 0x0014 in search box will get glyph id 0x0004 first. However,
836 // TODO(vandebo): Optimize this, do only one search?
837 FontRec search(NULL, fontID, glyphID);
838 *index = CanonicalFonts().find(search);
842 search.fGlyphID = 0;
843 *index = CanonicalFonts().find(search);
[all...] |
| /external/v8/tools/ |
| presubmit.py | 323 if not COPYRIGHT_HEADER_PATTERN.search(contents):
|
| /external/webkit/Source/WebCore/inspector/front-end/ |
| InjectedFakeWorker.js | 288 search: this.query,
|
| /frameworks/base/services/java/com/android/server/search/ |
| Searchables.java | 17 package com.android.server.search;
64 // Contains all installed activities that handle the global search
96 * <li>The activity itself implements search. This is indicated by the
98 * The value is a reference to an XML file containing search information.</li>
99 * <li>A related activity implements search. This is indicated by the
101 * The value is a string naming the activity implementing search. In this
104 * code will insert the "default" (e.g. contacts) search.
189 * refill as the user clicks "search".
252 // Find the global search activity
256 // Find the web search activit
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
| algorithmfwd.h | 337 search(_FIter1, _FIter1, _FIter2, _FIter2, __gnu_parallel::sequential_tag);
341 search(_FIter1, _FIter1, _FIter2, _FIter2);
345 search(_FIter1, _FIter1, _FIter2, _FIter2, _BiPredicate,
350 search(_FIter1, _FIter1, _FIter2, _FIter2, _BiPredicate);
|
| algo.h | 54 #include <parallel/search.h>
1028 search(ForwardIterator1 begin1, ForwardIterator1 end1, function in namespace:std::__parallel
1067 search(ForwardIterator1 begin1, ForwardIterator1 end1, function in namespace:std::__parallel
1083 search(ForwardIterator1 begin1, ForwardIterator1 end1, function in namespace:std::__parallel
1120 search(ForwardIterator1 begin1, ForwardIterator1 end1, function in namespace:std::__parallel
[all...] |
| /system/core/sdcard/ |
| sdcard.c | 233 * Performs a case-insensitive search for the file and sets the buffer to the path
234 * of the first matching file. If 'search' is zero or if no match is found, sets
241 char* buf, size_t bufsize, int search)
257 if (search && access(buf, F_OK)) {
771 int search = old_parent_node != new_parent_node local
774 new_child_path, sizeof(new_child_path), search))) {
[all...] |
| /external/chromium/net/http/ |
| http_response_headers.cc | 657 const std::string& search) const {
663 if (static_cast<size_t>(name_end - name_begin) == search.size() &&
664 std::equal(name_begin, name_end, search.begin(),
[all...] |
| /external/clang/lib/Sema/ |
| SemaDeclObjC.cpp | 2752 void search(const ObjCProtocolList &protocols) { function in class:__anon5861::OverrideSearch
2758 void search(ObjCContainerDecl *container) { function in class:__anon5861::OverrideSearch
[all...] |
