for (int neighbor = start; neighbor != lastNeighbor; neighbor = summary.next(neighbor)) { assert minDistance == Math.abs(summary.mean(neighbor) - x); double q0 = (double) summary.headSum(neighbor) / count; double q1 = q0 + (double) summary.count(neighbor) / count; double k = Math.min(scale.max(q0, compression, count), scale.max(q1, compression, count));
long sum = summary.headSum(start); double n = 0; for (int neighbor = start; neighbor != lastNeighbor; neighbor = summary.next(neighbor)) {
int next = values.floorSum((long) index); assert next != IntAVLTree.NIL; long total = values.headSum(next); final int prev = values.prev(next); if (prev != IntAVLTree.NIL) {