/guava/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
queue[index] = elementData( minGrandchildIndex) ;E auntElement = elementData( auntIndex) ;
E auntElement = elementData ( auntIndex ) ;
int swapWithConceptuallyLastElement(E actualLastElement) { int parentIndex = getParentIndex(size); if (parentIndex != 0) { int grandparentIndex = getParentIndex(parentIndex); int auntIndex = getRightChildIndex(grandparentIndex); if (auntIndex != parentIndex && getLeftChildIndex(auntIndex) >= size) { <extra_id_0> if (ordering.compare(auntElement, actualLastElement) < 0) { queue[auntIndex] = actualLastElement; queue[size] = auntElement; return auntIndex; } }