Question: please help me to complete the code shiftRight(int index) import java.util.Iterator; /** * Array-based implementation of the IndexList interface. * */ public class ArrayIndexedList implements
please help me to complete the code shiftRight(int index)
import java.util.Iterator;
/**
* Array-based implementation of the IndexList interface.
*
*/
public class ArrayIndexedList
/** stores elements of list. */
T[] elements;
/** index of next insertion point; number of elements in list. */
int rear;
/** Constructs an instance of this list. */
@SuppressWarnings("unchecked")
public ArrayIndexedList(int capacity) {
elements = (T[]) new Object[capacity];
rear = 0;
}
/** Returns the first element in this list. */
public T first() {
return null;
}
/** Returns the last element in this list. */
public T last() {
return null;
}
/** Removes the first element in this list. */
public T removeFirst() {
return null;
}
/** Removes the last element in this list. */
public T removeLast() {
return null;
}
/** Removes the specified element from this list. */
public T remove(T element) {
return null;
}
/** Returns true if this list has no elements, false otherwise. */
public boolean isEmpty() {
return rear == 0;
}
/** Returns the number of elements in this list. */
public int size() {
return rear;
}
/** Returns an iterator over the elements in this list. */
public Iterator
return null;
}
/** Returns a string representation of this list. */
public String toString() {
StringBuilder result = new StringBuilder();
result.append("[");
for (int i = 0; i < rear; i++) {
result.append(elements[i]);
result.append(", ");
}
result.delete(result.length() - 2, result.length());
result.append("]");
return result.toString();
}
/** Adds the given element at the specified index in this list. */
public boolean add(T element, int index) {
if (index == rear) {
return add(element);
}
if (!validIndex(index)) {
return false;
}
if (isFull()) {
resize(elements.length * 2);
}
shiftRight(index);
elements[index] = element;
rear++;
return true;
}
/** Adds the given element at the end of this list. */
public boolean add(T element) {
if (isFull()) {
resize(elements.length * 2);
}
elements[rear] = element;
rear++;
return true;
}
/** Replaces the current element at the specified index with the given elemeent. */
public boolean set(T element, int index) {
return false;
}
/** Returns the element at the given index in this list. */
public T get(int index) {
return null;
}
/** Returns the index of the specified element in this list. */
public int indexOf(T element) {
return -1;
}
/** Removes the element at the specified index in this list. */
public T remove(int index) {
return null;
}
/** Returns true if the array is full, false otherwise. */
private boolean isFull() {
return rear == elements.length;
}
/** Resizes the array to the specified size, copying corresonding elements. */
@SuppressWarnings("unchecked")
void resize(int capacity) {
assert (capacity >= rear);
T[] newArray = (T[]) new Object[capacity];
for (int i = 0; i < rear; i++) {
newArray[i] = elements[i];
}
elements = newArray;
}
/** Moves elements from index..rear-1 one index to the right. */
private void shiftRight(int index) {
assert !isFull();
// you must fill this in
}
/** Returns true if specified index is in the legal range, false otherwise. */
private boolean validIndex(int index) {
return (index >= 0) && (index < rear);
}
}
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
Study Help