240     size_t n = (params.getMaxDepth() > 0 ? (1 << params.getMaxDepth()) : 1024) + w->wnodes.size();  in addTree()
242     w->wnodes.reserve(n);  in addTree()
245     w->wnodes.clear();  in addTree()
267         const WNode& wnode = w->wnodes[w_nidx];  in addTree()
305             int w_pidx = w->wnodes[w_nidx].parent;  in addTree()
306             if( w->wnodes[w_pidx].left == w_nidx )  in addTree()
312                 CV_Assert(w->wnodes[w_pidx].right == w_nidx);  in addTree()
326             while( w_pidx >= 0 && w->wnodes[w_pidx].right == w_nidx )  in addTree()
329                 w_pidx = w->wnodes[w_pidx].parent;  in addTree()
338             w_nidx = w->wnodes[w_pidx].right;  in addTree()
353     w->wnodes.push_back(WNode());  in addNodeAndTrySplit()
354     int nidx = (int)(w->wnodes.size() - 1);  in addNodeAndTrySplit()
355     WNode& node = w->wnodes.back();  in addNodeAndTrySplit()
358     node.depth = parent >= 0 ? w->wnodes[parent].depth + 1 : 0;  in addNodeAndTrySplit()
406         w->wnodes[nidx].left = left;  in addNodeAndTrySplit()
407         w->wnodes[nidx].right = right;  in addNodeAndTrySplit()
408         CV_Assert( w->wnodes[nidx].left > 0 && w->wnodes[nidx].right > 0 );  in addNodeAndTrySplit()
466     WNode* node = &w->wnodes[nidx];  in calcValue()
1202     int ti, tree_count = 0, j, cv_n = params.getCVFolds(), n = w->wnodes[root].sample_count;  in pruneCV()
1241                     err_jk.at<double>(j, tk) = w->wnodes[root].tree_error;  in pruneCV()
1277             node = &w->wnodes[nidx];  in updateTreeRNC()
1294         for( pidx = node->parent; pidx >= 0 && w->wnodes[pidx].right == nidx;  in updateTreeRNC()
1295              nidx = pidx, pidx = w->wnodes[pidx].parent )  in updateTreeRNC()
1297             node = &w->wnodes[nidx];  in updateTreeRNC()
1298             parent = &w->wnodes[pidx];  in updateTreeRNC()
1311         node = &w->wnodes[nidx];  in updateTreeRNC()
1312         parent = &w->wnodes[pidx];  in updateTreeRNC()
1325     WNode* node = &w->wnodes[root];  in cutTree()
1333             node = &w->wnodes[nidx];  in cutTree()
1350         for( pidx = node->parent; pidx >= 0 && w->wnodes[pidx].right == nidx;  in cutTree()
1351              nidx = pidx, pidx = w->wnodes[pidx].parent )  in cutTree()
1357         nidx = w->wnodes[pidx].right;  in cutTree()