211         const CvPair32s32f* sorted = data->get_ord_var_data(node,vi);  in calc_node_dir()  local
220             int idx = sorted[i].i;  in calc_node_dir()
228             int idx = sorted[i].i;  in calc_node_dir()
235             dir[sorted[i].i] = (char)0;  in calc_node_dir()
247     const CvPair32s32f* sorted = data->get_ord_var_data(node, vi);  in find_split_ord_class()  local
262         int idx = sorted[i].i;  in find_split_ord_class()
277             int idx = sorted[i].i;  in find_split_ord_class()
287             if( sorted[i].val + epsilon < sorted[i+1].val )  in find_split_ord_class()
302             int idx = sorted[i].i;  in find_split_ord_class()
308             if( sorted[i].val + epsilon < sorted[i+1].val )  in find_split_ord_class()
322         (sorted[best_i].val + sorted[best_i+1].val)*0.5f, best_i,  in find_split_ord_class()
443     const CvPair32s32f* sorted = data->get_ord_var_data(node, vi);  in find_split_ord_reg()  local
455         int idx = sorted[i].i;  in find_split_ord_reg()
464         int idx = sorted[i].i;  in find_split_ord_reg()
470         if( sorted[i].val + epsilon < sorted[i+1].val )  in find_split_ord_reg()
482         (sorted[best_i].val + sorted[best_i+1].val)*0.5f, best_i,  in find_split_ord_reg()
574     const CvPair32s32f* sorted = data->get_ord_var_data(node, vi);  in find_surrogate_split_ord()  local
591         int idx = sorted[i].i;  in find_surrogate_split_ord()
606         int idx = sorted[i].i;  in find_surrogate_split_ord()
613             if( LL + RR > best_val && sorted[i].val + epsilon < sorted[i+1].val )  in find_surrogate_split_ord()
622             if( RL + LR > best_val && sorted[i].val + epsilon < sorted[i+1].val )  in find_surrogate_split_ord()
631         (sorted[best_i].val + sorted[best_i+1].val)*0.5f, best_i,  in find_surrogate_split_ord()
1228     // use weak_eval as temporary buffer for sorted weights  in CV_IMPLEMENT_QSORT_EX()