153     int i, j, count = end - start, k1 = 0, k2 = 0, d = var_count;  in find_neighbors_direct()  local
186                 for( ii = k1-1; ii >= 0; ii-- )  in find_neighbors_direct()
205             k1 = MIN( k1+1, k );  in find_neighbors_direct()
206             k2 = MIN( k1, k-1 );  in find_neighbors_direct()
212 float CvKNearest::write_results( int k, int k1, int start, int end,  in write_results()  argument
219     double inv_scale = 1./k1;  in write_results()
232                 for( j = 0; j < k1; j++ )  in write_results()
241                 for( j = 0; j < k1; j++ )  in write_results()
244                 for( j = k1-1; j > 0; j-- )  in write_results()
259                 for( j = 1; j <= k1; j++ )  in write_results()
260                     if( j == k1 || sort_buf[j].i != sort_buf[j-1].i )  in write_results()
284             for( j = 0; j < k1; j++ )  in write_results()
293             for( j = 0; j < k1; j++ )  in write_results()
317     int i, count, count_scale, blk_count0, blk_count = 0, buf_sz, k1;  in find_nearest()  local
365     k1 = get_sample_count();  in find_nearest()
366     k1 = MIN( k1, k );  in find_nearest()
386         float r = write_results( k, k1, i, i + blk_count, neighbor_responses, dist,  in find_nearest()