Searched refs:binary_search (Results 1 - 25 of 32) sorted by relevance

12

/external/stlport/test/unit/
H A Dbsearch_test.cpp35 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/
H A DAndroid.mk19 test_name := algorithms/alg.sorting/alg.binary.search/binary.search/binary_search
20 test_src := binary_search.pass.cpp
H A Dbinary_search.pass.cpp16 // binary_search(Iter first, Iter last, const T& value);
28 assert(std::binary_search(first, last, value) == x);
H A Dbinary_search_comp.pass.cpp16 // 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/
H A Dhashed_ad_network_database.cc7 #include <algorithm> // std::binary_search
55 return std::binary_search(entries_,
/external/chromium_org/third_party/WebKit/Source/platform/weborigin/
H A DKnownPorts.cpp133 // The port list must be sorted for binary_search to work.
143 if (!std::binary_search(blockedPortList, blockedPortListEnd, port))
/external/chromium_org/tools/cygprofile/
H A Dpatch_orderfile.py41 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/
H A DUnicodeCharRanges.h60 return std::binary_search(Ranges.begin(), Ranges.end(), C);
/external/chromium_org/third_party/skia/tests/
H A DPathOpsCubicLineIntersectionIdeas.cpp54 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/
H A DPathOpsCubicLineIntersectionIdeas.cpp54 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/
H A Dsupervised_user_blacklist.cc68 return std::binary_search(host_hashes_.begin(), host_hashes_.end(), hash);
/external/chromium_org/chrome/renderer/plugins/
H A Dplugin_uma.cc94 return std::binary_search(array, array + array_size, str, CompareCStrings);
/external/llvm/lib/Transforms/Scalar/
H A DLoopInstSimplify.cpp171 bool IsExitBlock = std::binary_search(ExitBlocks.begin(),
/external/chromium_org/third_party/webrtc/modules/remote_bitrate_estimator/test/
H A Dbwe_test.cc182 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)) {
/external/chromium_org/extensions/common/manifest_handlers/
H A Dexternally_connectable.cc224 return std::binary_search(ids.begin(), ids.end(), id);
/external/chromium_org/third_party/skia/src/pathops/
H A DSkDQuadIntersection.cpp294 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/
H A DSkDQuadIntersection.cpp294 static bool binary_search(const SkDQuad& quad1, const SkDQuad& quad2, double* t1Seed, function
491 if (binary_search(q1, q2, roots1Copy, roots2Copy, pts1)) {
/external/chromium_org/chrome/browser/
H A Dinternal_auth.cc286 std::binary_search(used_ticks_.begin(), used_ticks_.end(), tick)) {
/external/chromium_org/chrome/browser/safe_browsing/
H A Dprefix_set.cc134 if (std::binary_search(full_hashes_.begin(), full_hashes_.end(),
/external/llvm/lib/LTO/
H A DLTOCodeGenerator.cpp340 std::binary_search(Libcalls.begin(), Libcalls.end(), GV.getName()))
/external/llvm/lib/Target/Mips/
H A DMips16HardFloat.cpp358 return std::binary_search(std::begin(IntrinsicInline),
H A DMips16ISelLowering.cpp440 if (std::binary_search(std::begin(HardFloatLibCalls),
484 if (std::binary_search(std::begin(HardFloatLibCalls),
/external/chromium_org/third_party/icu/source/test/perf/collperf/
H A Dcollperf.cpp411 binary_search(i);
416 void binary_search(int32_t random) { function in class:CmdBinSearch
/external/icu/icu4c/source/test/perf/collperf/
H A Dcollperf.cpp411 binary_search(i);
416 void binary_search(int32_t random) { function in class:CmdBinSearch
/external/stlport/stlport/stl/
H A D_algo.h479 // 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

Completed in 2271 milliseconds

12