123     int[] besti = new int[size];  in run()  local
124     initializeNNCache(mat.matrix, bestd, besti);  in run()
134           findMerge(end, mat, bestd, besti, builder));  in run()
149   private static void initializeNNCache(double[] scratch, double[] bestd, int[] besti) {  in initializeNNCache()  argument
152     Arrays.fill(besti, -1);  in initializeNNCache()
161           besti[y] = x;  in initializeNNCache()
169       besti[x] = bestix;  in initializeNNCache()
185 …protected int findMerge(int size, MatrixParadigm mat, double[] bestd, int[] besti, PointerHierarch…  in findMerge()  argument
191       final int cy = besti[cx];  in findMerge()
204     merge(size, mat, bestd, besti, builder, mindist, x, y);  in findMerge()
220 …protected void merge(int size, MatrixParadigm mat, double[] bestd, int[] besti, PointerHierarchyRe…
235     besti[x] = -1;
238     updateMatrix(size, mat.matrix, iy, bestd, besti, builder, mindist, x, y, sizex, sizey);
239     if(besti[y] == x) {
240       findBest(size, mat.matrix, bestd, besti, y);
259 …atrix(int size, double[] scratch, DBIDArrayIter ij, double[] bestd, int[] besti, PointerHierarchyR…
273       updateCache(size, scratch, bestd, besti, x, y, j, d);
285       updateCache(size, scratch, bestd, besti, x, y, j, d);
296       updateCache(size, scratch, bestd, besti, x, y, j, d);
312 …private void updateCache(int size, double[] scratch, double[] bestd, int[] besti, int x, int y, in…
316       besti[j] = y;
320     if(besti[j] == x || besti[j] == y) {
321       findBest(size, scratch, bestd, besti, j);
325   protected void findBest(int size, double[] scratch, double[] bestd, int[] besti, int j) {
331       if(besti[i] < 0) {
342       if(besti[i] < 0) {
352     besti[j] = bestij;