Lines Matching refs:best_i
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()
2429 split->ord.split_point = best_i; in find_split_ord_reg()
2548 int i, best_i = -1, best_inversed = 0; in find_surrogate_split_ord() local
2580 best_i = i; best_inversed = 0; in find_surrogate_split_ord()
2589 best_i = i; best_inversed = 1; in find_surrogate_split_ord()
2632 best_i = i; best_inversed = 0; in find_surrogate_split_ord()
2641 best_i = i; best_inversed = 1; in find_surrogate_split_ord()
2646 return best_i >= 0 && best_val > node->maxlr ? data->new_split_ord( vi, in find_surrogate_split_ord()
2647 (values[best_i] + values[best_i+1])*0.5f, best_i, best_inversed, (float)best_val ) : 0; in find_surrogate_split_ord()