this method will be used to create the heap which will be used to hold the chunk of data concode_field_sep int totalNumberOfRecords concode_elem_sep long[] nullSetWords concode_elem_sep int fileCounter concode_elem_sep DataOutputStream stream concode_elem_sep File[] intermediateFiles concode_elem_sep boolean[] noDictionarycolumnMapping concode_elem_sep AbstractQueue<SortTempChunkHolder> recordHolderHeap concode_elem_sep File outPutFile concode_elem_sep ByteBuffer rowData concode_elem_sep TempSortFileWriter writer concode_elem_sep SortParameters mergerParameters concode_elem_sep LogService LOGGER concode_field_sep Void call concode_elem_sep Object[] next concode_elem_sep void writeDataTofile concode_elem_sep Object[] getSortedRecordFromFile concode_elem_sep boolean hasNext concode_elem_sep void finish concode_elem_sep void initialize concode_elem_sep void startSorting
void function ( File [ ] arg0 ) { this . recordHolderHeap = new PriorityQueue < SortTempChunkHolder > ( arg0 . length ) ; }