Data Structures and Algorithm Analysis - Computer Science at ...

98 Chap. 4 Lists, Stacks, and Queues/** Array-based list implementation */class AList implements List {private static final int defaultSize = 10; // Default sizeprivate int maxSize; // Maximum size of listprivate int listSize; // Current # of list itemsprivate int curr;// Position of current elementprivate E[] listArray; // Array holding list elements/** Constructors *//** Create a list with the default capacity. */AList() { this(defaultSize); }/** Create a new list object.@param size Max # of elements list can contain. */@SuppressWarnings("unchecked") // Generic array allocationAList(int size) {maxSize = size;listSize = curr = 0;listArray = (E[])new Object[size]; // Create listArray}public void clear()// Reinitialize the list{ listSize = curr = 0; } // Simply reinitialize values/** Insert "it" at current position */public void insert(E it) {assert listSize < maxSize : "List capacity exceeded";for (int i=listSize; i>curr; i--) // Shift elements uplistArray[i] = listArray[i-1]; // to make roomlistArray[curr] = it;listSize++;// Increment list size}/** Append "it" to list */public void append(E it) {assert listSize < maxSize : "List capacity exceeded";listArray[listSize++] = it;}/** Remove and return the current element */public E remove() {if ((curr=listSize)) // No current elementreturn null;E it = listArray[curr]; // Copy the elementfor(int i=curr; i