HomeSort by relevance Sort by last modified time
    Searched refs:binary_search (Results 1 - 25 of 66) sorted by null

1 2 3

  /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/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
58 return binary_search (addr, start, halfway)
60 return binary_search (addr, halfway, end)
112 (functions, size) = binary_search (addr, 0, len(uniqueAddrs))
  /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/chrome/browser/sync/engine/
conflict_resolver.cc 165 // binary_search in ProcessConflictSet.
224 !binary_search(conflict_set->begin(), conflict_set->end(), parentid))
233 if (!binary_search(conflict_set->begin(), conflict_set->end(), id))
245 if (!binary_search(conflict_set->begin(), conflict_set->end(), id))
269 !binary_search(conflict_set->begin(), conflict_set->end(), parent_id)) {
292 if (!binary_search(conflict_set->begin(), conflict_set->end(), id)) {
319 if (!binary_search(conflict_set->begin(), conflict_set->end(), id)) {
  /external/chromium_org/chrome/browser/media_galleries/fileapi/
media_path_filter.cc 90 return std::binary_search(media_file_extensions_.begin(),
  /external/llvm/lib/Transforms/Instrumentation/
OptimalEdgeProfiling.cpp 151 if (!std::binary_search(MST.begin(), MST.end(), edge)) {
174 if (!std::binary_search(MST.begin(), MST.end(), edge)) {
185 if (!std::binary_search(MST.begin(), MST.end(), edge)) {
  /external/llvm/include/llvm/Analysis/
LoopInfoImpl.h 44 if (!std::binary_search(LoopBBs.begin(), LoopBBs.end(), *I)) {
78 if (!std::binary_search(LoopBBs.begin(), LoopBBs.end(), *I))
108 if (!std::binary_search(LoopBBs.begin(), LoopBBs.end(), *I))
269 if (std::binary_search(LoopBBs.begin(), LoopBBs.end(), *SI)) {
278 if (std::binary_search(LoopBBs.begin(), LoopBBs.end(), N))
312 assert(std::binary_search(LoopBBs.begin(), LoopBBs.end(), *BI) &&
  /external/chromium_org/net/disk_cache/flash/
segment.cc 35 return std::binary_search(offsets_.begin(), offsets_.end(), offset);
  /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
  /art/runtime/gc/accounting/
atomic_stack.h 147 return std::binary_search(Begin(), End(), value);
  /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 157 bool IsExitBlock = std::binary_search(ExitBlocks.begin(),
  /external/chromium/chrome/browser/sync/sessions/
status_controller.cc 173 return std::binary_search(proj.begin(), proj.end(), index);
  /external/chromium_org/chrome/common/extensions/manifest_handlers/
externally_connectable.cc 210 return std::binary_search(ids.begin(), ids.end(), id);
  /external/llvm/lib/Transforms/Utils/
LCSSA.cpp 88 return std::binary_search(LoopBlocks.begin(), LoopBlocks.end(), B);
  /external/chromium_org/third_party/skia/src/pathops/
SkDQuadIntersection.cpp 292 static bool binary_search(const SkDQuad& quad1, const SkDQuad& quad2, double* t1Seed, function
489 if (binary_search(q1, q2, roots1Copy, roots2Copy, pts1)) {
  /external/skia/src/pathops/
SkDQuadIntersection.cpp 292 static bool binary_search(const SkDQuad& quad1, const SkDQuad& quad2, double* t1Seed, function
489 if (binary_search(q1, q2, roots1Copy, roots2Copy, pts1)) {
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/
algorithmfwd.h 46 binary_search
200 binary_search(_FIter, _FIter, const _Tp&);
204 binary_search(_FIter, _FIter, const _Tp&, _Compare);
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/
algorithmfwd.h 48 binary_search
203 binary_search(_FIter, _FIter, const _Tp&);
207 binary_search(_FIter, _FIter, const _Tp&, _Compare);
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/
algorithmfwd.h 48 binary_search
203 binary_search(_FIter, _FIter, const _Tp&);
207 binary_search(_FIter, _FIter, const _Tp&, _Compare);

Completed in 1581 milliseconds

1 2 3