| /external/harfbuzz_ng/util/ |
| 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/ |
| PathOpsQuadIntersectionTest.cpp | 410 int best_i = 1, best_j = 1; local
417 if (dist[best_i][best_j] > dist[i][j]) {
418 best_i = i;
423 if (best_i == 0) {
425 } else if (best_i == 2) {
433 if (best_i == 1 && best_j == 1) {
|
| PathOpsCubicIntersectionTest.cpp | 430 int best_i = 1, best_j = 1; local
437 if (dist[best_i][best_j] > dist[i][j]) {
438 best_i = i;
443 if (best_i == 0) {
445 } else if (best_i == 2) {
453 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 | 311 int best_i = 1, best_j = 1;
318 if (dist[best_i][best_j] > dist[i][j]) {
319 best_i = i;
324 if (best_i == 1 && best_j == 1) {
332 if (best_i == 0) {
337 } else if (best_i == 2) {
|
| /external/skia/src/pathops/ |
| SkDQuadIntersection.cpp | 311 int best_i = 1, best_j = 1;
318 if (dist[best_i][best_j] > dist[i][j]) {
319 best_i = i;
324 if (best_i == 1 && best_j == 1) {
332 if (best_i == 0) {
337 } 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...] |
