ViewVC Help

View File | Revision Log | Show Annotations | Download File | Root Listing

root/jsr166/jsr166/src/test/tck/PriorityQueueTest.java

Comparing jsr166/src/test/tck/PriorityQueueTest.java (file contents):
Revision 1.48 by dl, Tue Jan 26 13:33:06 2021 UTC vs.
Revision 1.49 by jsr166, Wed Jan 27 01:57:24 2021 UTC

#	Line 122 | Line 122 | public class PriorityQueueTest extends J
122		*/
123		public void testConstructor6() {
124		Item[] items = defaultItems;
125	<	PriorityQueue<Item> q = new PriorityQueue<Item>(Arrays.asList(items));
125	>	PriorityQueue<Item> q = new PriorityQueue<>(Arrays.asList(items));
126		for (int i = 0; i < SIZE; ++i)
127		mustEqual(items[i], q.poll());
128		}
#	Line 133 | Line 133 | public class PriorityQueueTest extends J
133		public void testConstructor7() {
134		MyReverseComparator cmp = new MyReverseComparator();
135		@SuppressWarnings("unchecked")
136	<	PriorityQueue<Item> q = new PriorityQueue<Item>(SIZE, cmp);
136	>	PriorityQueue<Item> q = new PriorityQueue<>(SIZE, cmp);
137		assertEquals(cmp, q.comparator());
138		Item[] items = seqItems(SIZE);
139		q.addAll(Arrays.asList(items));
#	Line 145 | Line 145 | public class PriorityQueueTest extends J
145		* isEmpty is true before add, false after
146		*/
147		public void testEmpty() {
148	<	PriorityQueue<Item> q = new PriorityQueue<Item>(2);
148	>	PriorityQueue<Item> q = new PriorityQueue<>(2);
149		assertTrue(q.isEmpty());
150		q.add(one);
151		assertFalse(q.isEmpty());
#	Line 174 | Line 174 | public class PriorityQueueTest extends J
174		* offer(null) throws NPE
175		*/
176		public void testOfferNull() {
177	<	PriorityQueue<Item> q = new PriorityQueue<Item>(1);
177	>	PriorityQueue<Item> q = new PriorityQueue<>(1);
178		try {
179		q.offer(null);
180		shouldThrow();
#	Line 185 | Line 185 | public class PriorityQueueTest extends J
185		* add(null) throws NPE
186		*/
187		public void testAddNull() {
188	<	PriorityQueue<Item> q = new PriorityQueue<Item>(1);
188	>	PriorityQueue<Item> q = new PriorityQueue<>(1);
189		try {
190		q.add(null);
191		shouldThrow();
#	Line 196 | Line 196 | public class PriorityQueueTest extends J
196		* Offer of comparable element succeeds
197		*/
198		public void testOffer() {
199	<	PriorityQueue<Item> q = new PriorityQueue<Item>(1);
199	>	PriorityQueue<Item> q = new PriorityQueue<>(1);
200		assertTrue(q.offer(zero));
201		assertTrue(q.offer(one));
202		}
#	Line 205 | Line 205 | public class PriorityQueueTest extends J
205		* Offer of non-Comparable throws CCE
206		*/
207		public void testOfferNonComparable() {
208	<	PriorityQueue<Object> q = new PriorityQueue<Object>(1);
208	>	PriorityQueue<Object> q = new PriorityQueue<>(1);
209		try {
210		q.offer(new Object());
211		shouldThrow();
#	Line 220 | Line 220 | public class PriorityQueueTest extends J
220		* add of comparable succeeds
221		*/
222		public void testAdd() {
223	<	PriorityQueue<Item> q = new PriorityQueue<Item>(SIZE);
223	>	PriorityQueue<Item> q = new PriorityQueue<>(SIZE);
224		for (int i = 0; i < SIZE; ++i) {
225		mustEqual(i, q.size());
226		mustAdd(q, i);
#	Line 231 | Line 231 | public class PriorityQueueTest extends J
231		* addAll(null) throws NPE
232		*/
233		public void testAddAll1() {
234	<	PriorityQueue<Item> q = new PriorityQueue<Item>(1);
234	>	PriorityQueue<Item> q = new PriorityQueue<>(1);
235		try {
236		q.addAll(null);
237		shouldThrow();
#	Line 242 | Line 242 | public class PriorityQueueTest extends J
242		* addAll of a collection with null elements throws NPE
243		*/
244		public void testAddAll2() {
245	<	PriorityQueue<Item> q = new PriorityQueue<Item>(SIZE);
245	>	PriorityQueue<Item> q = new PriorityQueue<>(SIZE);
246		try {
247		q.addAll(Arrays.asList(new Item[SIZE]));
248		shouldThrow();
#	Line 254 | Line 254 | public class PriorityQueueTest extends J
254		* possibly adding some elements
255		*/
256		public void testAddAll3() {
257	<	PriorityQueue<Item> q = new PriorityQueue<Item>(SIZE);
257	>	PriorityQueue<Item> q = new PriorityQueue<>(SIZE);
258		Item[] items = new Item[2];
259		items[0] = zero;
260		try {
#	Line 271 | Line 271 | public class PriorityQueueTest extends J
271		Item[] items = new Item[SIZE];
272		for (int i = 0; i < SIZE; ++i)
273		items[i] = itemFor(SIZE - 1 - i);
274	<	PriorityQueue<Item> q = new PriorityQueue<Item>(SIZE);
274	>	PriorityQueue<Item> q = new PriorityQueue<>(SIZE);
275		assertFalse(q.addAll(Arrays.asList(empty)));
276		assertTrue(q.addAll(Arrays.asList(items)));
277		for (int i = 0; i < SIZE; ++i)
#	Line 384 | Line 384 | public class PriorityQueueTest extends J
384		*/
385		public void testContainsAll() {
386		PriorityQueue<Item> q = populatedQueue(SIZE);
387	<	PriorityQueue<Item> p = new PriorityQueue<Item>(SIZE);
387	>	PriorityQueue<Item> p = new PriorityQueue<>(SIZE);
388		for (int i = 0; i < SIZE; ++i) {
389		assertTrue(q.containsAll(p));
390		assertFalse(p.containsAll(q));
#	Line 478 | Line 478 | public class PriorityQueueTest extends J
478		* iterator.remove removes current element
479		*/
480		public void testIteratorRemove() {
481	<	final PriorityQueue<Item> q = new PriorityQueue<Item>(3);
481	>	final PriorityQueue<Item> q = new PriorityQueue<>(3);
482		q.add(two);
483		q.add(one);
484		q.add(three);

Diff Legend

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