Lines Matching refs:idx
630 int j = 0, idx, count_i;
635 idx = src[i].i;
636 count_i = co[idx*2];
640 for( cur_ofs = co[idx*2+1]; count_i > 0; count_i--, j++, cur_ofs++ )
652 idx = src[i].i;
653 count_i = co[idx*2];
657 for( cur_ofs = co[idx*2+1]; count_i > 0; count_i--, j++, cur_ofs++ )
727 int idx = sidx ? sidx[i] : i;
728 int val = src[idx];
746 int idx = src[i].i;
750 count_i = co[idx*2];
751 cur_ofs = co[idx*2+1];
754 cur_ofs = idx*var_count;
777 int idx = sidx ? sidx[i] : i;
778 int val = get_class_idx ? src[idx] :
779 cat_map->data.i[cat_ofs->data.i[cat_var_count]+src[idx]];
788 int idx = sidx ? sidx[i] : i;
789 responses[i] = src[idx];
995 int idx = n->buf_idx + 1;
996 if( idx >= buf_count )
997 idx = shared ? 1 : 0;
998 return idx;
1447 int idx = labels[i];
1448 int d = idx >= 0 ? CV_DTREE_CAT_DIR(idx,subset) : 0;
1464 int idx = labels[i];
1466 int d = idx >= 0 ? CV_DTREE_CAT_DIR(idx,subset) : 0;
1503 int idx = sorted[i].i;
1504 double w = priors[responses[idx]];
1505 dir[idx] = (char)-1;
1511 int idx = sorted[i].i;
1512 double w = priors[responses[idx]];
1513 dir[idx] = (char)1;
1601 int idx = responses[sorted[i].i];
1604 lv = lc[idx]; rv = rc[idx];
1607 lc[idx] = lv + 1; rc[idx] = rv - 1;
1632 int idx = responses[sorted[i].i];
1634 double p = priors[idx], p2 = p*p;
1636 lv = lc[idx]; rv = rc[idx];
1639 lc[idx] = lv + 1; rc[idx] = rv - 1;
1664 int i, j, idx;
1671 for( i = idx = 0; i < n; i++ )
1675 labels[i] = idx++;
1676 idx &= idx < k ? -1 : 0;
1732 for( idx = 0; idx < k; idx++ )
1734 const int* s = csums + idx*m;
1735 double dist2 = 0., beta = c_weights[idx];
1744 min_idx = idx;
1771 int i, j, k, idx;
1838 idx = (int)(int_ptr[subset_i] - cjk)/2;
1846 idx = diff >= (1 << 16) ? 16 : 0;
1848 idx += (u.i >> 23) - 127;
1853 crow = cjk + idx*m;
1854 weight = c_weights[idx];
1909 idx = (int)(int_ptr[i] - cjk) >> 1;
1910 split->subset[idx >> 5] |= 1 << (idx & 31);
1917 idx = cluster_labels ? cluster_labels[i] : i;
1918 if( best_subset & (1 << idx) )
1988 int idx = labels[i];
1989 double s = sum[idx] + responses[i];
1990 int nc = counts[idx] + 1;
1991 sum[idx] = s;
1992 counts[idx] = nc;
2013 int idx = (int)(sum_ptr[subset_i] - sum);
2014 int ni = counts[idx];
2018 double s = sum[idx];
2040 int idx = (int)(sum_ptr[i] - sum);
2041 split->subset[idx >> 5] |= 1 << (idx & 31);
2116 int idx = sorted[i].i;
2117 double w = priors[responses[idx]];
2118 int d = dir[idx];
2131 int idx = sorted[i].i;
2132 double w = priors[responses[idx]];
2133 int d = dir[idx];
2192 int idx = labels[i];
2194 int sum = _lc[idx] + d;
2195 int sum_abs = _rc[idx] + (d & 1);
2196 _lc[idx] = sum; _rc[idx] = sum_abs;
2214 int idx = labels[i];
2217 double sum = lc[idx] + d*w;
2218 double sum_abs = rc[idx] + (d & 1)*w;
2219 lc[idx] = sum; rc[idx] = sum_abs;
2458 int idx;
2459 if( !dir[i] && (idx = labels[i]) >= 0 )
2461 int d = CV_DTREE_CAT_DIR(idx,subset);
2478 int idx = sorted[i].i;
2479 if( !dir[idx] )
2482 dir[idx] = (char)((d ^ inversed_mask) - inversed_mask);
2569 int idx = src[i].i;
2571 int d = dir[idx];
2572 idx = new_idx[idx];
2573 ldst->i = rdst->i = idx;
2585 int idx = src[i].i;
2586 int d = dir[idx];
2587 idx = new_idx[idx];
2588 ldst->i = rdst->i = idx;
