Lines Matching defs:sorted
1477 const CvPair32s32f* sorted = data->get_ord_var_data(node,vi);
1486 dir[sorted[i].i] = (char)-1;
1488 dir[sorted[i].i] = (char)1;
1490 dir[sorted[i].i] = (char)0;
1503 int idx = sorted[i].i;
1511 int idx = sorted[i].i;
1518 dir[sorted[i].i] = (char)0;
1569 const CvPair32s32f* sorted = data->get_ord_var_data(node, vi);
1590 rc[responses[sorted[i].i]]--;
1601 int idx = responses[sorted[i].i];
1609 if( sorted[i].val + epsilon < sorted[i+1].val )
1632 int idx = responses[sorted[i].i];
1641 if( sorted[i].val + epsilon < sorted[i+1].val )
1654 (sorted[best_i].val + sorted[best_i+1].val)*0.5f, best_i,
1930 const CvPair32s32f* sorted = data->get_ord_var_data(node, vi);
1940 rsum -= responses[sorted[i].i];
1945 float t = responses[sorted[i].i];
1950 if( sorted[i].val + epsilon < sorted[i+1].val )
1962 (sorted[best_i].val + sorted[best_i+1].val)*0.5f, best_i,
2051 const CvPair32s32f* sorted = data->get_ord_var_data(node, vi);
2069 int d = dir[sorted[i].i];
2082 int d = dir[sorted[i].i];
2087 if( LL + RR > _best_val && sorted[i].val + epsilon < sorted[i+1].val )
2096 if( RL + LR > _best_val && sorted[i].val + epsilon < sorted[i+1].val )
2116 int idx = sorted[i].i;
2131 int idx = sorted[i].i;
2138 if( LL + RR > best_val && sorted[i].val + epsilon < sorted[i+1].val )
2147 if( RL + LR > best_val && sorted[i].val + epsilon < sorted[i+1].val )
2157 (sorted[best_i].val + sorted[best_i+1].val)*0.5f, best_i,
2470 const CvPair32s32f* sorted = data->get_ord_var_data(node, vi);
2478 int idx = sorted[i].i;
2550 // split ordered variables, keep both halves sorted.
2566 // split sorted
