JAVA(Fill in replace this) 2. a. Write a class called SortedSet. A SortedSet o

ID: 3850296 • Letter: J

Question

JAVA(Fill in *replace this*)

2. a. Write a class called SortedSet. A SortedSet object should contain a collection of objects, all of the same type. This means that SortedSet should be generic (i.e., SortedSet<T>). We would like our SortedSet class not to contain any duplicate elements. In SortedSet, the data should be kept in an array, and the array should be kept in ascending order (as determined by the compareTo method). This means that the data in a SortedSet must implement the Comparable<T> interface. The objects in the set should be stored in a private instance variable which is an array.

I have provided a constructor for the class. You must write the following:

b. An add method. It is passed an object of type T (the type variable). It returns true if the object is added to the set, or false otherwise. An item is not added to a set if an equivalent item is already in the set, or if the set is full. Equivalence is defined by the compareTo method of the T class. Remember that at all times the set must have its items in ascending order.

c. A remove method. It is passed an object of type T. It returns true if an equivalent object exists in the set, in which case it is removed. The method should return false if no equivalent item exists in the set.

d. A toString method. As always, toString should return a string which represents the object. In the case of SortedSet, we would like the string to reflect which items are in the set, and in what order.

e. A contains method. It is passed an object of type T. It should return true if an equivalent item is found in the set, or false otherwise.

The output of this code should be:.

package hw2;

public class SortedSet<T extends Comparable<T>> {
   private T[] items;
   private int size;

   // the constructor is passed the length of the array called "items",
   // which is then created.
   public SortedSet(int capacity) {
       // Java arrays and type variables don't mix very well
       items = (T[]) new Comparable[capacity];
       size = 0;
   }

   // you must complete the toString method
   public String toString() {
       StringBuilder ans = new StringBuilder("{");

       ans.append("}");
       return ans.toString();
   }

   public boolean isFull() {
       return size == items.length;
   }

   public boolean add(T item) {
       if (isFull()) return false;
       return false; // replace this with your own code





   }

   public boolean remove(T item) {
       return false; // replace this with your own code
   }

   public boolean contains(T item) {
       return false; // replace this with your own code
   }
}

Explanation / Answer

Answer:

Note: User given code is modified.

Code:

File Name: SortedSet.java

package hw2;

public class SortedSet<T extends Comparable<T>>

{

private T[] items;

private int size;

// the constructor is passed the length of the array called "items",

// which is then created.

public SortedSet(int capacity)

{

// Java arrays and type variables don't mix very well

items = (T[]) new Comparable[capacity];

size = 0;

}

// you must complete the toString method

public String toString()

{

StringBuilder ans = new StringBuilder("{");

//Loop

for(int kk=0;kk<size;kk++)

{

//Add

ans.append(items[kk]);

//Check condition

if(kk!=size-1)

//Append

ans.append(",");

}

//Append }

ans.append("}");

//Return

return ans.toString();

}

//Define method to check items is full.

public boolean isFull()

{

//Check condition

return size == items.length;

}

//Define method to add

public boolean add(T item)

{

//Check condition

if (isFull())

//Return

return false;

//Check condition

if(contains(item))

//Return

return false;

//Define variable

boolean retVal=false;

//Define

int kk=0;

//Loop

for(kk=0;kk<size;kk++)

{

//Check condition

if(items[kk].compareTo(item)>0)

//Break

break;

}

//Loop

for(int aa=items.length-2; aa>=kk;aa--)

{

//Move

items[aa+1]=items[aa];

}

//Add item

items[kk]=item;

//Increment size

size++;

//Return

return true;

}

//Define method to remove

public boolean remove(T item)

{

//Define variable

boolean retVal=false;

//Loop

for(int kk=0;kk<size;kk++)

{

//Check condition

if(items[kk]==item)

{

//Set value

retVal=true;

//Loop

for(int aa=kk;aa<size-1;aa++)

{

//Move

items[aa]=items[aa+1];

}

//Decrement size

size--;

//Break

break;

}

//Return

return retVal;

}

//Define method to check

public boolean contains(T item)

{

//Define variable

boolean retVal=false;

//Loop

for(int kk=0;kk<size;kk++)

{

//Check condition

if(items[kk]==item)

{

//Set value

retVal=true;

//Break

break;

}

//Return

return retVal; // replace this with your own code

}

File Name: HelloWorld.java

package hw2;

public class HelloWorld

{

public static void main(String[] args)

{

SortedSet<String> st=new SortedSet<String>(4);

System.out.println("Add a "+st.add("a"));