Lines Matching defs:distance
73 final int[] distance; // cache of distance
74 Choice(Coding coding, int index, int[] distance) {
77 this.distance = distance;
81 int minDistance; // min distance from already-checked choices
156 int[] distance = new int[choices.length];
157 choices[nc++] = new Choice(allCodingChoices[i], i, distance);
167 choices[i].distance[j] = dij;
168 choices[j].distance[i] = dij;
174 int[] distance = new int[choices.length];
175 for (int i = 0; i < distance.length; i++) {
180 distance[i] = dij;
182 Choice c = new Choice(coding, -1, distance);
445 // min distance to all previously evaluated choices, in this range.
449 int[] distance = near.distance;
456 if (distance[i] >= dlo && distance[i] <= dhi) {
457 // Try also to keep min-distance from other guys in bounds:
522 int[] distance = c.distance;
528 int d = distance[i];
537 // Now maxd has the distance of the farthest outlier