Lines Matching refs:best_i
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
2090 best_i = i; best_inversed = 0; in find_surrogate_split_ord()
2099 best_i = i; best_inversed = 1; in find_surrogate_split_ord()
2141 best_i = i; best_inversed = 0; in find_surrogate_split_ord()
2150 best_i = i; best_inversed = 1; in find_surrogate_split_ord()
2156 return best_i >= 0 && best_val > node->maxlr ? data->new_split_ord( vi, in find_surrogate_split_ord()
2157 (sorted[best_i].val + sorted[best_i+1].val)*0.5f, best_i, in find_surrogate_split_ord()