test method for mylinkedlist.mylinkedlist #iterator . concode_field_sep String[] VALUES concode_elem_sep MyLinkedQueue<String> mll concode_field_sep void testPeekLastEmpty concode_elem_sep void testIteratorHasNextMiddle concode_elem_sep void testIteratorHasNextEndEmpty concode_elem_sep void testPeekLast concode_elem_sep void testIteratorRemoveEmpty concode_elem_sep void testDelete concode_elem_sep void testDeleteEmpty concode_elem_sep void testRemoveMiddle concode_elem_sep void testIsEmpty concode_elem_sep void testRemoveFirst concode_elem_sep void testSize concode_elem_sep void setUp concode_elem_sep void testIsNotEmpty concode_elem_sep void testIteratorHasNextBegin concode_elem_sep void testRemoveIntStart concode_elem_sep void testPeekEmpty concode_elem_sep void testIteratorNextEmpty concode_elem_sep void testGetStart concode_elem_sep void testClearEmpty concode_elem_sep void testAddIntStart concode_elem_sep void testAddIntAfterEnd concode_elem_sep void testRemoveTwoTimes concode_elem_sep void testAddE concode_elem_sep void tearDown concode_elem_sep void testClearFull concode_elem_sep void testPeek concode_elem_sep void testIteratorRemoveWithoutHasNext concode_elem_sep void testIterator concode_elem_sep void testIteratorNextEOF concode_elem_sep void testToString concode_elem_sep void testRemoveEmpty concode_elem_sep void testDeleteJustOne concode_elem_sep void testGetEnd
void function ( ) { for ( String loc0 : VALUES ) mll . append ( loc0 ) ; Iterator < String > loc1 = mll . iterator ( ) ; boolean loc2 = false ; int loc3 = VALUES . length ; while ( -- loc3 >= 0 ) loc1 . next ( ) ; boolean loc4 = loc1 . hasNext ( ) ; assertEquals ( loc2 , loc4 ) ; }