sorts from , first + k-1 in the array of from,entries.length-1 using a variant of modified heapsort , such that array from < array from +1 < ... < array from + k-1 and array from + k-1 < arra from + k | | from + k +1 | | from + k +2 | | ... entries.length-1 note : if k is greater than a number , the sorting happens in batches of that number , this for performance reasons . concode_field_sep float MERGE_OR_HEAP_SWITCH concode_elem_sep int BATCH_SIZE concode_field_sep int bottomUpSearch concode_elem_sep void heapToSortedArray concode_elem_sep void adjustMaxElement concode_elem_sep void adjustHeap concode_elem_sep void heapify concode_elem_sep void partiallySort concode_elem_sep int leafSearch
void function ( MarkerEntry [ ] arg0 , Comparator < MarkerItem > arg1 , int arg2 , int arg3 , IProgressMonitor arg4 ) { sortStartingKElement ( arg0 , arg1 , arg2 , arg0 . length - 1 , arg3 , arg4 ) ; }