| /external/skia/tests/ |
| 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) {
|
| 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/chromium_org/third_party/skia/src/pathops/ |
| 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/ |
| 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/opencv/ml/src/ |
| 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 >= 0 ? data->new_split_ord( vi
582 int i, best_i = -1, best_inversed = 0; local
[all...] |
| mltree.cpp | 1577 int i, best_i = -1; local
2058 int i, best_i = -1, best_inversed = 0; local
[all...] |
