/guava/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
return ( bubbledTo < index) ? new MoveDesc<E>( toTrickle, elementData( index) ) : null; } else {return heap.tryCrossOverAndBubbleUp( index, vacated, toTrickle) ;
return heap.tryCrossOverAndBubbleUp ( index, vacated, toTrickle ) ; } else { return ( bubbledTo < index ) ? new MoveDesc<E> ( toTrickle, elementData ( index ) ) : null;
@CheckForNull private MoveDesc<E> fillHole(int index, E toTrickle) { Heap heap = heapForIndex(index); int vacated = heap.fillHoleAt(index); int bubbledTo = heap.bubbleUpAlternatingLevels(vacated, toTrickle); if (bubbledTo == vacated) { <extra_id_0> } } static class MoveDesc<E> { final E toTrickle; final E replaced; MoveDesc(E toTrickle, E replaced) {