Chapter 18, Problem 5E

Explanation of Solution

Method:

//define a method

public void retainAll(HashIntSet other) {

    //loop executed for the length of the array

    for (int i = 0; i < elementData.length; i++) {

        //condition initialized to check whether the array element is equal to null or not

        if (elementData[i] != null) {

             //loop initialized till the array value is not equal to null and element is contained in other

            while (elementData[i] != null && !other.contains(elementData[i].data)) {

                //assign the value

                elementData[i] = elementData[i].next;

                //decrement the value

                size--;

            }

            //assign the value

            Node current = elementData[i];

            //loop initialized till the value of current is not equal to null and the next value is not equal to null

            while (current != null && current.next != null) {

                //condition initialized to check whether the next value of current is contained in other

                if (!other.contains(current.next.data)) {

                    //assign the value

                    current...