Lines Matching refs:nodes
128 nodes.clear();
263 int root = (int)nodes.size();
301 int nidx = (int)nodes.size();
302 nodes.push_back(node);
308 nodes[pidx].left = nidx;
313 nodes[pidx].right = nidx;
331 pidx = nodes[pidx].parent;
1409 const Node& node = nodes[nidx];
1469 sum += nodes[prev].value;
1472 lastClassIdx = nodes[prev].classIdx;
1628 const Node& node = nodes[nidx];
1651 fs << "nodes" << "[";
1656 // traverse the tree and save all the nodes in depth-first order
1662 node = &nodes[nidx];
1669 for( pidx = node->parent; pidx >= 0 && nodes[pidx].right == nidx;
1670 nidx = pidx, pidx = nodes[pidx].parent )
1676 nidx = nodes[pidx].right;
1890 nodes.push_back(node);
1891 return (int)(nodes.size() - 1);
1904 Node& node = nodes[nidx];
1910 Node& parent = nodes[pidx];
1920 while( pidx >= 0 && nodes[pidx].right >= 0 )
1921 pidx = nodes[pidx].parent;
1933 FileNode fnodes = fn["nodes"];
