inserts a record to be sorted . concode_field_sep Sorter<PackedRecordPointer,LongArray> sorter concode_elem_sep LongArray pointerArray concode_elem_sep LongArray array concode_elem_sep PackedRecordPointer packedRecordPointer concode_elem_sep int pos concode_elem_sep int numRecords concode_elem_sep SortComparator SORT_COMPARATOR concode_elem_sep int position concode_elem_sep MemoryConsumer consumer concode_field_sep long getMemoryUsage concode_elem_sep ShuffleSorterIterator getSortedIterator concode_elem_sep int compare concode_elem_sep void expandPointerArray concode_elem_sep void loadNext concode_elem_sep int numRecords concode_elem_sep void reset concode_elem_sep boolean hasNext concode_elem_sep boolean hasSpaceForAnotherRecord concode_elem_sep void free
void function ( long arg0 , int arg1 ) { if ( ! hasSpaceForAnotherRecord ( ) ) { expandPointerArray ( consumer . allocateArray ( array . size ( ) * 2 ) ) ; } array . set ( pos , PackedRecordPointer . packPointer ( arg0 , arg1 ) ) ; pos ++ ; }