Lines Matching refs:sample_count

201         sample_count = data->sample_count;
208 data_root = new_node( 0, sample_count, 0, 0 );
241 sample_count = sample_all;
248 sample_count = sample_indices->rows + sample_indices->cols - 1;
259 if ( sample_count < 65536 )
309 effective_buf_size = (uint64)(work_var_count + 1)*(uint64)sample_count * buf_count; // this is the total size of "CvMat buf" to be allocated
310 effective_buf_width = sample_count;
328 CV_CALL( pair16u32s_ptr = (CvPair16u32s*)cvAlloc( sample_count*sizeof(pair16u32s_ptr[0]) ));
333 CV_CALL( int_ptr = (int**)cvAlloc( sample_count*sizeof(int_ptr[0]) ));
349 (MAX(0,sample_count - 33)/32)*sizeof(int),sizeof(void*));
362 if( sample_count < cv_n*MAX(params.min_sample_count,10) )
376 CV_CALL( data_root = new_node( 0, sample_count, 0, 0 ));
383 _fdst = (float*)cvAlloc(sample_count*sizeof(_fdst[0]));
385 _idst = (int*)cvAlloc(sample_count*sizeof(_idst[0]));
427 udst = (unsigned short*)(buf->data.s + (size_t)vi*sample_count);
429 idst = buf->data.i + (size_t)vi*sample_count;
432 for( i = 0; i < sample_count; i++ )
475 std::sort(pair16u32s_ptr, pair16u32s_ptr + sample_count, LessThanPairs());
483 std::sort(int_ptr, int_ptr + sample_count, LessThanPtr<int>());
521 for( ; i < sample_count; i++ )
536 for( ; i < sample_count; i++ )
543 udst = (unsigned short*)(buf->data.s + (size_t)vi*sample_count);
545 idst = buf->data.i + (size_t)vi*sample_count;
547 for( i = 0; i < sample_count; i++ )
575 std::sort(udst, udst + sample_count, LessThanIdx<float, unsigned short>(_fdst));
577 std::sort(idst, idst + sample_count, LessThanIdx<float, int>(_fdst));
586 udst = (unsigned short*)(buf->data.s + (size_t)work_var_count*sample_count);
588 idst = buf->data.i + (size_t)work_var_count*sample_count;
590 for (i = 0; i < sample_count; i++)
605 usdst = (unsigned short*)(buf->data.s + (size_t)(get_work_var_count()-1)*sample_count);
606 for( i = vi = 0; i < sample_count; i++ )
612 for( i = 0; i < sample_count; i++ )
614 int a = (*rng)(sample_count);
615 int b = (*rng)(sample_count);
622 idst2 = buf->data.i + (size_t)(get_work_var_count()-1)*sample_count;
623 for( i = vi = 0; i < sample_count; i++ )
629 for( i = 0; i < sample_count; i++ )
631 int a = (*rng)(sample_count);
632 int b = (*rng)(sample_count);
669 CV_CALL( direction = cvCreateMat( 1, sample_count, CV_8UC1 ));
670 CV_CALL( split_buf = cvCreateMat( 1, sample_count, CV_32SC1 ));
712 CV_CALL( isubsample_idx = cvPreprocessIndexArray( _subsample_idx, sample_count ));
714 if( isubsample_idx->cols + isubsample_idx->rows - 1 == sample_count )
717 for( int i = 0; i < sample_count; i++ )
759 CV_CALL( subsample_co = cvCreateMat( 1, sample_count*2, CV_32SC1 ));
764 for( i = 0; i < sample_count; i++ )
775 cv::AutoBuffer<uchar> inn_buf(sample_count*(2*sizeof(int) + sizeof(float)));
788 (size_t)vi*sample_count + root->offset);
799 (size_t)vi*sample_count + root->offset;
814 float *src_val_buf = (float*)(src_idx_buf + sample_count);
815 int* sample_indices_buf = (int*)(src_val_buf + sample_count);
825 (size_t)vi*sample_count + data_root->offset);
837 for( ; i < sample_count; i++ )
849 (size_t)vi*sample_count + root->offset;
861 for( ; i < sample_count; i++ )
877 (size_t)workVarCount*sample_count + root->offset);
884 (size_t)workVarCount*sample_count + root->offset;
910 int i, vi, total = sample_count, count = total, cur_ofs = 0;
914 cv::AutoBuffer<uchar> inn_buf(sample_count*(2*sizeof(int) + sizeof(float)));
917 CV_CALL( subsample_idx = cvPreprocessIndexArray( _subsample_idx, sample_count ));
919 CV_CALL( subsample_co = cvCreateMat( 1, sample_count*2, CV_32SC1 ));
966 int* src_idx_buf = (int*)(src_val_buf + sample_count);
967 int* sample_indices_buf = src_idx_buf + sample_count;
1014 int* sample_idx_buf = (int*)(val_buf + sample_count);
1036 node->sample_count = count;
1161 sample_count = var_all = var_count = max_c_count = ord_var_count = cat_var_count = 0;
1188 int node_sample_count = n->sample_count;
1195 (size_t)vi*sample_count + n->offset;
1198 (size_t)vi*sample_count + n->offset );
1241 int _sample_count = n->sample_count;
1269 (size_t)vi*sample_count + n->offset;
1272 (size_t)vi*sample_count + n->offset);
1273 for( int i = 0; i < n->sample_count; i++ )
1684 int i, n = node->sample_count, vi;
1690 if( node->sample_count <= data->params.min_sample_count ||
1775 int i, n = node->sample_count, vi = node->split->var_idx;
1918 int n = node->sample_count;
1977 int n = node->sample_count;
2192 int n = node->sample_count;
2380 int n = node->sample_count;
2439 int n = node->sample_count;
2533 int n = node->sample_count, n1 = node->get_num_valid(vi);
2654 int n = node->sample_count;
2755 int i, j, k, n = node->sample_count, cv_n = data->params.cv_folds;
2948 int vi, i, n = node->sample_count, nl, nr, d0 = 0, d1 = -1;
3036 int vi, i, n = node->sample_count, nl, nr, scount = data->sample_count;
3063 (node->left->sample_count > data->params.min_sample_count ||
3064 node->right->sample_count > data->params.min_sample_count);
3329 int sample_count = sample_idx ? sample_idx->cols : 0;
3330 sample_count = (type == CV_TRAIN_ERROR && sample_count == 0) ? values->rows : sample_count;
3332 if( resp && (sample_count > 0) )
3334 resp->resize( sample_count );
3340 for( int i = 0; i < sample_count; i++ )
3353 err = sample_count ? err / (float)sample_count * 100 : -FLT_MAX;
3357 for( int i = 0; i < sample_count; i++ )
3370 err = sample_count ? err / (float)sample_count : -FLT_MAX;
3389 int ti, j, tree_count = 0, cv_n = data->params.cv_folds, n = root->sample_count;
3725 double diff = node->right->sample_count - node->left->sample_count;
3829 cvWriteInt( fs, "sample_count", node->sample_count );
4033 node->sample_count = cvReadIntByName( fs, fnode, "sample_count" );