void function ( byte arg0 ) { Node loc0 = new Node ( arg0 ) ; if ( head == null ) head = tail = loc0 ; else { tail . next = loc0 ; loc0 . prev = tail ; tail = loc0 ; } totalItems += 1 ; }
pushes an item into the queue . concode_field_sep Node head concode_elem_sep byte data concode_elem_sep Node prev concode_elem_sep int totalItems concode_elem_sep Node tail concode_elem_sep Node next concode_field_sep byte pop concode_elem_sep void removeAll concode_elem_sep boolean contains concode_elem_sep int size concode_elem_sep void removeItems concode_elem_sep byte getLastItem