inserts the element and returns true if this element caused another element to be dropped from the queue . concode_field_sep long sentinel concode_elem_sep int size concode_elem_sep int currentCapacity concode_elem_sep int maxSize concode_elem_sep long[] heap concode_field_sep long add concode_elem_sep void downHeap concode_elem_sep void clear concode_elem_sep long[] sort concode_elem_sep long pop concode_elem_sep void addNoCheck concode_elem_sep long top concode_elem_sep int size concode_elem_sep void upHeap concode_elem_sep int getCurrentCapacity concode_elem_sep void resize concode_elem_sep void initialize concode_elem_sep long insertWithOverflow concode_elem_sep long updateTop concode_elem_sep long[] getInternalArray
boolean function ( long arg0 ) { if ( size < maxSize ) { add ( arg0 ) ; return false ; } else if ( arg0 > heap [ 1 ] ) { heap [ 1 ] = arg0 ; updateTop ( ) ; return true ; } else { return false ; } }