Lines Matching refs:dim
69 int dim; // split dimension; >=0 for nodes, -1 for leaves
72 scalar_type boundary; // left if deref(value,dim)<=boundary, otherwise right
76 __deref deref; // requires operator() (__valuetype lhs,int dim)
118 int dim, __valuector ctor) {
121 median_partition(first, last, k, dim, ctor);
128 int dim;
132 : pivot(_pivot), dim(_dim), deref(_deref), ctor(_ctor) {
135 return deref(ctor(lhs), dim) <= deref(ctor(pivot), dim);
141 __instype * k, int dim, __valuector ctor) {
147 (last[-1], dim, deref, ctor));
151 median_partition(middle + 1, last, k, dim, ctor);
153 median_partition(first, middle, k, dim, ctor);
163 int dim = dimension_of_highest_variance(first, last, ctor);
164 __instype *median = median_partition(first, last, dim, ctor);
167 for (; split != last && deref(ctor(*split), dim) ==
168 deref(ctor(*median), dim); ++split);
175 n.dim = -1;
188 n.dim = dim;
189 n.boundary = deref(ctor(*median), dim);
209 if (n.dim >= 0) { // node
210 if (deref(p, n.dim) <= n.boundary) // left
288 if (n.dim >= 0) {
290 nodes[i].right << ", dim " << nodes[i].dim << ", boundary " <<
343 if (d[n.dim] <= n.boundary) { // left
344 pq_alternate(n.right, pq, n.boundary - d[n.dim]);
347 pq_alternate(n.left, pq, d[n.dim] - n.boundary);
408 i != -1 && nodes[i].dim >= 0;
435 if (n.dim >= 0) { // node
436 if (bounds_min[n.dim] <= n.boundary)
438 if (bounds_max[n.dim] > n.boundary)
