| /ndk/tests/device/test-gnustl-full/unit/ |
| bsearch_test.cpp | 35 CPPUNIT_ASSERT(binary_search(vector, vector + 100, 42));
44 CPPUNIT_ASSERT(binary_search(labels, labels + count, (const char *)"ff", str_compare));
|
| /ndk/tests/device/test-stlport/unit/ |
| bsearch_test.cpp | 35 CPPUNIT_ASSERT(binary_search(vector, vector + 100, 42));
44 CPPUNIT_ASSERT(binary_search(labels, labels + count, (const char *)"ff", str_compare));
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/binary.search/ |
| binary_search.pass.cpp | 16 // binary_search(Iter first, Iter last, const T& value);
28 assert(std::binary_search(first, last, value) == x);
|
| binary_search_comp.pass.cpp | 16 // binary_search(Iter first, Iter last, const T& value, Compare comp);
29 assert(std::binary_search(first, last, value, std::greater<int>()) == x);
|
| /external/llvm/include/llvm/Support/ |
| UnicodeCharRanges.h | 69 return std::binary_search(Ranges.begin(), Ranges.end(), C);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.binary.search/binary.search/ |
| binary_search.pass.cpp | 16 // binary_search(Iter first, Iter last, const T& value);
28 assert(std::binary_search(first, last, value) == x);
|
| binary_search_comp.pass.cpp | 16 // binary_search(Iter first, Iter last, const T& value, Compare comp);
29 assert(std::binary_search(first, last, value, std::greater<int>()) == x);
|
| /frameworks/minikin/libs/minikin/ |
| MinikinInternal.cpp | 37 return std::binary_search(generated::EMOJI_LIST, generated::EMOJI_LIST + length, c);
|
| /external/skia/tests/ |
| PathOpsCubicLineIntersectionIdeas.cpp | 54 static double binary_search(const SkDCubic& cubic, double step, const SkDPoint& pt, double t, function
219 double newT = binary_search(cubic, step, pt, t, &iters);
265 double newT = binary_search(cubic, 0.1, pt, t, &iters);
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/test/utils/ |
| fixed_mapping.hpp | 22 #include <boost/detail/binary_search.hpp>
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/detail/ |
| binary_search.hpp | 200 bool binary_search(ForwardIter first, ForwardIter last, function in namespace:boost::detail
207 bool binary_search(ForwardIter first, ForwardIter last, function in namespace:boost::detail
|
| /external/llvm/lib/Target/Mips/ |
| MipsCCState.cpp | 35 return std::binary_search(std::begin(LibCalls), std::end(LibCalls),
|
| Mips16HardFloat.cpp | 378 return std::binary_search(std::begin(IntrinsicInline),
|
| Mips16ISelLowering.cpp | 444 if (std::binary_search(std::begin(HardFloatLibCalls),
488 if (std::binary_search(std::begin(HardFloatLibCalls),
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopInstSimplify.cpp | 177 bool IsExitBlock = std::binary_search(ExitBlocks.begin(),
|
| /art/compiler/dex/ |
| verified_method.cc | 82 return std::binary_search(safe_cast_set_.begin(), safe_cast_set_.end(), pc);
|
| /art/runtime/gc/accounting/ |
| atomic_stack.h | 41 // These two comparators are for std::binary_search.
198 return std::binary_search(Begin(), End(), value, ObjectComparator());
|
| /external/v8/src/ |
| key-accumulator.cc | 90 return std::binary_search(sub_elements->begin(), sub_elements->end(), key);
|
| /external/icu/icu4c/source/test/perf/collperf/ |
| collperf.cpp | 411 binary_search(i);
416 void binary_search(int32_t random) { function in class:CmdBinSearch
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _algo.h | 479 // Binary search (lower_bound, upper_bound, equal_range, binary_search).
553 inline bool binary_search(_ForwardIter __first, _ForwardIter __last, function
564 inline bool binary_search(_ForwardIter __first, _ForwardIter __last, function
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
| algorithmfwd.h | 50 binary_search
205 binary_search(_FIter, _FIter, const _Tp&);
209 binary_search(_FIter, _FIter, const _Tp&, _Compare);
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
| algorithmfwd.h | 50 binary_search
205 binary_search(_FIter, _FIter, const _Tp&);
209 binary_search(_FIter, _FIter, const _Tp&, _Compare);
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| algorithmfwd.h | 50 binary_search
205 binary_search(_FIter, _FIter, const _Tp&);
209 binary_search(_FIter, _FIter, const _Tp&, _Compare);
|
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| algorithmfwd.h | 50 binary_search
205 binary_search(_FIter, _FIter, const _Tp&);
209 binary_search(_FIter, _FIter, const _Tp&, _Compare);
|
| /prebuilts/ndk/current/sources/cxx-stl/stlport/stlport/stl/ |
| _algo.h | 479 // Binary search (lower_bound, upper_bound, equal_range, binary_search).
553 inline bool binary_search(_ForwardIter __first, _ForwardIter __last, function
564 inline bool binary_search(_ForwardIter __first, _ForwardIter __last, function
|
