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

Comparing jsr166/src/test/tck/PriorityBlockingQueueTest.java (file contents):
Revision 1.10 by dl, Wed Jan 7 01:13:50 2004 UTC vs.
Revision 1.11 by dl, Sun Oct 31 14:55:14 2004 UTC

# Line 626 | Line 626 | public class PriorityBlockingQueueTest e
626          q.clear();
627          assertTrue(q.isEmpty());
628          assertEquals(0, q.size());
629 <        assertEquals(NOCAP, q.remainingCapacity());
630 <        q.add(new Integer(1));
629 >        q.add(one);
630          assertFalse(q.isEmpty());
631 +        assertTrue(q.contains(one));
632          q.clear();
633          assertTrue(q.isEmpty());
634      }
# Line 871 | Line 871 | public class PriorityBlockingQueueTest e
871          assertEquals(l.size(), SIZE);
872          for (int i = 0; i < SIZE; ++i)
873              assertEquals(l.get(i), new Integer(i));
874 +        q.add(zero);
875 +        q.add(one);
876 +        assertFalse(q.isEmpty());
877 +        assertTrue(q.contains(zero));
878 +        assertTrue(q.contains(one));
879 +        l.clear();
880 +        q.drainTo(l);
881 +        assertEquals(q.size(), 0);
882 +        assertEquals(l.size(), 2);
883 +        for (int i = 0; i < 2; ++i)
884 +            assertEquals(l.get(i), new Integer(i));
885      }
886  
887      /**
# Line 925 | Line 936 | public class PriorityBlockingQueueTest e
936       * drainTo(c, n) empties first max {n, size} elements of queue into c
937       */
938      public void testDrainToN() {
939 +        PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE*2);
940          for (int i = 0; i < SIZE + 2; ++i) {
941 <            PriorityBlockingQueue q = populatedQueue(SIZE);
941 >            for(int j = 0; j < SIZE; j++)
942 >                assertTrue(q.offer(new Integer(j)));
943              ArrayList l = new ArrayList();
944              q.drainTo(l, i);
945              int k = (i < SIZE)? i : SIZE;
933            assertEquals(q.size(), SIZE-k);
946              assertEquals(l.size(), k);
947 +            assertEquals(q.size(), SIZE-k);
948              for (int j = 0; j < k; ++j)
949 <                assertTrue(l.contains(new Integer(j)));
949 >                assertEquals(l.get(j), new Integer(j));
950 >            while (q.poll() != null) ;
951          }
952      }
953  

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines