FairQueue implements BlockingQueue<E> { @Override public boolean isEmpty () { return count.get () == 0; } 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);  }
@Test public void testIsEmpty() { Assert.assertEquals(queue.isEmpty(), true); queue.offer(new FairQueueTestString("key1", "item1")); Assert.assertEquals(queue.isEmpty(), false); }