long [ ] function ( ) { return heap ; }
returns the array used to hold the heap , with the smallest item at array 1 and the last but not necessarily largest at array size . this is not fully sorted . 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 boolean insert 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