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