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
616                 best_i = i; best_inversed = 0;  in find_surrogate_split_ord()
625                 best_i = i; best_inversed = 1;  in find_surrogate_split_ord()
630     return best_i >= 0 && best_val > node->maxlr ? data->new_split_ord( vi,  in find_surrogate_split_ord()
631         (sorted[best_i].val + sorted[best_i+1].val)*0.5f, best_i,  in find_surrogate_split_ord()