Searched defs:best_i (Results 1 - 12 of 12) sorted by relevance
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | QuadraticIntersection_Test.cpp | 359 int best_i = 1, best_j = 1; local 366 if (dist[best_i][best_j] > dist[i][j]) { 367 best_i = i; 372 if (best_i == 0) { 374 } else if (best_i == 2) { 382 if (best_i == 1 && best_j == 1) {
|
H A 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/chromium_org/third_party/skia/tests/ |
H A D | PathOpsQuadIntersectionTest.cpp | 429 int best_i = 1, best_j = 1; local 436 if (dist[best_i][best_j] > dist[i][j]) { 437 best_i = i; 442 if (best_i == 0) { 444 } else if (best_i == 2) { 452 if (best_i == 1 && best_j == 1) {
|
H A D | PathOpsCubicIntersectionTest.cpp | 461 int best_i = 1, best_j = 1; local 468 if (dist[best_i][best_j] > dist[i][j]) { 469 best_i = i; 474 if (best_i == 0) { 476 } else if (best_i == 2) { 484 if (best_i == 1 && best_j == 1) {
|
/external/skia/experimental/Intersection/ |
H A D | QuadraticIntersection_Test.cpp | 359 int best_i = 1, best_j = 1; local 366 if (dist[best_i][best_j] > dist[i][j]) { 367 best_i = i; 372 if (best_i == 0) { 374 } else if (best_i == 2) { 382 if (best_i == 1 && best_j == 1) {
|
H A 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/tests/ |
H A D | PathOpsQuadIntersectionTest.cpp | 426 int best_i = 1, best_j = 1; local 433 if (dist[best_i][best_j] > dist[i][j]) { 434 best_i = i; 439 if (best_i == 0) { 441 } else if (best_i == 2) { 449 if (best_i == 1 && best_j == 1) {
|
H A D | PathOpsCubicIntersectionTest.cpp | 461 int best_i = 1, best_j = 1; local 468 if (dist[best_i][best_j] > dist[i][j]) { 469 best_i = i; 474 if (best_i == 0) { 476 } else if (best_i == 2) { 484 if (best_i == 1 && best_j == 1) {
|
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkDQuadIntersection.cpp | 318 int best_i = 1, best_j = 1; local 325 if (dist[best_i][best_j] > dist[i][j]) { 326 best_i = i; 331 if (best_i == 1 && best_j == 1) { 339 if (best_i == 0) { 344 } else if (best_i == 2) {
|
/external/skia/src/pathops/ |
H A D | SkDQuadIntersection.cpp | 318 int best_i = 1, best_j = 1; local 325 if (dist[best_i][best_j] > dist[i][j]) { 326 best_i = i; 331 if (best_i == 1 && best_j == 1) { 339 if (best_i == 0) { 344 } else if (best_i == 2) {
|
/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...] |
Completed in 5280 milliseconds