Searched refs:subset_i (Results 1 – 2 of 2) sorted by relevance
346 int best_subset = -1, subset_i; in CV_IMPLEMENT_QSORT_EX() local379 for( subset_i = 0; subset_i < mi-1; subset_i++ ) in CV_IMPLEMENT_QSORT_EX()381 idx = (int)(dbl_ptr[subset_i] - cjk)/2; in CV_IMPLEMENT_QSORT_EX()406 best_subset = subset_i; in CV_IMPLEMENT_QSORT_EX()419 best_subset = subset_i; in CV_IMPLEMENT_QSORT_EX()501 int i, best_subset = -1, subset_i; in find_split_cat_reg() local533 for( subset_i = 0; subset_i < mi-1; subset_i++ ) in find_split_cat_reg()535 int idx = (int)(sum_ptr[subset_i] - sum); in find_split_cat_reg()550 best_subset = subset_i; in find_split_cat_reg()
1774 int prevcode = 0, best_subset = -1, subset_i, subset_n, subtract = 0; in find_split_cat_class() local1799 subset_i = 1; in find_split_cat_class()1809 subset_i = 0; in find_split_cat_class()1831 for( ; subset_i < subset_n; subset_i++ ) in find_split_cat_class()1838 idx = (int)(int_ptr[subset_i] - cjk)/2; in find_split_cat_class()1841 int graycode = (subset_i>>1)^subset_i; in find_split_cat_class()1895 best_subset = subset_i; in find_split_cat_class()1980 int best_subset = -1, subset_i; in find_split_cat_reg() local2011 for( subset_i = 0; subset_i < mi-1; subset_i++ ) in find_split_cat_reg()2013 int idx = (int)(sum_ptr[subset_i] - sum); in find_split_cat_reg()[all …]