hopsa r uto Swed 22213 do Introduction The labs in CSC172 will follow a pair programming paradigm. Every student is encouraged (but not strictly required) to have a lab partner. Every student must hand in their own work but also list the name of their lab partner if any on all labs. In this lab, you will work on List ADT (Abstract data type). We provide you the following URList interface and all you have to do is create two classes URArrayList and URLinkedlist those implement URList interface. Moreover, both URArrayList and URLinkedList must implement additional functionality as described below. import java.util.Collection; import java.util.Iterator; // URList class ADT. Generalize the element type using Java Generics. public interface URList
extends Iterable{ // URList class ADT // Appends the specified element to the end of this list boolean add(E e); 1/ Inserts the specified element at the specified position in this list void add(int index, E element); // Appends all of the elements in the specified collection to the end of this list, MacBook Air // Appends the specified element to the end of this list boolean add(E e); // Inserts the specified element at the specified position in this list void add (int index, E element); // Appends all of the elements in the specified collection to the end of this list, // in the order that they are returned by the specified collection's iterator boolean addAll(Collection extends E> c); // Inserts all of the elements in the specified collection into this list // at the specified position boolean addAll(int index, Collection extends E> c); // Removes all of the elements from this list void clear(); // Returns true if this list contains the specified element. boolean contains(Object o); // Returns true if this list contains all of the elements of the specified collection boolean containsAll(Collection> c); // Compares the specified object with this list for equality. // Returns true if both contain the same elements. Ignore capacity holandia MacBook Air // Compares the specified object with this list for equality. 7/ Returns true if both contain the same elements. Ignore capacity boolean equals(Object o); Lab #5 (List ADT) Page 1/4 // Returns the element at the specified position in this list. E get(int index); // Returns the index of the first occurrence of the specified element in this list, // or -1 if this list does not contain the element. int indexOf(object o); // Returns true if this list contains no elements. boolean isEmpty(); // Returns an iterator over the elements in this list in proper sequence Iterator iteratori MacBook Air 24 // Removes the element at the specified position in this list E remove(int index); // Removes the first occurrence of the specified element from this list, // if it is present boolean remove(Object o); // Removes from this list all of its elements that are contained // in the specified collection boolean removeAll(Collection> c); // Replaces the element at the specified position in this list // with the specified element E set(int index, E element); // Returns the number of elements in this list. int size(); // Returns a view of the portion of this list // between the specified from Index, inclusive, and toIndex, exclusive. URList subList(int fromIndex, int toIndex); // Returns an array containing all of the elements in this list // in proper sequence (from first to the last element). MacBook Air // Returns an array containing all of the elements in this list 11 in proper sequence (from first to the last element). Object[toArray(); Methods specific for only URArrayList class: 17 Increases the capacity of this ArrayList instance, if necessary, // to ensure that it can hold at least the number of elements specified // by the minimum capacity argument. void ensureCapacity(int minCapacity) // Returns the current capacity of the list int getCapacity() Methods specific for only URLinkedlist class: Page 2/4 Lab #5 (List ADT) MacBook Air Methods specific for only URLinkedList class: Lab #5 (List ADT) Page 214 // Inserts the specified element at the beginning of this list. void addFirst (Ee) // Appends the specified element to the end of this list. void addLast (Ee) // Retrieves, but does not remove, the first element of this list, or returns null it this list is empty. E peekFirst() // Retrieves, but does not remove, the last element of this list, or returns null if this list is empty. E peekLast() 1/ Retrieves and removes the first element of this list or anonsult this list MacBook Ait // Retrieves and removes the first element of this list, or returns null if this list is empty. E pollFirst() // Retrieves and removes the last element of this list, or returns null if this list is empty. E polllast You must use the following URNode objects for your URLinkedList implementation. class URNode { // Doubly linked list node private E e; // Value for this node private URNode n; // Reference to next nodo in list private URNode p; // Reference to previous node // Constructors URNode (E it, URNode inp, URNode inn) {e = it; p = inp; n = inn; } URNode (URNode inp, URNode inn) { p = inp; n = inn; } // Get and set methods for the data members public E element() { return e; } // Return the value public E setElement(E it) { return e = it; } // Set element value public URNode next() { return n; } // Return next link public URNode setNext (URNode nextval) { return n - nextval; } // Set next link public URNode prev() { return p; } // Return prev link WIR DURC MacBook Air - Umuwmg URNode objects for your URLinkedList implementation. class URNode { // Doubly linked list node private Ee; 17 Value for this node private URNode n; // Reference to next node in list private URNode P; // Reference to previous node 7/ Constructors URNode (E it, URNode inp, URNode inn) {e = it; p = inp; n = inn; } URNode (URNode inp, URNode inn) { p = inp; n - inn; } // Get and set methods for the data members public E element() { return e; } // Return the value public E setElement(E it) { return e - it; } // Set element value public URNode next() { return n; } // Return next link public URNode setNext (URNode nextval) { return n = nextval; } // Set next link public URNode prev() { return p; } // Return prev link public URNode set Prev (URNode prevval) { return p = prevval; } // Set prev link hopsa r uto Swed 22213 do Introduction The labs in CSC172 will follow a pair programming paradigm. Every student is encouraged (but not strictly required) to have a lab partner. Every student must hand in their own work but also list the name of their lab partner if any on all labs. In this lab, you will work on List ADT (Abstract data type). We provide you the following URList interface and all you have to do is create two classes URArrayList and URLinkedlist those implement URList interface. Moreover, both URArrayList and URLinkedList must implement additional functionality as described below. import java.util.Collection; import java.util.Iterator; // URList class ADT. Generalize the element type using Java Generics. public interface URList extends Iterable{ // URList class ADT // Appends the specified element to the end of this list boolean add(E e); 1/ Inserts the specified element at the specified position in this list void add(int index, E element); // Appends all of the elements in the specified collection to the end of this list, MacBook Air // Appends the specified element to the end of this list boolean add(E e); // Inserts the specified element at the specified position in this list void add (int index, E element); // Appends all of the elements in the specified collection to the end of this list, // in the order that they are returned by the specified collection's iterator boolean addAll(Collection extends E> c); // Inserts all of the elements in the specified collection into this list // at the specified position boolean addAll(int index, Collection extends E> c); // Removes all of the elements from this list void clear(); // Returns true if this list contains the specified element. boolean contains(Object o); // Returns true if this list contains all of the elements of the specified collection boolean containsAll(Collection> c); // Compares the specified object with this list for equality. // Returns true if both contain the same elements. Ignore capacity holandia MacBook Air // Compares the specified object with this list for equality. 7/ Returns true if both contain the same elements. Ignore capacity boolean equals(Object o); Lab #5 (List ADT) Page 1/4 // Returns the element at the specified position in this list. E get(int index); // Returns the index of the first occurrence of the specified element in this list, // or -1 if this list does not contain the element. int indexOf(object o); // Returns true if this list contains no elements. boolean isEmpty(); // Returns an iterator over the elements in this list in proper sequence Iterator iteratori MacBook Air 24 // Removes the element at the specified position in this list E remove(int index); // Removes the first occurrence of the specified element from this list, // if it is present boolean remove(Object o); // Removes from this list all of its elements that are contained // in the specified collection boolean removeAll(Collection> c); // Replaces the element at the specified position in this list // with the specified element E set(int index, E element); // Returns the number of elements in this list. int size(); // Returns a view of the portion of this list // between the specified from Index, inclusive, and toIndex, exclusive. URList subList(int fromIndex, int toIndex); // Returns an array containing all of the elements in this list // in proper sequence (from first to the last element). MacBook Air // Returns an array containing all of the elements in this list 11 in proper sequence (from first to the last element). Object[toArray(); Methods specific for only URArrayList class: 17 Increases the capacity of this ArrayList instance, if necessary, // to ensure that it can hold at least the number of elements specified // by the minimum capacity argument. void ensureCapacity(int minCapacity) // Returns the current capacity of the list int getCapacity() Methods specific for only URLinkedlist class: Page 2/4 Lab #5 (List ADT) MacBook Air Methods specific for only URLinkedList class: Lab #5 (List ADT) Page 214 // Inserts the specified element at the beginning of this list. void addFirst (Ee) // Appends the specified element to the end of this list. void addLast (Ee) // Retrieves, but does not remove, the first element of this list, or returns null it this list is empty. E peekFirst() // Retrieves, but does not remove, the last element of this list, or returns null if this list is empty. E peekLast() 1/ Retrieves and removes the first element of this list or anonsult this list MacBook Ait // Retrieves and removes the first element of this list, or returns null if this list is empty. E pollFirst() // Retrieves and removes the last element of this list, or returns null if this list is empty. E polllast You must use the following URNode objects for your URLinkedList implementation. class URNode { // Doubly linked list node private E e; // Value for this node private URNode n; // Reference to next nodo in list private URNode p; // Reference to previous node // Constructors URNode (E it, URNode inp, URNode inn) {e = it; p = inp; n = inn; } URNode (URNode inp, URNode inn) { p = inp; n = inn; } // Get and set methods for the data members public E element() { return e; } // Return the value public E setElement(E it) { return e = it; } // Set element value public URNode next() { return n; } // Return next link public URNode setNext (URNode nextval) { return n - nextval; } // Set next link public URNode prev() { return p; } // Return prev link WIR DURC MacBook Air - Umuwmg URNode objects for your URLinkedList implementation. class URNode { // Doubly linked list node private Ee; 17 Value for this node private URNode n; // Reference to next node in list private URNode P; // Reference to previous node 7/ Constructors URNode (E it, URNode inp, URNode inn) {e = it; p = inp; n = inn; } URNode (URNode inp, URNode inn) { p = inp; n - inn; } // Get and set methods for the data members public E element() { return e; } // Return the value public E setElement(E it) { return e - it; } // Set element value public URNode next() { return n; } // Return next link public URNode setNext (URNode nextval) { return n = nextval; } // Set next link public URNode prev() { return p; } // Return prev link public URNode set Prev (URNode prevval) { return p = prevval; } // Set prev link
