Lines Matching refs:right
71 int left, right; // node indices of left and right branches
72 scalar_type boundary; // left if deref(value,dim)<=boundary, otherwise right
178 n.right = nexti;
193 int right = insert(split, last, ctor);
194 nodes[i].right = right;
212 else // right
213 r = remove(&n.right, p);
216 if (n.left == -1 && n.right == -1)
222 *i = n.right;
225 return remove(&n.right, p);
289 std::cout << "node " << i << ", left " << nodes[i].left << ", right " <<
290 nodes[i].right << ", dim " << nodes[i].dim << ", boundary " <<
293 print(n.right, indent + 3);
344 pq_alternate(n.right, pq, n.boundary - d[n.dim]);
346 } else { // right
348 return n.right;
416 } while (-1 != (i = nodes[i].right));
439 find_ortho_range(n.right, bounds_min, bounds_max, inbounds);
443 } while (-1 != (i = nodes[i].right));
