106     int[] besti = new int[size];  in run()  local
107     initializeNNCache(mat.matrix, bestd, besti);  in run()
114           findMerge(end, mat, protiter, builder, clusters, bestd, besti, dq));  in run()
128   private static void initializeNNCache(double[] scratch, double[] bestd, int[] besti) {  in initializeNNCache()  argument
131     Arrays.fill(besti, -1);  in initializeNNCache()
140           besti[y] = x;  in initializeNNCache()
148       besti[x] = bestix;  in initializeNNCache()
165 …r, Int2ObjectOpenHashMap<ModifiableDBIDs> clusters, double[] bestd, int[] besti, DistanceQuery<O> …  in findMerge()  argument
171       final int cy = besti[cx];  in findMerge()
190     merge(size, mat, prots, builder, clusters, dq, bestd, besti, x, y);  in findMerge()
208 …ashMap<ModifiableDBIDs> clusters, DistanceQuery<O> dq, double[] bestd, int[] besti, int x, int y) {
238     besti[x] = -1;
239     updateMatrices(size, mat, prots, builder, clusters, dq, bestd, besti, x, y);
240     if(besti[y] == x) {
241       findBest(size, distances, bestd, besti, y);
260 …ashMap<ModifiableDBIDs> clusters, DistanceQuery<O> dq, double[] bestd, int[] besti, int x, int y) {
276       updateCache(size, distances, bestd, besti, x, y, b, distances[yoffset + b]);
289 …updateCache(size, distances, bestd, besti, x, y, a, distances[MatrixParadigm.triangleSize(a) + y]);
305 …private void updateCache(int size, double[] scratch, double[] bestd, int[] besti, int x, int y, in…
309       besti[j] = y;
313     if(besti[j] == x || besti[j] == y) {
314       findBest(size, scratch, bestd, besti, j);
318   protected void findBest(int size, double[] scratch, double[] bestd, int[] besti, int j) {
324       if(besti[i] < 0) {
335       if(besti[i] < 0) {
345     besti[j] = bestij;