Lines Matching refs:left
71 int left, right; // node indices of left and right branches
72 scalar_type boundary; // left if deref(value,dim)<=boundary, otherwise right
177 n.left = -1;
191 int left = insert(first, split, ctor);
192 nodes[i].left = left;
210 if (deref(p, n.dim) <= n.boundary) // left
211 r = remove(&n.left, p);
216 if (n.left == -1 && n.right == -1)
289 std::cout << "node " << i << ", left " << nodes[i].left << ", right " <<
292 print(n.left, indent + 3);
343 if (d[n.dim] <= n.boundary) { // left
345 return n.left;
347 pq_alternate(n.left, pq, d[n.dim] - n.boundary);
437 find_ortho_range(n.left, bounds_min, bounds_max, inbounds);
