void function ( int arg0 , int arg1 ) { int loc0 = arg0 * recordSize ; int loc1 = arg1 * recordSize ; for ( int loc2 = 0 ; loc2 < recordSize ; loc2 ++ ) { Object loc3 = nodeKeys [ loc0 + loc2 ] ; nodeKeys [ loc0 + loc2 ] = nodeKeys [ loc1 + loc2 ] ; nodeKeys [ loc1 + loc2 ] = loc3 ; } }
swap two items needed to implement the sortable interface concode_field_sep int count concode_elem_sep int hostLanguage concode_elem_sep SortKeyEvaluator sortKeyEvaluator concode_elem_sep XPathContext context concode_elem_sep Object[] nodeKeys concode_elem_sep int position concode_elem_sep SequenceIterator base concode_elem_sep AtomicComparer[] comparators concode_elem_sep int recordSize concode_field_sep Item next concode_elem_sep void doSort concode_elem_sep int compare concode_elem_sep Item current concode_elem_sep void buildArray concode_elem_sep int getProperties concode_elem_sep boolean hasNext concode_elem_sep int position concode_elem_sep int getLastPosition concode_elem_sep SequenceIterator getAnother concode_elem_sep void close concode_elem_sep void setHostLanguage