### Question:
FairQueue implements BlockingQueue<E> { @Override public boolean containsAll (Collection<?> c) { for (Object e : c) { if ( !contains (e)) { return false; } } return true; } FairQueue(); @Override int size(); @Override int remainingCapacity(); @Override void put(E e); @Override boolean offer(E e); @Override boolean offer(E e, long timeout, TimeUnit unit); @Override E take(); @Override E peek(); @Override E poll(); @Override E poll(long timeout, TimeUnit unit); @Override int drainTo(Collection<? super E> c); @Override int drainTo(Collection<? super E> c, int maxElements); @Override void clear(); @Override boolean contains(Object o); @Override Object[] toArray(); @Override T[] toArray(T[] a); @Override Iterator<E> iterator(); @Override E remove(); @Override E element(); @Override boolean isEmpty(); @Override boolean containsAll(Collection<?> c); @Override boolean addAll(Collection<? extends E> c); @Override boolean removeAll(Collection<?> c); @Override boolean retainAll(Collection<?> c); @Override boolean add(E e); @Override boolean remove(Object o);  }### Answer:
@Test public void testContainsAll() { queue.offer(new FairQueueTestString("key1", "item1")); queue.offer(new FairQueueTestString("key1", "item2")); queue.offer(new FairQueueTestString("key1", "item3")); queue.offer(new FairQueueTestString("key2", "item4")); queue.offer(new FairQueueTestString("key2", "item5")); ArrayList<FairQueueTestString> list = new ArrayList<>(); list.add(new FairQueueTestString("key1", "item1")); list.add(new FairQueueTestString("key2", "item4")); Assert.assertEquals(queue.containsAll(list), true); list.add(new FairQueueTestString("key3", "item5")); Assert.assertEquals(queue.containsAll(list), false); }