Lines Matching refs:cv_n
140 int sample_all = 0, r_type = 0, cv_n;
250 cv_n = params.cv_folds;
259 have_labels = cv_n > 0 || ord_var_count == 1 && cat_var_count == 0 || _add_labels;
284 if( cv_n )
286 if( sample_count < cv_n*MAX(params.min_sample_count,10) )
290 cv_size = cvAlign( cv_n*(sizeof(int) + sizeof(double)*2), sizeof(double) );
483 if( cv_n )
491 vi &= vi < cv_n ? -1 : 0;
826 int cv_n = params.cv_folds;
829 node->cv_node_risk = (double*)cvAlignPtr(node->cv_Tn + cv_n, sizeof(double));
830 node->cv_node_error = node->cv_node_risk + cv_n;
2256 int i, j, k, n = node->sample_count, cv_n = data->params.cv_folds;
2273 int* cv_cls_count = (int*)cvStackAlloc(m*cv_n*sizeof(cv_cls_count[0]));
2281 if( cv_n == 0 )
2288 for( j = 0; j < cv_n; j++ )
2298 for( j = 0; j < cv_n; j++ )
2334 for( j = 0; j < cv_n; j++ )
2379 if( cv_n == 0 )
2390 cv_sum = (double*)cvStackAlloc( cv_n*sizeof(cv_sum[0]) );
2391 cv_sum2 = (double*)cvStackAlloc( cv_n*sizeof(cv_sum2[0]) );
2392 cv_count = (int*)cvStackAlloc( cv_n*sizeof(cv_count[0]) );
2394 for( j = 0; j < cv_n; j++ )
2412 for( j = 0; j < cv_n; j++ )
2422 for( j = 0; j < cv_n; j++ )
2651 int ti, j, tree_count = 0, cv_n = data->params.cv_folds, n = root->sample_count;
2688 CV_CALL( err_jk = cvCreateMat( cv_n, tree_count, CV_64F ));
2691 for( j = 0; j < cv_n; j++ )
2712 for( j = 0; j < cv_n; j++ )
