question: calculates the size of all the iterators . caches it for fast lookups in the future . iterators should n't change size after the queries have been executed so caching is safe assumption , should check . concode_field_sep int m_fullSize concode_elem_sep int m_activeIteratorIndex concode_elem_sep OJBIterator m_activeIterator concode_elem_sep int m_currentCursorPosition concode_elem_sep List m_rsIterators concode_elem_sep boolean disableLifeCycleEvents concode_field_sep Object next concode_elem_sep void disableLifeCycleEvents concode_elem_sep boolean setNextIterator concode_elem_sep int fullSize concode_elem_sep void addIterator concode_elem_sep boolean absolute concode_elem_sep boolean hasNext concode_elem_sep void releaseDbResources concode_elem_sep boolean containsIteratorForTable concode_elem_sep void remove concode_elem_sep boolean relative
target: int function ( ) { if ( m_fullSize == - 1 ) { int loc0 = 0 ; Iterator loc1 = m_rsIterators . iterator ( ) ; while ( loc1 . hasNext ( ) ) { loc0 += ( ( OJBIterator ) loc1 . next ( ) ) . loc0 ( ) ; } m_fullSize = loc0 ; } return m_fullSize ; }