85 				    __valuector ctor) {  in dimension_of_highest_variance()  argument
93 	mean += deref(ctor(*k), j);  in dimension_of_highest_variance()
97 	accum_type diff = accum_type(deref(ctor(*k), j)) - mean;  in dimension_of_highest_variance()
118 			       int dim, __valuector ctor) {  in median_partition()  argument
121     median_partition(first, last, k, dim, ctor);  in median_partition()
130     __valuector ctor;  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()
158   int insert(__instype * first, __instype * last, __valuector ctor) {  in insert()  argument
163       int dim = dimension_of_highest_variance(first, last, ctor);  in insert()
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()
176 	  n.value = ctor(*split);  in insert()
189 	n.boundary = deref(ctor(*median), dim);  in insert()
191 	int left = insert(first, split, ctor);  in insert()
193 	int right = insert(split, last, ctor);  in insert()
249 	   __valuector ctor, __deref _deref = __deref())  in CvKDTree()  argument
251     set_data(first, last, _point_dim, ctor);  in CvKDTree()
263 		__valuector ctor) {  in set_data()  argument
267     root_node = insert(first, last, ctor);  in set_data()