Item function ( ) { if ( position < 0 ) { return null ; } if ( count < 0 ) { doSort ( ) ; } if ( position < count ) { return ( Item ) nodeKeys [ ( position ++ ) * recordSize ] ; } else { position = - 1 ; return null ; } }
get the next item , in sorted order 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 void doSort concode_elem_sep int compare concode_elem_sep Item current concode_elem_sep void buildArray concode_elem_sep void swap 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