Lines Matching defs:last
84 SubTree() : first(0), last(0), nodeIdx(0), depth(0) {}
86 : first(_first), last(_last), nodeIdx(_nodeIdx), depth(_depth) {}
88 int last;
210 int first = stack[top].first, last = stack[top].last;
212 int count = last - first + 1, dim = -1;
251 nodes[nidx].boundary = medianPartition(ptofs, first, last, data + dim);
253 int middle = (first + last)/2;
255 computeSums(points, ptofs, middle+1, last, rsums);
259 stack[top++] = SubTree(middle+1, last, right, depth+1);
