E function ( ) { if ( this . heap . size ( ) > 0 ) { final HeadStream < E > loc0 = this . heap . peek ( ) ; E loc1 = loc0 . getHead ( ) ; if ( ! loc0 . nextHead ( ) ) { this . heap . poll ( ) ; } else { this . heap . adjustTop ( ) ; } return loc1 ; } else { return null ; } }
gets the next smallest element , with respect to the definition of order implied by the typeserializer provided to this iterator . concode_field_sep E head concode_elem_sep TypeComparator<E> comparator concode_elem_sep MutableObjectIterator<E> iterator concode_elem_sep PartialOrderPriorityQueue<HeadStream<E>> heap concode_field_sep boolean nextHead concode_elem_sep int compare concode_elem_sep E getHead