Home | History | Annotate | Download | only in src

Lines Matching full:subset_i

1774     int prevcode = 0, best_subset = -1, subset_i, subset_n, subtract = 0;
1799         subset_i = 1;
1809         subset_i = 0;
1831     for( ; subset_i < subset_n; subset_i++ )
1838             idx = (int)(int_ptr[subset_i] - cjk)/2;
1841             int graycode = (subset_i>>1)^subset_i;
1895                 best_subset = subset_i;
1980     int best_subset = -1, subset_i;
2011     for( subset_i = 0; subset_i < mi-1; subset_i++ )
2013         int idx = (int)(sum_ptr[subset_i] - sum);
2028                     best_subset = subset_i;