Lines Matching refs:cv_n
165 int sample_all = 0, r_type, cv_n;
290 cv_n = params.cv_folds;
299 have_labels = cv_n > 0 || (ord_var_count == 1 && cat_var_count == 0) || _add_labels;
360 if( cv_n )
362 if( sample_count < cv_n*MAX(params.min_sample_count,10) )
366 cv_size = cvAlign( cv_n*(sizeof(int) + sizeof(double)*2), sizeof(double) );
598 if( cv_n )
609 vi &= vi < cv_n ? -1 : 0;
626 vi &= vi < cv_n ? -1 : 0;
1056 int cv_n = params.cv_folds;
1059 node->cv_node_risk = (double*)cvAlignPtr(node->cv_Tn + cv_n, sizeof(double));
1060 node->cv_node_error = node->cv_node_risk + cv_n;
2755 int i, j, k, n = node->sample_count, cv_n = data->params.cv_folds;
2758 int base_size = data->is_classifier ? m*cv_n*sizeof(int) : 2*cv_n*sizeof(double)+cv_n*sizeof(int);
2789 if( cv_n == 0 )
2796 for( j = 0; j < cv_n; j++ )
2806 for( j = 0; j < cv_n; j++ )
2842 for( j = 0; j < cv_n; j++ )
2889 if( cv_n == 0 )
2901 cv_sum2 = cv_sum + cv_n;
2902 cv_count = (int*)(cv_sum2 + cv_n);
2904 for( j = 0; j < cv_n; j++ )
2922 for( j = 0; j < cv_n; j++ )
2932 for( j = 0; j < cv_n; j++ )
3389 int ti, j, tree_count = 0, cv_n = data->params.cv_folds, n = root->sample_count;
3426 CV_CALL( err_jk = cvCreateMat( cv_n, tree_count, CV_64F ));
3429 for( j = 0; j < cv_n; j++ )
3450 for( j = 0; j < cv_n; j++ )
