public void testAddAll5(){
  Integer[] empty=new Integer[0];
  Integer[] ints=new Integer[SIZE];
  for (int i=0; i < SIZE; ++i)   ints[i]=new Integer(i);
  LinkedBlockingQueue q=new LinkedBlockingQueue(SIZE);
  assertFalse(q.addAll(Arrays.asList(empty)));
  assertTrue(q.addAll(Arrays.asList(ints)));
  for (int i=0; i < SIZE; ++i)   assertEquals(ints[i],q.poll());
}

public void testAddAll5 ( ) { Integer [ ] empty = new Integer [ 0 ] ; Integer [ ] ints = new Integer [ SIZE ] ; for ( int i = 0 ; i < SIZE ; ++ i ) ints [ i ] = new Integer ( i ) ; LinkedBlockingQueue q = new LinkedBlockingQueue ( SIZE ) ; assertFalse ( q . addAll ( Arrays . asList ( empty ) ) ) ; assertTrue ( q . addAll ( Arrays . asList ( ints ) ) ) ; for ( int i = 0 ; i < SIZE ; ++ i ) assertEquals ( ints [ i ] , q . poll ( ) ) ; }
queue contains all elements , in traversal order , of successful addall
