Question: import java.util.Iterator; import java.util.NoSuchElementException; public class KeepOddWrapper { public interface List extends Iterable { public int size ( ) ; public boolean isEmpty ( )

import java.util.Iterator;
import java.util.NoSuchElementException;
public class KeepOddWrapper {
public interface List extends Iterable {
public int size();
public boolean isEmpty();
public boolean isMember(E e);
public int firstIndexOf(E e);
public int lastIndexOf(E e);
public void add(E e);
public void add(E e, int position);
public E get(int position);
public E remove(int position);
public E replace(int position, E newElement);
public void clear();
public Object[] toArray();
public int keepOdd();
}
@SuppressWarnings("unchecked")
public static class ArrayList implements List {
@SuppressWarnings("hiding")
private class ArrayListIterator implements Iterator {
private int currentPosition;
public ArrayListIterator(){
super();
this.currentPosition =0;
}
@Override
public boolean hasNext(){
return this.currentPosition < currentSize;
}
@Override
public E next(){
if (this.hasNext()){
E result =(E) elements[this.currentPosition++]; // elements is array in enclosing class
return result;
}
else {
throw new NoSuchElementException();
}
}
}
private E[] elements;
private int currentSize;
private static final int DEFAULT_SIZE =10;
public ArrayList(int initialSize){
if (initialSize <1){
throw new IllegalArgumentException("Size must be at least 1.");
}
this.elements =(E[]) new Object[initialSize];
this.currentSize =0;
}
public ArrayList(){
this(DEFAULT_SIZE);
}
@Override
public int size(){
return this.currentSize;
}
@Override
public boolean isEmpty(){
return this.size()==0;
}
@Override
public boolean isMember(E e){
return this.firstIndexOf(e)>=0;
}
@Override
public int firstIndexOf(E e){
for (int i=0; i < this.size(); ++i){
if (this.elements[i].equals(e)){
return i;
}
}
return -1;
}
@Override
public void add(E e){
if (this.size()== this.elements.length){
this.reAllocate();
}
this.elements[this.currentSize++]= e;
}
private void reAllocate(){
E[] temp =(E[]) new Object[2*this.size()];
for (int i=0; i < this.size(); ++i){
temp[i]= this.elements[i];
}
this.elements = temp;
}
@Override
public void add(E e, int position){
if ((position <0)||(position > this.currentSize)){
throw new IndexOutOfBoundsException("Illegal position");
}
if (position == this.currentSize){
this.add(e);
}
else {
if (this.size()== this.elements.length){
this.reAllocate();
}
for (int i=this.currentSize; i > position; --i){
this.elements[i]= this.elements[i-1];
}
this.elements[position]= e;
this.currentSize++;
}
}
@Override
public E get(int position){
if ((position <0)||(position >= this.currentSize)){
throw new IndexOutOfBoundsException("Illegal position");
}
return this.elements[position];
}
@Override
public E remove(int position){
if ((position <0)||(position >= this.currentSize)){
throw new IndexOutOfBoundsException("Illegal position");
}
E result = this.elements[position];
for (int i=position; i < this.size()-1; ++i){
this.elements[i]= this.elements[i +1];
}
this.elements[this.currentSize-1]= null;
this.currentSize--;
return result;
}
@Override
public E replace(int position, E newElement){
if ((position <0)||(position >= this.currentSize)){
throw new IndexOutOfBoundsException("Illegal position");
}
E result = this.elements[position];
this.elements[position]= newElement;
return result;
}
@Override
public void clear(){
while(!this.isEmpty()){
this.remove(0);
}
}
@Override
public Object[] toArray(){
Object[] result =(E[]) new Object[this.size()];
System.arraycopy(this.elements, 0, result, 0, this.size());
// for (int i=0; i < this.size(); ++i){
// result[i]= this.elements[i];
//}
return result;
}
@Override
public Iterator iterator(){
return new ArrayListIterator();
}
@Override
public int lastIndexOf(E e){
for (int i=this.currentSize-1; i>=0; --i){
if (this.elements[i].equals(e)){
return i;
}
}
// not found
return -1;
}
@Override
public int keepOdd(){
int removedCount =0;
int currentIndex =1; // Start at index 1, which is the second element (odd index)
// Continue looping while currentIndex is within the bounds of the list
while (currentIndex < this.size()){
this.Consider a member method keepOdd for the List ADT. This method takes a list L and only keeps the elements in the odd positions (i.e.,1,3,5,...).
The method returns the number of elements in even positions thremove(currentIndex); // Remove the element at the

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!

Q:

please use java thanks. do not need to compile, just write the code. the LinkedHashSet code is: import java.util.Iterator; import java.util.NoSuchElementException; public class LinkedHashSet...

Q:

UArrayList Code: import java.util.ConcurrentModificationException; import java.util.Iterator; import java.util.NoSuchElementException; public class UArrayList extends AArrayList implements...

Q:

A circular doubly linked list is a linked list where every node has a next pointer and a previous pointer. The new thing that differentiates this from a regular doubly linked list is that the header...

Q:

Instruction: Consider a member method of the List ADT named isPalindrome. This method determines whether the elements in the list form a palindrome. That is, whether you get tne same result if you...

Q:

import java.util.Iterator; import java.util.NoSuchElementException; public class LinkedListWrapper { public static interface List extends Iterable { public int size(); public boolean isEmpty();...

Q:

Instruction: Consider a member method findDuplicates which returns a new List with all the elements that appear more than once in the original list. The resulting list itself cannot have duplicates....

Q:

Write a non-member method named listReplacer() that receives as parameter a SinglyLinkedList L, and two elements e and f. The method replaces each copy of e with f in the list in time O(n)(), where n...

Q:

import java.util.Iterator; import java.util.NoSuchElementException; public class Exam1a1List1Wrapper { public static interface List extends Iterable { public int size(); public boolean isEmpty();...

Q:

import java.util.Iterator; import java.util.NoSuchElementException; public class Quiz3aWrapper { public static interface List extends Iterable { public int size(); public boolean isEmpty(); public...

Q:

Code: import java.util.ConcurrentModificationException; import java.util.Iterator; import java.util.NoSuchElementException; public class UArrayList extends AArrayList implements UnorderedListADT { //...

Q:

You want to set aside some money for your friend Pip. (a) You have great expectations for Pip and want to give him $250,000 a year for 20 years. If youre able to lock in an effective annual nominal...

Q:

The following data pertain to the death of a resident alien: Property acquired by decedent prior to marriage Property acquired by surviving spouse prior to marriage Property inherited by decedent...

Q:

\ table [ [ P , Returns ] , [ Year , x , Y

Q:

3 Perform the following tasks a Do the following problems without a calculator For each problem display the answer you get Then check on the calculator Display your answers 1a 12 5 4 3 2a 2 5 6 2 0...