Searched refs:best_i (Results 1 – 8 of 8) sorted by relevance
| /external/harfbuzz_ng/util/ |
| D | ansi-print.cc | 284 int best_i = 0; in block_best() local
291 best_i = i; in block_best()
297 best_i = i; in block_best()
303 unsigned int which = lround ((double) ((best_i + 1) * 8) / bi.height); in block_best()
316 int best_i = 0; in block_best() local
323 best_i = i; in block_best()
329 best_i = i; in block_best()
335 unsigned int which = lround ((double) ((best_i + 1) * 8) / bi.width); in block_best()
|
| /external/skia/tests/ |
| D | PathOpsQuadIntersectionTest.cpp | 416 int best_i = 1, best_j = 1; in intersectionFinder() local
423 if (dist[best_i][best_j] > dist[i][j]) { in intersectionFinder()
424 best_i = i; in intersectionFinder()
429 if (best_i == 0) { in intersectionFinder()
431 } else if (best_i == 2) { in intersectionFinder()
439 if (best_i == 1 && best_j == 1) { in intersectionFinder()
|
| D | PathOpsCubicIntersectionTest.cpp | 529 int best_i = 1, best_j = 1; in intersectionFinder() local
536 if (dist[best_i][best_j] > dist[i][j]) { in intersectionFinder()
537 best_i = i; in intersectionFinder()
542 if (best_i == 0) { in intersectionFinder()
544 } else if (best_i == 2) { in intersectionFinder()
552 if (best_i == 1 && best_j == 1) { in intersectionFinder()
|
| /external/opencv/ml/src/ |
| D | mlboost.cpp | 254 int i, best_i = -1; in find_split_ord_class() local
293 best_i = i; in find_split_ord_class()
315 best_i = i; in find_split_ord_class()
321 return best_i >= 0 ? data->new_split_ord( vi, in find_split_ord_class()
322 (sorted[best_i].val + sorted[best_i+1].val)*0.5f, best_i, in find_split_ord_class()
448 int i, best_i = -1; in find_split_ord_reg() local
476 best_i = i; in find_split_ord_reg()
481 return best_i >= 0 ? data->new_split_ord( vi, in find_split_ord_reg()
482 (sorted[best_i].val + sorted[best_i+1].val)*0.5f, best_i, in find_split_ord_reg()
582 int i, best_i = -1, best_inversed = 0; in find_surrogate_split_ord() local
[all …]
|
| D | mltree.cpp | 1577 int i, best_i = -1; in find_split_ord_class() local
1615 best_i = i; in find_split_ord_class()
1647 best_i = i; in find_split_ord_class()
1653 return best_i >= 0 ? data->new_split_ord( vi, in find_split_ord_class()
1654 (sorted[best_i].val + sorted[best_i+1].val)*0.5f, best_i, in find_split_ord_class()
1934 int i, best_i = -1; in find_split_ord_reg() local
1956 best_i = i; in find_split_ord_reg()
1961 return best_i >= 0 ? data->new_split_ord( vi, in find_split_ord_reg()
1962 (sorted[best_i].val + sorted[best_i+1].val)*0.5f, best_i, in find_split_ord_reg()
2058 int i, best_i = -1, best_inversed = 0; in find_surrogate_split_ord() local
[all …]
|
| /external/opencv3/apps/traincascade/ |
| D | old_ml_boost.cpp | 274 int i, best_i = -1; in find_split_ord_class() local
313 best_i = i; in find_split_ord_class()
335 best_i = i; in find_split_ord_class()
342 if( best_i >= 0 ) in find_split_ord_class()
346 split->ord.c = (values[best_i] + values[best_i+1])*0.5f; in find_split_ord_class()
347 split->ord.split_point = best_i; in find_split_ord_class()
504 int i, best_i = -1; in find_split_ord_reg() local
532 best_i = i; in find_split_ord_reg()
538 if( best_i >= 0 ) in find_split_ord_reg()
542 split->ord.c = (values[best_i] + values[best_i+1])*0.5f; in find_split_ord_reg()
[all …]
|
| D | old_ml_tree.cpp | 2000 int i, best_i = -1; in find_split_ord_class() local
2040 best_i = i; in find_split_ord_class()
2072 best_i = i; in find_split_ord_class()
2079 if( best_i >= 0 ) in find_split_ord_class()
2083 split->ord.c = (values[best_i] + values[best_i+1])*0.5f; in find_split_ord_class()
2084 split->ord.split_point = best_i; in find_split_ord_class()
2396 int i, best_i = -1; in find_split_ord_reg() local
2418 best_i = i; in find_split_ord_reg()
2424 if( best_i >= 0 ) in find_split_ord_reg()
2428 split->ord.c = (values[best_i] + values[best_i+1])*0.5f; in find_split_ord_reg()
[all …]
|
| /external/opencv3/modules/ml/src/ |
| D | tree.cpp | 653 int i, best_i = -1; in findSplitOrdClass() local
697 best_i = i; in findSplitOrdClass()
703 if( best_i >= 0 ) in findSplitOrdClass()
706 split.c = (values[sorted_idx[best_i]] + values[sorted_idx[best_i+1]])*0.5f; in findSplitOrdClass()
999 int i, si, best_i = -1; in findSplitOrdReg() local
1030 best_i = i; in findSplitOrdReg()
1036 if( best_i >= 0 ) in findSplitOrdReg()
1039 split.c = (values[sorted_idx[best_i]] + values[sorted_idx[best_i+1]])*0.5f; in findSplitOrdReg()
|