PriorityQueueElement function ( ) { PriorityQueueElement loc0 = ( PriorityQueueElement ) queue . get ( 0 ) ; queue . set ( 0 , queue . get ( size ( ) - 1 ) ) ; queue . remove ( size ( ) - 1 ) ; if ( hasNext ( ) ) { heapValueDownwards ( ) ; } return loc0 ; }
returns the element with the highest priority concode_field_sep ArrayList queue concode_field_sep void add concode_elem_sep int size concode_elem_sep double getPriority concode_elem_sep void heapValueDownwards concode_elem_sep boolean hasNext concode_elem_sep void heapValueUpwards concode_elem_sep String getRevision