Searched refs:best_i (Results 1 - 7 of 7) sorted by relevance
/external/harfbuzz_ng/util/ |
H A D | ansi-print.cc | 269 int best_i = 0; 276 best_i = i; 282 best_i = i; 288 unsigned int which = lround (((best_i + 1) * 8) / bi.height); 301 int best_i = 0; 308 best_i = i; 314 best_i = i; 320 unsigned int which = lround (((best_i + 1) * 8) / bi.width);
|
/external/skia/tests/ |
H A D | PathOpsQuadIntersectionTest.cpp | 423 int best_i = 1, best_j = 1; local 430 if (dist[best_i][best_j] > dist[i][j]) { 431 best_i = i; 436 if (best_i == 0) { 438 } else if (best_i == 2) { 446 if (best_i == 1 && best_j == 1) {
|
H A D | PathOpsCubicIntersectionTest.cpp | 458 int best_i = 1, best_j = 1; local 465 if (dist[best_i][best_j] > dist[i][j]) { 466 best_i = i; 471 if (best_i == 0) { 473 } else if (best_i == 2) { 481 if (best_i == 1 && best_j == 1) {
|
/external/opencv/ml/src/ |
H A D | mlboost.cpp | 254 int i, best_i = -1; local 293 best_i = i; 315 best_i = i; 321 return best_i >= 0 ? data->new_split_ord( vi, 322 (sorted[best_i].val + sorted[best_i+1].val)*0.5f, best_i, 448 int i, best_i = -1; local 476 best_i = i; 481 return best_i > 582 int i, best_i = -1, best_inversed = 0; local [all...] |
H A D | mltree.cpp | 1577 int i, best_i = -1; local 1615 best_i = i; 1647 best_i = i; 1653 return best_i >= 0 ? data->new_split_ord( vi, 1654 (sorted[best_i].val + sorted[best_i+1].val)*0.5f, best_i, 1934 int i, best_i = -1; 1956 best_i = i; 1961 return best_i > 2058 int i, best_i = -1, best_inversed = 0; local [all...] |
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkDQuadIntersection.cpp | 316 int best_i = 1, best_j = 1; local 323 if (dist[best_i][best_j] > dist[i][j]) { 324 best_i = i; 329 if (best_i == 1 && best_j == 1) { 337 if (best_i == 0) { 342 } else if (best_i == 2) {
|
/external/skia/src/pathops/ |
H A D | SkDQuadIntersection.cpp | 316 int best_i = 1, best_j = 1; local 323 if (dist[best_i][best_j] > dist[i][j]) { 324 best_i = i; 329 if (best_i == 1 && best_j == 1) { 337 if (best_i == 0) { 342 } else if (best_i == 2) {
|
Completed in 180 milliseconds