614 |
|
} |
615 |
|
assertTrue(q.isEmpty()); |
616 |
|
} |
617 |
+ |
|
618 |
+ |
/** |
619 |
+ |
* An add following remove(x) succeeds |
620 |
+ |
*/ |
621 |
+ |
public void testRemoveElementAndAdd() { |
622 |
+ |
try { |
623 |
+ |
LinkedBlockingQueue q = new LinkedBlockingQueue(); |
624 |
+ |
assertTrue(q.add(new Integer(1))); |
625 |
+ |
assertTrue(q.add(new Integer(2))); |
626 |
+ |
assertTrue(q.remove(new Integer(1))); |
627 |
+ |
assertTrue(q.remove(new Integer(2))); |
628 |
+ |
assertTrue(q.add(new Integer(3))); |
629 |
+ |
assertTrue(q.take() != null); |
630 |
+ |
} catch (Exception e){ |
631 |
+ |
unexpectedException(); |
632 |
+ |
} |
633 |
+ |
} |
634 |
|
|
635 |
|
/** |
636 |
|
* contains(x) reports true when elements added but not yet removed |
655 |
|
assertEquals(SIZE, q.remainingCapacity()); |
656 |
|
q.add(one); |
657 |
|
assertFalse(q.isEmpty()); |
658 |
+ |
assertTrue(q.contains(one)); |
659 |
|
q.clear(); |
660 |
|
assertTrue(q.isEmpty()); |
661 |
|
} |
974 |
|
assertEquals(l.size(), SIZE); |
975 |
|
for (int i = 0; i < SIZE; ++i) |
976 |
|
assertEquals(l.get(i), new Integer(i)); |
977 |
+ |
q.add(zero); |
978 |
+ |
q.add(one); |
979 |
+ |
assertFalse(q.isEmpty()); |
980 |
+ |
assertTrue(q.contains(zero)); |
981 |
+ |
assertTrue(q.contains(one)); |
982 |
+ |
l.clear(); |
983 |
+ |
q.drainTo(l); |
984 |
+ |
assertEquals(q.size(), 0); |
985 |
+ |
assertEquals(l.size(), 2); |
986 |
+ |
for (int i = 0; i < 2; ++i) |
987 |
+ |
assertEquals(l.get(i), new Integer(i)); |
988 |
|
} |
989 |
|
|
990 |
|
/** |
1009 |
|
for (int i = 0; i < SIZE; ++i) |
1010 |
|
assertEquals(l.get(i), new Integer(i)); |
1011 |
|
t.join(); |
1012 |
< |
assertTrue(q.size() + l.size() == SIZE+1); |
1012 |
> |
assertTrue(q.size() + l.size() >= SIZE); |
1013 |
|
} catch(Exception e){ |
1014 |
|
unexpectedException(); |
1015 |
|
} |
1043 |
|
* drainTo(c, n) empties first max {n, size} elements of queue into c |
1044 |
|
*/ |
1045 |
|
public void testDrainToN() { |
1046 |
+ |
LinkedBlockingQueue q = new LinkedBlockingQueue(); |
1047 |
|
for (int i = 0; i < SIZE + 2; ++i) { |
1048 |
< |
LinkedBlockingQueue q = populatedQueue(SIZE); |
1048 |
> |
for(int j = 0; j < SIZE; j++) |
1049 |
> |
assertTrue(q.offer(new Integer(j))); |
1050 |
|
ArrayList l = new ArrayList(); |
1051 |
|
q.drainTo(l, i); |
1052 |
|
int k = (i < SIZE)? i : SIZE; |
1022 |
– |
assertEquals(q.size(), SIZE-k); |
1053 |
|
assertEquals(l.size(), k); |
1054 |
+ |
assertEquals(q.size(), SIZE-k); |
1055 |
|
for (int j = 0; j < k; ++j) |
1056 |
|
assertEquals(l.get(j), new Integer(j)); |
1057 |
+ |
while (q.poll() != null) ; |
1058 |
|
} |
1059 |
|
} |
1060 |
|
|