Home | History | Annotate | Download | only in src

Lines Matching refs:seq

875     CvSeq *seq = 0, *seq2 = 0, *idx_seq = 0, *big_seq = 0;
910 seq = cvCreateSeq( 0, sizeof(CvSeq), sizeof(CvRect), temp_storage );
924 seq_thread[0] = seq;
1084 cvSeqPushMulti( seq, b->data, b->count );
1258 cvSeqPushMulti( seq, b->data, b->count );
1263 CvSeq* bseq = min_neighbors > 0 ? big_seq : seq;
1268 int ncomp = cvSeqPartition( seq, 0, &idx_seq, is_equal, 0 );
1275 for( i = 0; i < seq->total; i++ )
1277 CvRect r1 = *(CvRect*)cvGetSeqElem( seq, i );
1311 for( i = 0; i < seq->total; i++ )
1313 CvRect r1 = *(CvRect*)cvGetSeqElem( seq, i );
1380 result_comp.neighbors = bseq == seq ? 1 : comp->neighbors;
1411 for( i = 0; i < seq->total; i++ )
1413 CvRect* rect = (CvRect*)cvGetSeqElem( seq, i );
1428 int ncomp = cvSeqPartition( seq, 0, &idx_seq, is_equal, 0 );
1433 for( i = 0; i < seq->total; i++ )
1435 CvRect r1 = *(CvRect*)cvGetSeqElem( seq, i );
1797 n = stages_fn->data.seq->total;
1802 if( !seq_fn || !CV_NODE_IS_SEQ( seq_fn->tag ) || seq_fn->data.seq->total != 2 )
1804 CV_CALL( fn = (CvFileNode*) cvGetSeqElem( seq_fn->data.seq, 0 ) );
1808 CV_CALL( fn = (CvFileNode*) cvGetSeqElem( seq_fn->data.seq, 1 ) );
1813 CV_CALL( cvStartReadSeq( stages_fn->data.seq, &stages_reader ) );
1829 || trees_fn->data.seq->total <= 0 )
1836 (CvHaarClassifier*) cvAlloc( trees_fn->data.seq->total
1838 for( j = 0; j < trees_fn->data.seq->total; ++j )
1842 cascade->stage_classifier[i].count = trees_fn->data.seq->total;
1844 CV_CALL( cvStartReadSeq( trees_fn->data.seq, &trees_reader ) );
1845 for( j = 0; j < trees_fn->data.seq->total; ++j )
1854 if( !CV_NODE_IS_SEQ( tree_fn->tag ) || tree_fn->data.seq->total <= 0 )
1861 classifier->count = tree_fn->data.seq->total;
1873 CV_CALL( cvStartReadSeq( tree_fn->data.seq, &tree_reader ) );
1874 for( k = 0, last_idx = 0; k < tree_fn->data.seq->total; ++k )
1899 || rects_fn->data.seq->total < 1
1900 || rects_fn->data.seq->total > CV_HAAR_FEATURE_MAX )
1906 CV_CALL( cvStartReadSeq( rects_fn->data.seq, &rects_reader ) );
1907 for( l = 0; l < rects_fn->data.seq->total; ++l )
1913 if( !CV_NODE_IS_SEQ( rect_fn->tag ) || rect_fn->data.seq->total != 5 )
1920 fn = CV_SEQ_ELEM( rect_fn->data.seq, CvFileNode, 0 );
1928 fn = CV_SEQ_ELEM( rect_fn->data.seq, CvFileNode, 1 );
1936 fn = CV_SEQ_ELEM( rect_fn->data.seq, CvFileNode, 2 );
1946 fn = CV_SEQ_ELEM( rect_fn->data.seq, CvFileNode, 3 );
1956 fn = CV_SEQ_ELEM( rect_fn->data.seq, CvFileNode, 4 );
1969 for( l = rects_fn->data.seq->total; l < CV_HAAR_FEATURE_MAX; ++l )
1995 || fn->data.i >= tree_fn->data.seq->total )
2034 || fn->data.i >= tree_fn->data.seq->total )