| /external/harfbuzz_ng/util/ |
| D | ansi-print.cc | 281 int best_i = 0; in block_best() local
288 best_i = i; in block_best()
294 best_i = i; in block_best()
300 unsigned int which = lround (((best_i + 1) * 8) / bi.height); in block_best()
313 int best_i = 0; in block_best() local
320 best_i = i; in block_best()
326 best_i = i; in block_best()
332 unsigned int which = lround (((best_i + 1) * 8) / bi.width); in block_best()
|
| /external/chromium_org/third_party/skia/tests/ |
| D | PathOpsQuadIntersectionTest.cpp | 429 int best_i = 1, best_j = 1; in intersectionFinder() local
436 if (dist[best_i][best_j] > dist[i][j]) { in intersectionFinder()
437 best_i = i; in intersectionFinder()
442 if (best_i == 0) { in intersectionFinder()
444 } else if (best_i == 2) { in intersectionFinder()
452 if (best_i == 1 && best_j == 1) { in intersectionFinder()
|
| D | PathOpsCubicIntersectionTest.cpp | 461 int best_i = 1, best_j = 1; in intersectionFinder() local
468 if (dist[best_i][best_j] > dist[i][j]) { in intersectionFinder()
469 best_i = i; in intersectionFinder()
474 if (best_i == 0) { in intersectionFinder()
476 } else if (best_i == 2) { in intersectionFinder()
484 if (best_i == 1 && best_j == 1) { in intersectionFinder()
|
| /external/skia/tests/ |
| D | PathOpsQuadIntersectionTest.cpp | 426 int best_i = 1, best_j = 1; in intersectionFinder() local
433 if (dist[best_i][best_j] > dist[i][j]) { in intersectionFinder()
434 best_i = i; in intersectionFinder()
439 if (best_i == 0) { in intersectionFinder()
441 } else if (best_i == 2) { in intersectionFinder()
449 if (best_i == 1 && best_j == 1) { in intersectionFinder()
|
| D | PathOpsCubicIntersectionTest.cpp | 461 int best_i = 1, best_j = 1; in intersectionFinder() local
468 if (dist[best_i][best_j] > dist[i][j]) { in intersectionFinder()
469 best_i = i; in intersectionFinder()
474 if (best_i == 0) { in intersectionFinder()
476 } else if (best_i == 2) { in intersectionFinder()
484 if (best_i == 1 && best_j == 1) { in intersectionFinder()
|
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| D | QuadraticIntersection_Test.cpp | 359 int best_i = 1, best_j = 1; in intersectionFinder() local
366 if (dist[best_i][best_j] > dist[i][j]) { in intersectionFinder()
367 best_i = i; in intersectionFinder()
372 if (best_i == 0) { in intersectionFinder()
374 } else if (best_i == 2) { in intersectionFinder()
382 if (best_i == 1 && best_j == 1) { in intersectionFinder()
|
| D | QuadraticImplicit.cpp | 360 int best_i = 1, best_j = 1; in binarySearch() local
367 if (dist[best_i][best_j] > dist[i][j]) { in binarySearch()
368 best_i = i; in binarySearch()
373 if (best_i == 1 && best_j == 1) { in binarySearch()
381 if (best_i == 0) { in binarySearch()
386 } else if (best_i == 2) { in binarySearch()
|
| D | CubicIntersection_Test.cpp | 635 int best_i = 1, best_j = 1; local
642 if (dist[best_i][best_j] > dist[i][j]) {
643 best_i = i;
648 if (best_i == 0) {
650 } else if (best_i == 2) {
658 if (best_i == 1 && best_j == 1) {
|
| /external/skia/experimental/Intersection/ |
| D | QuadraticIntersection_Test.cpp | 359 int best_i = 1, best_j = 1; in intersectionFinder() local
366 if (dist[best_i][best_j] > dist[i][j]) { in intersectionFinder()
367 best_i = i; in intersectionFinder()
372 if (best_i == 0) { in intersectionFinder()
374 } else if (best_i == 2) { in intersectionFinder()
382 if (best_i == 1 && best_j == 1) { in intersectionFinder()
|
| D | QuadraticImplicit.cpp | 360 int best_i = 1, best_j = 1; in binarySearch() local
367 if (dist[best_i][best_j] > dist[i][j]) { in binarySearch()
368 best_i = i; in binarySearch()
373 if (best_i == 1 && best_j == 1) { in binarySearch()
381 if (best_i == 0) { in binarySearch()
386 } else if (best_i == 2) { in binarySearch()
|
| D | CubicIntersection_Test.cpp | 635 int best_i = 1, best_j = 1; local
642 if (dist[best_i][best_j] > dist[i][j]) {
643 best_i = i;
648 if (best_i == 0) {
650 } else if (best_i == 2) {
658 if (best_i == 1 && best_j == 1) {
|
| /external/opencv/ml/src/ |
| D | mlboost.cpp | 254 int i, best_i = -1; in find_split_ord_class() local
293 best_i = i; in find_split_ord_class()
315 best_i = i; in find_split_ord_class()
321 return best_i >= 0 ? data->new_split_ord( vi, in find_split_ord_class()
322 (sorted[best_i].val + sorted[best_i+1].val)*0.5f, best_i, in find_split_ord_class()
448 int i, best_i = -1; in find_split_ord_reg() local
476 best_i = i; in find_split_ord_reg()
481 return best_i >= 0 ? data->new_split_ord( vi, in find_split_ord_reg()
482 (sorted[best_i].val + sorted[best_i+1].val)*0.5f, best_i, in find_split_ord_reg()
582 int i, best_i = -1, best_inversed = 0; in find_surrogate_split_ord() local
[all …]
|
| D | mltree.cpp | 1577 int i, best_i = -1; in find_split_ord_class() local
1615 best_i = i; in find_split_ord_class()
1647 best_i = i; in find_split_ord_class()
1653 return best_i >= 0 ? data->new_split_ord( vi, in find_split_ord_class()
1654 (sorted[best_i].val + sorted[best_i+1].val)*0.5f, best_i, in find_split_ord_class()
1934 int i, best_i = -1; in find_split_ord_reg() local
1956 best_i = i; in find_split_ord_reg()
1961 return best_i >= 0 ? data->new_split_ord( vi, in find_split_ord_reg()
1962 (sorted[best_i].val + sorted[best_i+1].val)*0.5f, best_i, in find_split_ord_reg()
2058 int i, best_i = -1, best_inversed = 0; in find_surrogate_split_ord() local
[all …]
|
| /external/chromium_org/third_party/skia/src/pathops/ |
| D | SkDQuadIntersection.cpp | 318 int best_i = 1, best_j = 1; in binary_search() local
325 if (dist[best_i][best_j] > dist[i][j]) { in binary_search()
326 best_i = i; in binary_search()
331 if (best_i == 1 && best_j == 1) { in binary_search()
339 if (best_i == 0) { in binary_search()
344 } else if (best_i == 2) { in binary_search()
|
| /external/skia/src/pathops/ |
| D | SkDQuadIntersection.cpp | 318 int best_i = 1, best_j = 1; in binary_search() local
325 if (dist[best_i][best_j] > dist[i][j]) { in binary_search()
326 best_i = i; in binary_search()
331 if (best_i == 1 && best_j == 1) { in binary_search()
339 if (best_i == 0) { in binary_search()
344 } else if (best_i == 2) { in binary_search()
|