188     ntrees           = 0;  in CvRTrees()
201     for( k = 0; k < ntrees; k++ )  in clear()
210     ntrees = 0;  in clear()
356     ntrees = 0;  in grow_forest()
357     while( ntrees < max_ntrees )  in grow_forest()
372         trees[ntrees] = new CvForestTree();  in grow_forest()
373         tree = trees[ntrees];  in grow_forest()
483         ntrees++;  in grow_forest()
488         CV_CALL(cvConvertScale( var_importance, var_importance, 1./ntrees/nsamples ));  in grow_forest()
524     for( i = 0; i < ntrees; i++ )  in get_proximity()
527     result = result/(float)ntrees;  in get_proximity()
549         for( k = 0; k < ntrees; k++ )  in predict()
567         for( k = 0; k < ntrees; k++ )  in predict()
569         result /= (double)ntrees;  in predict()
586     if( ntrees < 1 || !trees || nsamples < 1 )  in write()
599     cvWriteInt( fs, "ntrees", ntrees );  in write()
605     for( k = 0; k < ntrees; k++ )  in write()
635     ntrees       = cvReadIntByName( fs, fnode, "ntrees", -1 );  in read()
639     if( nclasses < 0 || nsamples <= 0 || nactive_vars < 0 || oob_error < 0 || ntrees <= 0)  in read()
645     trees = (CvForestTree**)cvAlloc( sizeof(trees[0])*ntrees );  in read()
646     memset( trees, 0, sizeof(trees[0])*ntrees );  in read()
657     if( reader.seq->total != ntrees )  in read()
661     for( k = 0; k < ntrees; k++ )  in read()
685     return ntrees;  in get_tree_count()
690     return (unsigned)i < (unsigned)ntrees ? trees[i] : 0;  in get_tree()