Home
last modified time | relevance | path

Searched refs:best_subset (Results 1 – 2 of 2) sorted by relevance

/external/opencv/ml/src/
Dmlboost.cpp346 int best_subset = -1, subset_i; in CV_IMPLEMENT_QSORT_EX() local
406 best_subset = subset_i; in CV_IMPLEMENT_QSORT_EX()
419 best_subset = subset_i; in CV_IMPLEMENT_QSORT_EX()
424 if( best_subset < 0 ) in CV_IMPLEMENT_QSORT_EX()
429 for( i = 0; i <= best_subset; i++ ) in CV_IMPLEMENT_QSORT_EX()
501 int i, best_subset = -1, subset_i; in find_split_cat_reg() local
550 best_subset = subset_i; in find_split_cat_reg()
556 if( best_subset < 0 ) in find_split_cat_reg()
560 for( i = 0; i <= best_subset; i++ ) in find_split_cat_reg()
Dmltree.cpp1774 int prevcode = 0, best_subset = -1, subset_i, subset_n, subtract = 0; in find_split_cat_class() local
1895 best_subset = subset_i; in find_split_cat_class()
1900 if( best_subset < 0 ) in find_split_cat_class()
1907 for( i = 0; i <= best_subset; i++ ) in find_split_cat_class()
1918 if( best_subset & (1 << idx) ) in find_split_cat_class()
1980 int best_subset = -1, subset_i; in find_split_cat_reg() local
2028 best_subset = subset_i; in find_split_cat_reg()
2034 if( best_subset < 0 ) in find_split_cat_reg()
2038 for( i = 0; i <= best_subset; i++ ) in find_split_cat_reg()