/guava/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
queue[index] = elementData( leftChildIndex) ;
queue[index] = elementData ( minGrandchildIndex ) ;
} return crossOverUp(index, x); } int fillHoleAt(int index) { int minGrandchildIndex; while ((minGrandchildIndex = findMinGrandChild(index)) > 0) { <extra_id_0> index = minGrandchildIndex; } return index; } private boolean verifyIndex(int i) { if ((getLeftChildIndex(i) < size) && (compareElements(i, getLeftChildIndex(i)) > 0)) {