/external/stlport/test/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-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/algorithms/alg.sorting/alg.binary.search/binary.search/ |
Android.mk | 19 test_name := algorithms/alg.sorting/alg.binary.search/binary.search/binary_search 20 test_src := binary_search.pass.cpp
|
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/chromium_org/chrome/browser/extensions/activity_log/ |
hashed_ad_network_database.cc | 7 #include <algorithm> // std::binary_search 55 return std::binary_search(entries_,
|
/external/chromium_org/third_party/WebKit/Source/platform/weborigin/ |
KnownPorts.cpp | 133 // The port list must be sorted for binary_search to work. 143 if (!std::binary_search(blockedPortList, blockedPortListEnd, port))
|
/external/chromium_org/tools/cygprofile/ |
patch_orderfile.py | 41 def binary_search (addr, start, end): function 56 return binary_search (addr, start, halfway) 58 return binary_search (addr, halfway, end) 108 (functions, size) = binary_search (addr, 0, len(uniqueAddrs))
|
/external/llvm/include/llvm/Support/ |
UnicodeCharRanges.h | 60 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);
|
/external/chromium_org/third_party/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);
|
/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);
|
/external/chromium_org/chrome/browser/supervised_user/experimental/ |
supervised_user_blacklist.cc | 68 return std::binary_search(host_hashes_.begin(), host_hashes_.end(), hash);
|
/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/chromium_org/chrome/renderer/plugins/ |
plugin_uma.cc | 94 return std::binary_search(array, array + array_size, str, CompareCStrings);
|
/external/llvm/lib/Transforms/Scalar/ |
LoopInstSimplify.cpp | 171 bool IsExitBlock = std::binary_search(ExitBlocks.begin(),
|
/external/chromium_org/third_party/webrtc/modules/remote_bitrate_estimator/test/ |
bwe_test.cc | 182 if (std::binary_search(flow_ids.begin(), flow_ids.end(), it->flow_id())) { 285 if (std::binary_search(flow_ids.begin(), flow_ids.end(), flow_id)) {
|
/art/runtime/gc/accounting/ |
atomic_stack.h | 175 return std::binary_search(Begin(), End(), value);
|
/external/chromium_org/extensions/common/manifest_handlers/ |
externally_connectable.cc | 224 return std::binary_search(ids.begin(), ids.end(), id);
|
/external/chromium_org/third_party/skia/src/pathops/ |
SkDQuadIntersection.cpp | 294 static bool binary_search(const SkDQuad& quad1, const SkDQuad& quad2, double* t1Seed, function 491 if (binary_search(q1, q2, roots1Copy, roots2Copy, pts1)) {
|
/external/skia/src/pathops/ |
SkDQuadIntersection.cpp | 294 static bool binary_search(const SkDQuad& quad1, const SkDQuad& quad2, double* t1Seed, function 491 if (binary_search(q1, q2, roots1Copy, roots2Copy, pts1)) {
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/bits/ |
algorithmfwd.h | 48 binary_search 203 binary_search(_FIter, _FIter, const _Tp&); 207 binary_search(_FIter, _FIter, const _Tp&, _Compare);
|