ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/jsr166/jsr166/src/test/tck/LinkedTransferQueueTest.java
(Generate patch)

Comparing jsr166/src/test/tck/LinkedTransferQueueTest.java (file contents):
Revision 1.46 by jsr166, Fri May 27 20:07:24 2011 UTC vs.
Revision 1.58 by jsr166, Sat Feb 28 19:59:23 2015 UTC

# Line 5 | Line 5
5   * Other contributors include John Vint
6   */
7  
8 < import java.io.BufferedInputStream;
9 < import java.io.BufferedOutputStream;
10 < import java.io.ByteArrayInputStream;
11 < import java.io.ByteArrayOutputStream;
12 < import java.io.ObjectInputStream;
13 < import java.io.ObjectOutputStream;
8 > import static java.util.concurrent.TimeUnit.MILLISECONDS;
9 >
10   import java.util.ArrayList;
11   import java.util.Arrays;
12 + import java.util.Collection;
13   import java.util.Iterator;
14   import java.util.List;
15   import java.util.NoSuchElementException;
16 < import java.util.concurrent.*;
17 < import static java.util.concurrent.TimeUnit.MILLISECONDS;
18 < import static java.util.concurrent.TimeUnit.NANOSECONDS;
16 > import java.util.Queue;
17 > import java.util.concurrent.BlockingQueue;
18 > import java.util.concurrent.CountDownLatch;
19 > import java.util.concurrent.Executors;
20 > import java.util.concurrent.ExecutorService;
21 > import java.util.concurrent.LinkedTransferQueue;
22 >
23   import junit.framework.Test;
23 – import junit.framework.TestSuite;
24  
25   @SuppressWarnings({"unchecked", "rawtypes"})
26   public class LinkedTransferQueueTest extends JSR166TestCase {
# Line 65 | Line 65 | public class LinkedTransferQueueTest ext
65       * NullPointerException
66       */
67      public void testConstructor3() {
68 +        Collection<Integer> elements = Arrays.asList(new Integer[SIZE]);
69          try {
70 <            Integer[] ints = new Integer[SIZE];
70 <            new LinkedTransferQueue(Arrays.asList(ints));
70 >            new LinkedTransferQueue(elements);
71              shouldThrow();
72          } catch (NullPointerException success) {}
73      }
# Line 77 | Line 77 | public class LinkedTransferQueueTest ext
77       * throws NullPointerException
78       */
79      public void testConstructor4() {
80 +        Integer[] ints = new Integer[SIZE];
81 +        for (int i = 0; i < SIZE-1; ++i)
82 +            ints[i] = i;
83 +        Collection<Integer> elements = Arrays.asList(ints);
84          try {
85 <            Integer[] ints = new Integer[SIZE];
82 <            for (int i = 0; i < SIZE - 1; ++i) {
83 <                ints[i] = i;
84 <            }
85 <            new LinkedTransferQueue(Arrays.asList(ints));
85 >            new LinkedTransferQueue(elements);
86              shouldThrow();
87          } catch (NullPointerException success) {}
88      }
# Line 115 | Line 115 | public class LinkedTransferQueueTest ext
115       * remainingCapacity() always returns Integer.MAX_VALUE
116       */
117      public void testRemainingCapacity() {
118 <        LinkedTransferQueue<Integer> q = populatedQueue(SIZE);
118 >        BlockingQueue q = populatedQueue(SIZE);
119          for (int i = 0; i < SIZE; ++i) {
120              assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
121              assertEquals(SIZE - i, q.size());
122 <            q.remove();
122 >            assertEquals(i, q.remove());
123          }
124          for (int i = 0; i < SIZE; ++i) {
125              assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
126              assertEquals(i, q.size());
127 <            q.add(i);
127 >            assertTrue(q.add(i));
128          }
129      }
130  
131      /**
132 –     * offer(null) throws NullPointerException
133 –     */
134 –    public void testOfferNull() {
135 –        try {
136 –            LinkedTransferQueue q = new LinkedTransferQueue();
137 –            q.offer(null);
138 –            shouldThrow();
139 –        } catch (NullPointerException success) {}
140 –    }
141 –
142 –    /**
143 –     * add(null) throws NullPointerException
144 –     */
145 –    public void testAddNull() {
146 –        try {
147 –            LinkedTransferQueue q = new LinkedTransferQueue();
148 –            q.add(null);
149 –            shouldThrow();
150 –        } catch (NullPointerException success) {}
151 –    }
152 –
153 –    /**
154 –     * addAll(null) throws NullPointerException
155 –     */
156 –    public void testAddAll1() {
157 –        try {
158 –            LinkedTransferQueue q = new LinkedTransferQueue();
159 –            q.addAll(null);
160 –            shouldThrow();
161 –        } catch (NullPointerException success) {}
162 –    }
163 –
164 –    /**
132       * addAll(this) throws IllegalArgumentException
133       */
134      public void testAddAllSelf() {
# Line 173 | Line 140 | public class LinkedTransferQueueTest ext
140      }
141  
142      /**
176 –     * addAll of a collection with null elements throws NullPointerException
177 –     */
178 –    public void testAddAll2() {
179 –        try {
180 –            LinkedTransferQueue q = new LinkedTransferQueue();
181 –            Integer[] ints = new Integer[SIZE];
182 –            q.addAll(Arrays.asList(ints));
183 –            shouldThrow();
184 –        } catch (NullPointerException success) {}
185 –    }
186 –
187 –    /**
143       * addAll of a collection with any null elements throws
144       * NullPointerException after possibly adding some elements
145       */
# Line 218 | Line 173 | public class LinkedTransferQueueTest ext
173      }
174  
175      /**
221 –     * put(null) throws NullPointerException
222 –     */
223 –    public void testPutNull() throws InterruptedException {
224 –        try {
225 –            LinkedTransferQueue q = new LinkedTransferQueue();
226 –            q.put(null);
227 –            shouldThrow();
228 –        } catch (NullPointerException success) {}
229 –    }
230 –
231 –    /**
176       * all elements successfully put are contained
177       */
178      public void testPut() {
179          LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>();
180          for (int i = 0; i < SIZE; ++i) {
181 <            assertEquals(q.size(), i);
181 >            assertEquals(i, q.size());
182              q.put(i);
183              assertTrue(q.contains(i));
184          }
# Line 425 | Line 369 | public class LinkedTransferQueueTest ext
369      }
370  
371      /**
428 –     * remove(x) removes x and returns true if present
429 –     */
430 –    public void testRemoveElement() throws InterruptedException {
431 –        LinkedTransferQueue q = populatedQueue(SIZE);
432 –        for (int i = 1; i < SIZE; i+=2) {
433 –            assertTrue(q.contains(i));
434 –            assertTrue(q.remove(i));
435 –            assertFalse(q.contains(i));
436 –            assertTrue(q.contains(i-1));
437 –        }
438 –        for (int i = 0; i < SIZE; i+=2) {
439 –            assertTrue(q.contains(i));
440 –            assertTrue(q.remove(i));
441 –            assertFalse(q.contains(i));
442 –            assertFalse(q.remove(i+1));
443 –            assertFalse(q.contains(i+1));
444 –        }
445 –        checkEmpty(q);
446 –    }
447 –
448 –    /**
372       * An add following remove(x) succeeds
373       */
374      public void testRemoveElementAndAdd() throws InterruptedException {
# Line 561 | Line 484 | public class LinkedTransferQueueTest ext
484      }
485  
486      /**
564 –     * toArray(null) throws NullPointerException
565 –     */
566 –    public void testToArray_NullArg() {
567 –        LinkedTransferQueue q = populatedQueue(SIZE);
568 –        try {
569 –            q.toArray(null);
570 –            shouldThrow();
571 –        } catch (NullPointerException success) {}
572 –    }
573 –
574 –    /**
487       * toArray(incompatible array type) throws ArrayStoreException
488       */
489      public void testToArray1_BadArg() {
# Line 588 | Line 500 | public class LinkedTransferQueueTest ext
500      public void testIterator() throws InterruptedException {
501          LinkedTransferQueue q = populatedQueue(SIZE);
502          Iterator it = q.iterator();
503 <        int i = 0;
504 <        while (it.hasNext()) {
505 <            assertEquals(it.next(), i++);
594 <        }
503 >        int i;
504 >        for (i = 0; it.hasNext(); i++)
505 >            assertTrue(q.contains(it.next()));
506          assertEquals(i, SIZE);
507 +        assertIteratorExhausted(it);
508 +
509 +        it = q.iterator();
510 +        for (i = 0; it.hasNext(); i++)
511 +            assertEquals(it.next(), q.take());
512 +        assertEquals(i, SIZE);
513 +        assertIteratorExhausted(it);
514 +    }
515 +
516 +    /**
517 +     * iterator of empty collection has no elements
518 +     */
519 +    public void testEmptyIterator() {
520 +        assertIteratorExhausted(new LinkedTransferQueue().iterator());
521      }
522  
523      /**
# Line 711 | Line 636 | public class LinkedTransferQueueTest ext
636       * A deserialized serialized queue has same elements in same order
637       */
638      public void testSerialization() throws Exception {
639 <        LinkedTransferQueue q = populatedQueue(SIZE);
639 >        Queue x = populatedQueue(SIZE);
640 >        Queue y = serialClone(x);
641  
642 <        ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
643 <        ObjectOutputStream out
644 <            = new ObjectOutputStream(new BufferedOutputStream(bout));
645 <        out.writeObject(q);
646 <        out.close();
647 <
648 <        ByteArrayInputStream bin
723 <            = new ByteArrayInputStream(bout.toByteArray());
724 <        ObjectInputStream in
725 <            = new ObjectInputStream(new BufferedInputStream(bin));
726 <        LinkedTransferQueue r = (LinkedTransferQueue) in.readObject();
727 <
728 <        assertEquals(q.size(), r.size());
729 <        assertEquals(q.toString(), r.toString());
730 <        assertTrue(Arrays.equals(q.toArray(), r.toArray()));
731 <        while (!q.isEmpty()) {
732 <            assertEquals(q.remove(), r.remove());
642 >        assertNotSame(y, x);
643 >        assertEquals(x.size(), y.size());
644 >        assertEquals(x.toString(), y.toString());
645 >        assertTrue(Arrays.equals(x.toArray(), y.toArray()));
646 >        while (!x.isEmpty()) {
647 >            assertFalse(y.isEmpty());
648 >            assertEquals(x.remove(), y.remove());
649          }
650 <    }
735 <
736 <    /**
737 <     * drainTo(null) throws NullPointerException
738 <     */
739 <    public void testDrainToNull() {
740 <        LinkedTransferQueue q = populatedQueue(SIZE);
741 <        try {
742 <            q.drainTo(null);
743 <            shouldThrow();
744 <        } catch (NullPointerException success) {}
745 <    }
746 <
747 <    /**
748 <     * drainTo(this) throws IllegalArgumentException
749 <     */
750 <    public void testDrainToSelf() {
751 <        LinkedTransferQueue q = populatedQueue(SIZE);
752 <        try {
753 <            q.drainTo(q);
754 <            shouldThrow();
755 <        } catch (IllegalArgumentException success) {}
650 >        assertTrue(y.isEmpty());
651      }
652  
653      /**
# Line 762 | Line 657 | public class LinkedTransferQueueTest ext
657          LinkedTransferQueue q = populatedQueue(SIZE);
658          ArrayList l = new ArrayList();
659          q.drainTo(l);
660 <        assertEquals(q.size(), 0);
661 <        assertEquals(l.size(), SIZE);
660 >        assertEquals(0, q.size());
661 >        assertEquals(SIZE, l.size());
662          for (int i = 0; i < SIZE; ++i) {
663 <            assertEquals(l.get(i), i);
663 >            assertEquals(i, l.get(i));
664          }
665          q.add(zero);
666          q.add(one);
# Line 774 | Line 669 | public class LinkedTransferQueueTest ext
669          assertTrue(q.contains(one));
670          l.clear();
671          q.drainTo(l);
672 <        assertEquals(q.size(), 0);
673 <        assertEquals(l.size(), 2);
672 >        assertEquals(0, q.size());
673 >        assertEquals(2, l.size());
674          for (int i = 0; i < 2; ++i) {
675 <            assertEquals(l.get(i), i);
675 >            assertEquals(i, l.get(i));
676          }
677      }
678  
# Line 793 | Line 688 | public class LinkedTransferQueueTest ext
688          ArrayList l = new ArrayList();
689          q.drainTo(l);
690          assertTrue(l.size() >= SIZE);
691 <        for (int i = 0; i < SIZE; ++i) {
692 <            assertEquals(l.get(i), i);
798 <        }
691 >        for (int i = 0; i < SIZE; ++i)
692 >            assertEquals(i, l.get(i));
693          awaitTermination(t, MEDIUM_DELAY_MS);
694          assertTrue(q.size() + l.size() >= SIZE);
695      }
696  
697      /**
804 –     * drainTo(null, n) throws NullPointerException
805 –     */
806 –    public void testDrainToNullN() {
807 –        LinkedTransferQueue q = populatedQueue(SIZE);
808 –        try {
809 –            q.drainTo(null, SIZE);
810 –            shouldThrow();
811 –        } catch (NullPointerException success) {}
812 –    }
813 –
814 –    /**
815 –     * drainTo(this, n) throws IllegalArgumentException
816 –     */
817 –    public void testDrainToSelfN() {
818 –        LinkedTransferQueue q = populatedQueue(SIZE);
819 –        try {
820 –            q.drainTo(q, SIZE);
821 –            shouldThrow();
822 –        } catch (IllegalArgumentException success) {}
823 –    }
824 –
825 –    /**
698       * drainTo(c, n) empties first min(n, size) elements of queue into c
699       */
700      public void testDrainToN() {
# Line 834 | Line 706 | public class LinkedTransferQueueTest ext
706              ArrayList l = new ArrayList();
707              q.drainTo(l, i);
708              int k = (i < SIZE) ? i : SIZE;
709 <            assertEquals(l.size(), k);
710 <            assertEquals(q.size(), SIZE - k);
711 <            for (int j = 0; j < k; ++j) {
712 <                assertEquals(l.get(j), j);
713 <            }
842 <            while (q.poll() != null)
843 <                ;
709 >            assertEquals(k, l.size());
710 >            assertEquals(SIZE - k, q.size());
711 >            for (int j = 0; j < k; ++j)
712 >                assertEquals(j, l.get(j));
713 >            do {} while (q.poll() != null);
714          }
715      }
716  
# Line 850 | Line 720 | public class LinkedTransferQueueTest ext
720       */
721      public void testWaitingConsumer() throws InterruptedException {
722          final LinkedTransferQueue q = new LinkedTransferQueue();
723 <        assertEquals(q.getWaitingConsumerCount(), 0);
723 >        assertEquals(0, q.getWaitingConsumerCount());
724          assertFalse(q.hasWaitingConsumer());
725          final CountDownLatch threadStarted = new CountDownLatch(1);
726  
# Line 858 | Line 728 | public class LinkedTransferQueueTest ext
728              public void realRun() throws InterruptedException {
729                  threadStarted.countDown();
730                  assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
731 <                assertEquals(q.getWaitingConsumerCount(), 0);
731 >                assertEquals(0, q.getWaitingConsumerCount());
732                  assertFalse(q.hasWaitingConsumer());
733              }});
734  
735          threadStarted.await();
736          waitForThreadToEnterWaitState(t, SMALL_DELAY_MS);
737 <        assertEquals(q.getWaitingConsumerCount(), 1);
737 >        assertEquals(1, q.getWaitingConsumerCount());
738          assertTrue(q.hasWaitingConsumer());
739  
740          assertTrue(q.offer(one));
741 <        assertEquals(q.getWaitingConsumerCount(), 0);
741 >        assertEquals(0, q.getWaitingConsumerCount());
742          assertFalse(q.hasWaitingConsumer());
743  
744          awaitTermination(t, MEDIUM_DELAY_MS);
# Line 1156 | Line 1026 | public class LinkedTransferQueueTest ext
1026          assertFalse(q.isEmpty());
1027          return q;
1028      }
1029 +
1030 +    /**
1031 +     * remove(null), contains(null) always return false
1032 +     */
1033 +    public void testNeverContainsNull() {
1034 +        Collection<?>[] qs = {
1035 +            new LinkedTransferQueue<Object>(),
1036 +            populatedQueue(2),
1037 +        };
1038 +
1039 +        for (Collection<?> q : qs) {
1040 +            assertFalse(q.contains(null));
1041 +            assertFalse(q.remove(null));
1042 +        }
1043 +    }
1044   }

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines