177 |
|
public void testPut() { |
178 |
|
LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>(); |
179 |
|
for (int i = 0; i < SIZE; ++i) { |
180 |
< |
assertEquals(q.size(), i); |
180 |
> |
assertEquals(i, q.size()); |
181 |
|
q.put(i); |
182 |
|
assertTrue(q.contains(i)); |
183 |
|
} |
646 |
|
assertEquals(0, q.size()); |
647 |
|
assertEquals(SIZE, l.size()); |
648 |
|
for (int i = 0; i < SIZE; ++i) { |
649 |
< |
assertEquals(l.get(i), i); |
649 |
> |
assertEquals(i, l.get(i)); |
650 |
|
} |
651 |
|
q.add(zero); |
652 |
|
q.add(one); |
658 |
|
assertEquals(0, q.size()); |
659 |
|
assertEquals(2, l.size()); |
660 |
|
for (int i = 0; i < 2; ++i) { |
661 |
< |
assertEquals(l.get(i), i); |
661 |
> |
assertEquals(i, l.get(i)); |
662 |
|
} |
663 |
|
} |
664 |
|
|
674 |
|
ArrayList l = new ArrayList(); |
675 |
|
q.drainTo(l); |
676 |
|
assertTrue(l.size() >= SIZE); |
677 |
< |
for (int i = 0; i < SIZE; ++i) { |
678 |
< |
assertEquals(l.get(i), i); |
679 |
< |
} |
677 |
> |
for (int i = 0; i < SIZE; ++i) |
678 |
> |
assertEquals(i, l.get(i)); |
679 |
|
awaitTermination(t, MEDIUM_DELAY_MS); |
680 |
|
assertTrue(q.size() + l.size() >= SIZE); |
681 |
|
} |
692 |
|
ArrayList l = new ArrayList(); |
693 |
|
q.drainTo(l, i); |
694 |
|
int k = (i < SIZE) ? i : SIZE; |
695 |
< |
assertEquals(l.size(), k); |
696 |
< |
assertEquals(q.size(), SIZE - k); |
697 |
< |
for (int j = 0; j < k; ++j) { |
698 |
< |
assertEquals(l.get(j), j); |
700 |
< |
} |
695 |
> |
assertEquals(k, l.size()); |
696 |
> |
assertEquals(SIZE - k, q.size()); |
697 |
> |
for (int j = 0; j < k; ++j) |
698 |
> |
assertEquals(j, l.get(j)); |
699 |
|
while (q.poll() != null) |
700 |
|
; |
701 |
|
} |