int function ( ) { if ( _expectedSize != _hash . size ( ) ) { throw new ConcurrentModificationException ( ) ; } byte [ ] loc0 = _hash . _states ; int loc1 = _index ; while ( loc1 -- > 0 && ( loc0 [ loc1 ] != TPrimitiveHash . FULL ) ) { ; } return loc1 ; }
returns the index of the next value in the data structure or a negative value if the iterator is exhausted . concode_field_sep int _index concode_elem_sep TPrimitiveHash _hash concode_elem_sep int _expectedSize concode_field_sep void moveToNextIndex concode_elem_sep boolean hasNext concode_elem_sep void remove