| /external/skia/tests/ |
| PathOpsQuadIntersectionTest.cpp | 416 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) {
|
| PathOpsCubicIntersectionTest.cpp | 529 int best_i = 1, best_j = 1; local
536 if (dist[best_i][best_j] > dist[i][j]) {
537 best_i = i;
542 if (best_i == 0) {
544 } else if (best_i == 2) {
552 if (best_i == 1 && best_j == 1) {
|
| /external/harfbuzz_ng/util/ |
| ansi-print.cc | 284 int best_i = 0;
291 best_i = i;
297 best_i = i;
303 unsigned int which = lround ((double) ((best_i + 1) * 8) / bi.height);
316 int best_i = 0;
323 best_i = i;
329 best_i = i;
335 unsigned int which = lround ((double) ((best_i + 1) * 8) / bi.width);
|
| /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/opencv3/apps/traincascade/ |
| old_ml_boost.cpp | 274 int i, best_i = -1; local
313 best_i = i;
335 best_i = i;
342 if( best_i >= 0 )
346 split->ord.c = (values[best_i] + values[best_i+1])*0.5f;
347 split->ord.split_point = best_i;
504 int i, best_i = -1; local
532 best_i = i;
538 if( best_i >= 0
670 int i, best_i = -1, best_inversed = 0; local
[all...] |
| old_ml_tree.cpp | 2000 int i, best_i = -1; local
2396 int i, best_i = -1; local
2548 int i, best_i = -1, best_inversed = 0; local
[all...] |
| /external/opencv3/modules/ml/src/ |
| tree.cpp | 653 int i, best_i = -1; local
697 best_i = i;
703 if( best_i >= 0 )
706 split.c = (values[sorted_idx[best_i]] + values[sorted_idx[best_i+1]])*0.5f;
999 int i, si, best_i = -1;
1030 best_i = i;
1036 if( best_i >= 0 )
1039 split.c = (values[sorted_idx[best_i]] + values[sorted_idx[best_i+1]])*0.5f
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/ |
| difflib.py | [all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/ |
| difflib.py | [all...] |
| /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...] |
