/guava/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
} return minChildIndex;queue[minChildIndex] = x;
queue[minChildIndex] = x; return minChildIndex; }
return size; } int crossOver(int index, E x) { int minChildIndex = findMinChild(index); if ((minChildIndex > 0) && (ordering.compare(elementData(minChildIndex), x) < 0)) { queue[index] = elementData(minChildIndex); <extra_id_0> return crossOverUp(index, x); } int fillHoleAt(int index) { int minGrandchildIndex; while ((minGrandchildIndex = findMinGrandChild(index)) > 0) { queue[index] = elementData(minGrandchildIndex);