/external/chromium_org/tools/cygprofile/ |
H A D | 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/chromium_org/third_party/skia/tests/ |
H A D | 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/ |
H A D | 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/stlport/stlport/stl/ |
H A D | _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
|
/external/chromium_org/third_party/icu/source/test/perf/collperf/ |
H A D | collperf.cpp | 411 binary_search(i); 416 void binary_search(int32_t random) { function in class:CmdBinSearch
|
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | 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/icu/icu4c/source/test/perf/collperf/ |
H A D | collperf.cpp | 411 binary_search(i); 416 void binary_search(int32_t random) { function in class:CmdBinSearch
|
/external/skia/src/pathops/ |
H A D | 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)) {
|