Lines Matching refs:nodes
69 int dim; // split dimension; >=0 for nodes, -1 for leaves
78 node_array nodes; // node storage
173 int i = nodes.size();
174 node & n = *nodes.insert(nodes.end(), node());
184 int i = nodes.size();
186 node & n = *nodes.insert(nodes.end(), node());
192 nodes[i].left = left;
194 nodes[i].right = right;
206 node & n = nodes[*i];
265 nodes.clear();
266 nodes.reserve(last - first);
287 const node & n = nodes[i];
289 std::cout << "node " << i << ", left " << nodes[i].left << ", right " <<
290 nodes[i].right << ", dim " << nodes[i].dim << ", boundary " <<
291 nodes[i].boundary << std::endl;
295 std::cout << "leaf " << i << ", value = " << nodes[i].value << std::endl;
341 const node & n = nodes[i];
408 i != -1 && nodes[i].dim >= 0;
415 bbf_new_nn(ret_nn_pq, k, d, nodes[i].value);
416 } while (-1 != (i = nodes[i].right));
434 const node & n = nodes[i];
442 inbounds.push_back(nodes[i].value);
443 } while (-1 != (i = nodes[i].right));
