mplement the 4 methods marked ''// Your Code' in the OurListSet class. public boolean addAll(OurSet set) public boolean containsAll(OurSet set) public boolean removeAll(OurSet set) public boolean retainAll(OurSet set) (note: this was written in BlueJ) Here is the full code for OutListSet.java: import java.util.Iterator; /**  * Write a description of class OurListSet here.  *  * @author (your name)  * @version (a version number or a date)  */ public class OurListSet implements OurSet {     private OurList list;     /**      * Constructor for objects of class OurListSet      */     public OurListSet()     {         this(new OurArrayList());     }          // Designated Constructor     public OurListSet(OurList newList)     {         list = newList;     }          private class OurListIterator implements Iterator     {         private OurList listToIterateOver;         private int position;                  public OurListIterator(OurList list)         {             listToIterateOver = list;             position = 0;         }                  public boolean hasNext()         {             return position < listToIterateOver.size();         }         public E next()         {             E elementToReturn = listToIterateOver.get(position);             position++;             return elementToReturn;         }     }     public boolean add(E obj)     {         if(contains(obj))         {             return false;         }         else         {             return list.add(obj);         }     }              public boolean contains(E obj)     {         return list.contains(obj);     }          // Your Code     public boolean addAll(OurSet set)     {         return false;     }          // Your Code     public boolean containsAll(OurSet set)     {         return false;     }          // Your Code     public boolean removeAll(OurSet set)     {         return false;     }          // Your Code     public boolean retainAll(OurSet set)     {         return false;     }          public boolean isEmpty()     {         return list.isEmpty();     }          public Iterator iterator()     {         return new OurListIterator(list);     }          public boolean remove(Object obj)     {         return list.remove(obj);     }               public int size()     {         return list.size();     }

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
icon
Concept explainers
Question

Implement the 4 methods marked ''// Your Code' in the OurListSet class.

public boolean addAll(OurSet<E> set)

public boolean containsAll(OurSet<E> set)

public boolean removeAll(OurSet<E> set)

public boolean retainAll(OurSet<E> set)

(note: this was written in BlueJ)

Here is the full code for OutListSet.java:

import java.util.Iterator;

/**
 * Write a description of class OurListSet here.
 *
 * @author (your name)
 * @version (a version number or a date)
 */
public class OurListSet<E> implements OurSet<E>
{
    private OurList<E> list;
    /**
     * Constructor for objects of class OurListSet
     */
    public OurListSet()
    {
        this(new OurArrayList());
    }
    
    // Designated Constructor
    public OurListSet(OurList<E> newList)
    {
        list = newList;
    }
    
    private class OurListIterator<E> implements Iterator<E>
    {
        private OurList<E> listToIterateOver;
        private int position;
        
        public OurListIterator(OurList<E> list)
        {
            listToIterateOver = list;
            position = 0;
        }
        
        public boolean hasNext()
        {
            return position < listToIterateOver.size();
        }
        public E next()
        {
            E elementToReturn = listToIterateOver.get(position);
            position++;
            return elementToReturn;
        }
    }

    public boolean add(E obj)
    {
        if(contains(obj))
        {
            return false;
        }
        else
        {
            return list.add(obj);
        }
    }
    
        public boolean contains(E obj)
    {
        return list.contains(obj);
    }
    
    // Your Code
    public boolean addAll(OurSet<E> set)
    {
        return false;
    }
    
    // Your Code
    public boolean containsAll(OurSet<E> set)
    {
        return false;
    }
    
    // Your Code
    public boolean removeAll(OurSet<E> set)
    {
        return false;
    }
    
    // Your Code
    public boolean retainAll(OurSet<E> set)
    {
        return false;
    }
    
    public boolean isEmpty()
    {
        return list.isEmpty();
    }
    
    public Iterator<E> iterator()
    {
        return new OurListIterator<E>(list);
    }
    
    public boolean remove(Object obj)
    {
        return list.remove(obj);
    }
    
    
    public int size()
    {
        return list.size();
    }
}

Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Types of Linked List
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-engineering and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY