Searched defs:best_i (Results 1 - 4 of 4) sorted by relevance

/external/skia/tests/
H A DPathOpsQuadIntersectionTest.cpp416 int best_i = 1, best_j = 1; local
423 if (dist[best_i][best_j] > dist[i][j]) {
424 best_i = i;
429 if (best_i == 0) {
431 } else if (best_i == 2) {
439 if (best_i == 1 && best_j == 1) {
H A DPathOpsCubicIntersectionTest.cpp521 int best_i = 1, best_j = 1; local
528 if (dist[best_i][best_j] > dist[i][j]) {
529 best_i = i;
534 if (best_i == 0) {
536 } else if (best_i == 2) {
544 if (best_i == 1 && best_j == 1) {
/external/opencv/ml/src/
H A Dmlboost.cpp254 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 Dmltree.cpp1577 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...]

Completed in 138 milliseconds