establish heap order property from an arbitrary arrangement of items . runs in linear time . concode_field_sep int DEFAULT_CAPACITY concode_elem_sep Result[] array concode_elem_sep int currentSize concode_field_sep boolean add concode_elem_sep void percolateDown concode_elem_sep void doubleArray concode_elem_sep boolean containsAll concode_elem_sep boolean isEmpty concode_elem_sep void clear concode_elem_sep PriorityQueue.Position insert concode_elem_sep void decreaseKey concode_elem_sep boolean remove concode_elem_sep int getSize concode_elem_sep boolean contains concode_elem_sep Iterator<Result> iterator concode_elem_sep boolean removeAll concode_elem_sep int size concode_elem_sep boolean addAll concode_elem_sep void makeEmpty concode_elem_sep Object[] toArray concode_elem_sep T[] toArray concode_elem_sep Result deleteMin concode_elem_sep Result findMin concode_elem_sep boolean retainAll
void function ( ) { for ( int loc0 = currentSize / 2 ; loc0 > 0 ; loc0 -- ) percolateDown ( loc0 ) ; }