Lines Matching full:pidx
262 int w_nidx = w_root, pidx = -1, depth = 0;
269 node.parent = pidx;
303 if( pidx >= 0 )
308 nodes[pidx].left = nidx;
313 nodes[pidx].right = nidx;
320 pidx = nidx;
330 nidx = pidx;
331 pidx = nodes[pidx].parent;
1268 int nidx = root, pidx = -1, cv_n = params.getCVFolds();
1294 for( pidx = node->parent; pidx >= 0 && w->wnodes[pidx].right == nidx;
1295 nidx = pidx, pidx = w->wnodes[pidx].parent )
1298 parent = &w->wnodes[pidx];
1303 parent->alpha = ((fold >= 0 ? w->cv_node_risk[pidx*cv_n + fold] : parent->node_risk)
1308 if( pidx < 0 )
1312 parent = &w->wnodes[pidx];
1324 int cv_n = params.getCVFolds(), nidx = root, pidx = -1;
1350 for( pidx = node->parent; pidx >= 0 && w->wnodes[pidx].right == nidx;
1351 nidx = pidx, pidx = w->wnodes[pidx].parent )
1354 if( pidx < 0 )
1357 nidx = w->wnodes[pidx].right;
1653 int nidx = root, pidx = 0, depth = 0;
1669 for( pidx = node->parent; pidx >= 0 && nodes[pidx].right == nidx;
1670 nidx = pidx, pidx = nodes[pidx].parent )
1673 if( pidx < 0 )
1676 nidx = nodes[pidx].right;
1896 int i, n = (int)fn.size(), root = -1, pidx = -1;
1905 node.parent = pidx;
1906 if( pidx < 0 )
1910 Node& parent = nodes[pidx];
1917 pidx = nidx;
1920 while( pidx >= 0 && nodes[pidx].right >= 0 )
1921 pidx = nodes[pidx].parent;
