void function ( Key arg0 ) { if ( n == pq . length - 1 ) resize ( 2 * pq . length ) ; pq [ ++ n ] = arg0 ; swim ( n ) ; assert isMinHeap ( ) ; }
adds a new key to this priority queue . concode_field_sep Key[] pq concode_elem_sep Comparator<Key> comparator concode_elem_sep MinPQ<Key> copy concode_elem_sep int n concode_field_sep Key next concode_elem_sep Key delMin concode_elem_sep boolean isMinHeap concode_elem_sep boolean isMinHeap concode_elem_sep void sink concode_elem_sep boolean isEmpty concode_elem_sep boolean hasNext concode_elem_sep void main concode_elem_sep void remove concode_elem_sep Iterator<Key> iterator concode_elem_sep Key min concode_elem_sep int size concode_elem_sep void exch concode_elem_sep void resize concode_elem_sep boolean greater concode_elem_sep void swim