PriorityQueue . Position function ( ComparableJ2me arg0 ) { if ( currentSize + 1 == array . length ) doubleArray ( ) ; int loc0 = ++ currentSize ; array [ 0 ] = arg0 ; for ( ; arg0 . compareTo ( array [ loc0 / 2 ] ) < 0 ; loc0 /= 2 ) array [ loc0 ] = array [ loc0 / 2 ] ; array [ loc0 ] = arg0 ; return null ; }
insert into the priority queue . duplicates are allowed . concode_field_sep int DEFAULT_CAPACITY concode_elem_sep ComparableJ2me[] array concode_elem_sep int n concode_elem_sep int currentSize concode_field_sep void percolateDown concode_elem_sep void buildHeap concode_elem_sep void doubleArray concode_elem_sep int size concode_elem_sep int intValue concode_elem_sep void makeEmpty concode_elem_sep boolean isEmpty concode_elem_sep ComparableJ2me deleteMin concode_elem_sep int compareTo concode_elem_sep ComparableJ2me findMin