adds element to the priorityqueue in log size time if either the priorityqueue is not full , or not lessthan element , top . concode_field_sep int size concode_elem_sep int maxSize concode_elem_sep T[] heap concode_field_sep T pop concode_elem_sep T top concode_elem_sep int size concode_elem_sep void upHeap concode_elem_sep void downHeap concode_elem_sep boolean lessThan concode_elem_sep void clear concode_elem_sep void initialize concode_elem_sep void put concode_elem_sep void adjustTop
boolean function ( T arg0 ) { if ( size < maxSize ) { put ( arg0 ) ; return true ; } else if ( size > 0 && ! lessThan ( arg0 , top ( ) ) ) { heap [ 1 ] = arg0 ; adjustTop ( ) ; return true ; } else return false ; }