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