/external/harfbuzz_ng/util/ |
ansi-print.cc | 281 int best_i = 0; 288 best_i = i; 294 best_i = i; 300 unsigned int which = lround (((best_i + 1) * 8) / bi.height); 313 int best_i = 0; 320 best_i = i; 326 best_i = i; 332 unsigned int which = lround (((best_i + 1) * 8) / bi.width);
|
/external/chromium_org/third_party/skia/experimental/Intersection/ |
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) {
|
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) {
|
QuadraticImplicit.cpp | 360 int best_i = 1, best_j = 1; 367 if (dist[best_i][best_j] > dist[i][j]) { 368 best_i = i; 373 if (best_i == 1 && best_j == 1) { 381 if (best_i == 0) { 386 } else if (best_i == 2) {
|
/external/chromium_org/third_party/skia/tests/ |
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) {
|
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/ |
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) {
|
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) {
|
QuadraticImplicit.cpp | 360 int best_i = 1, best_j = 1; 367 if (dist[best_i][best_j] > dist[i][j]) { 368 best_i = i; 373 if (best_i == 1 && best_j == 1) { 381 if (best_i == 0) { 386 } else if (best_i == 2) {
|
/external/skia/tests/ |
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) {
|
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/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...] |
/external/chromium_org/third_party/skia/src/pathops/ |
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/ |
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) {
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
difflib.py | [all...] |
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
difflib.py | [all...] |