_cvkdtree.hpp | 71 int left, right; // node indices of left and right branches member in struct:CvKDTree::node 72 scalar_type boundary; // left if deref(value,dim)<=boundary, otherwise right 178 n.right = nexti; 193 int right = insert(split, last, ctor); local 194 nodes[i].right = right; 212 else // right 213 r = remove(&n.right, p); 216 if (n.left == -1 && n.right == -1 [all...] |