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