Deque < Item > function ( ) { Deque < Item > loc0 = new Deque < > ( ) ; for ( Item loc1 : this ) loc0 . addLast ( loc1 ) ; return loc0 ; }
make a copy of the list and return it . concode_field_sep Node next concode_elem_sep Item item concode_elem_sep Node last concode_elem_sep long serialVersionUID concode_elem_sep int count concode_elem_sep long serialVersionUID concode_elem_sep Node first concode_field_sep void addLast concode_elem_sep int compare concode_elem_sep Iterator<Item> iterator concode_elem_sep int size concode_elem_sep Item removeFirst concode_elem_sep Item get concode_elem_sep boolean isEmpty concode_elem_sep boolean has concode_elem_sep int compareTo concode_elem_sep void addFirst concode_elem_sep Item remove