void function ( final int arg0 ) { int loc0 = arg0 ; Activation loc1 = elements [ loc0 ] ; while ( loc0 > 1 && compare ( loc1 , elements [ loc0 / 2 ] ) > 0 ) { final int loc2 = loc0 / 2 ; setElement ( loc0 , elements [ loc2 ] ) ; loc0 = loc2 ; } setElement ( loc0 , loc1 ) ; }
percolates element up heap from from the position given by the index . assume it is a maximum heap . concode_field_sep Comparator comparator concode_elem_sep int size concode_elem_sep Activation[] elements concode_elem_sep Logger log concode_elem_sep int DEFAULT_CAPACITY concode_field_sep void writeExternal concode_elem_sep int compare concode_elem_sep void grow concode_elem_sep Activation dequeue concode_elem_sep Activation dequeue concode_elem_sep Activation dequeue concode_elem_sep void clear concode_elem_sep boolean isEmpty concode_elem_sep Activation[] getAndClear concode_elem_sep Activation peek concode_elem_sep void enqueue concode_elem_sep int size concode_elem_sep void percolateDownMaxHeap concode_elem_sep void readExternal concode_elem_sep Object[] toArray concode_elem_sep boolean isFull concode_elem_sep void setElement