1 |
/* |
/* |
2 |
* Written by members of JCP JSR-166 Expert Group and released to the |
* Written by Doug Lea with assistance from members of JCP JSR-166 |
3 |
* public domain. Use, modify, and redistribute this code in any way |
* Expert Group and released to the public domain, as explained at |
4 |
* without acknowledgement. Other contributors include Andrew Wright, |
* http://creativecommons.org/publicdomain/zero/1.0/ |
5 |
* Jeffrey Hayes, Pat Fischer, Mike Judd. |
* Other contributors include Andrew Wright, Jeffrey Hayes, |
6 |
|
* Pat Fisher, Mike Judd. |
7 |
*/ |
*/ |
8 |
|
|
9 |
import junit.framework.*; |
import java.util.Arrays; |
10 |
import java.util.*; |
import java.util.Collection; |
11 |
import java.util.concurrent.*; |
import java.util.Iterator; |
12 |
|
import java.util.LinkedList; |
13 |
|
import java.util.List; |
14 |
|
import java.util.NoSuchElementException; |
15 |
|
import java.util.concurrent.ThreadLocalRandom; |
16 |
|
|
17 |
|
import junit.framework.Test; |
18 |
|
|
19 |
public class LinkedListTest extends JSR166TestCase { |
public class LinkedListTest extends JSR166TestCase { |
20 |
public static void main(String[] args) { |
public static void main(String[] args) { |
21 |
junit.textui.TestRunner.run (suite()); |
main(suite(), args); |
22 |
} |
} |
23 |
|
|
24 |
public static Test suite() { |
public static Test suite() { |
25 |
return new TestSuite(LinkedListTest.class); |
class Implementation implements CollectionImplementation { |
26 |
|
public Class<?> klazz() { return LinkedList.class; } |
27 |
|
public List emptyCollection() { return new LinkedList(); } |
28 |
|
public Object makeElement(int i) { return i; } |
29 |
|
public boolean isConcurrent() { return false; } |
30 |
|
public boolean permitsNulls() { return true; } |
31 |
|
} |
32 |
|
class SubListImplementation extends Implementation { |
33 |
|
public List emptyCollection() { |
34 |
|
List list = super.emptyCollection(); |
35 |
|
ThreadLocalRandom rnd = ThreadLocalRandom.current(); |
36 |
|
if (rnd.nextBoolean()) |
37 |
|
list.add(makeElement(rnd.nextInt())); |
38 |
|
int i = rnd.nextInt(list.size() + 1); |
39 |
|
return list.subList(i, i); |
40 |
|
} |
41 |
|
} |
42 |
|
return newTestSuite( |
43 |
|
LinkedListTest.class, |
44 |
|
CollectionTest.testSuite(new Implementation()), |
45 |
|
CollectionTest.testSuite(new SubListImplementation())); |
46 |
} |
} |
47 |
|
|
48 |
/** |
/** |
49 |
* Create a queue of given size containing consecutive |
* Returns a new queue of given size containing consecutive |
50 |
* Integers 0 ... n. |
* Integers 0 ... n - 1. |
51 |
*/ |
*/ |
52 |
private LinkedList populatedQueue(int n) { |
private static LinkedList<Integer> populatedQueue(int n) { |
53 |
LinkedList q = new LinkedList(); |
LinkedList<Integer> q = new LinkedList<>(); |
54 |
assertTrue(q.isEmpty()); |
assertTrue(q.isEmpty()); |
55 |
for(int i = 0; i < n; ++i) |
for(int i = 0; i < n; ++i) |
56 |
assertTrue(q.offer(new Integer(i))); |
assertTrue(q.offer(new Integer(i))); |
57 |
assertFalse(q.isEmpty()); |
assertFalse(q.isEmpty()); |
58 |
assertEquals(n, q.size()); |
assertEquals(n, q.size()); |
59 |
|
assertEquals((Integer) 0, q.peekFirst()); |
60 |
|
assertEquals((Integer) (n - 1), q.peekLast()); |
61 |
return q; |
return q; |
62 |
} |
} |
63 |
|
|
64 |
|
/** |
65 |
|
* new queue is empty |
66 |
|
*/ |
67 |
public void testConstructor1(){ |
public void testConstructor1(){ |
68 |
assertEquals(0, new LinkedList().size()); |
assertEquals(0, new LinkedList().size()); |
69 |
} |
} |
70 |
|
|
71 |
|
/** |
72 |
|
* Initializing from null Collection throws NPE |
73 |
|
*/ |
74 |
public void testConstructor3() { |
public void testConstructor3() { |
75 |
try { |
try { |
76 |
LinkedList q = new LinkedList((Collection)null); |
new LinkedList((Collection)null); |
77 |
fail("Cannot make from null collection"); |
shouldThrow(); |
78 |
} |
} catch (NullPointerException success) {} |
|
catch (NullPointerException success) {} |
|
79 |
} |
} |
80 |
|
|
81 |
|
/** |
82 |
|
* Queue contains all elements of collection used to initialize |
83 |
|
*/ |
84 |
public void testConstructor6(){ |
public void testConstructor6(){ |
|
try { |
|
85 |
Integer[] ints = new Integer[SIZE]; |
Integer[] ints = new Integer[SIZE]; |
86 |
for (int i = 0; i < SIZE; ++i) |
for (int i = 0; i < SIZE; ++i) |
87 |
ints[i] = new Integer(i); |
ints[i] = i; |
88 |
LinkedList q = new LinkedList(Arrays.asList(ints)); |
LinkedList q = new LinkedList(Arrays.asList(ints)); |
89 |
for (int i = 0; i < SIZE; ++i) |
for (int i = 0; i < SIZE; ++i) |
90 |
assertEquals(ints[i], q.poll()); |
assertEquals(ints[i], q.poll()); |
91 |
} |
} |
|
finally {} |
|
|
} |
|
92 |
|
|
93 |
|
/** |
94 |
|
* isEmpty is true before add, false after |
95 |
|
*/ |
96 |
public void testEmpty() { |
public void testEmpty() { |
97 |
LinkedList q = new LinkedList(); |
LinkedList q = new LinkedList(); |
98 |
assertTrue(q.isEmpty()); |
assertTrue(q.isEmpty()); |
104 |
assertTrue(q.isEmpty()); |
assertTrue(q.isEmpty()); |
105 |
} |
} |
106 |
|
|
107 |
|
/** |
108 |
|
* size changes when elements added and removed |
109 |
|
*/ |
110 |
public void testSize() { |
public void testSize() { |
111 |
LinkedList q = populatedQueue(SIZE); |
LinkedList q = populatedQueue(SIZE); |
112 |
for (int i = 0; i < SIZE; ++i) { |
for (int i = 0; i < SIZE; ++i) { |
119 |
} |
} |
120 |
} |
} |
121 |
|
|
122 |
|
/** |
123 |
|
* offer(null) succeeds |
124 |
|
*/ |
125 |
public void testOfferNull(){ |
public void testOfferNull(){ |
|
try { |
|
126 |
LinkedList q = new LinkedList(); |
LinkedList q = new LinkedList(); |
127 |
q.offer(null); |
q.offer(null); |
128 |
} catch (NullPointerException ie) { |
assertNull(q.get(0)); |
129 |
fail("should not throw NPE"); |
assertTrue(q.contains(null)); |
|
} |
|
130 |
} |
} |
131 |
|
|
132 |
|
/** |
133 |
|
* Offer succeeds |
134 |
|
*/ |
135 |
public void testOffer() { |
public void testOffer() { |
136 |
LinkedList q = new LinkedList(); |
LinkedList q = new LinkedList(); |
137 |
assertTrue(q.offer(new Integer(0))); |
assertTrue(q.offer(new Integer(0))); |
138 |
assertTrue(q.offer(new Integer(1))); |
assertTrue(q.offer(new Integer(1))); |
139 |
} |
} |
140 |
|
|
141 |
|
/** |
142 |
|
* add succeeds |
143 |
|
*/ |
144 |
public void testAdd(){ |
public void testAdd(){ |
145 |
LinkedList q = new LinkedList(); |
LinkedList q = new LinkedList(); |
146 |
for (int i = 0; i < SIZE; ++i) { |
for (int i = 0; i < SIZE; ++i) { |
149 |
} |
} |
150 |
} |
} |
151 |
|
|
152 |
|
/** |
153 |
|
* addAll(null) throws NPE |
154 |
|
*/ |
155 |
public void testAddAll1(){ |
public void testAddAll1(){ |
|
try { |
|
156 |
LinkedList q = new LinkedList(); |
LinkedList q = new LinkedList(); |
157 |
|
try { |
158 |
q.addAll(null); |
q.addAll(null); |
159 |
fail("Cannot add null collection"); |
shouldThrow(); |
160 |
} |
} catch (NullPointerException success) {} |
|
catch (NullPointerException success) {} |
|
161 |
} |
} |
162 |
|
|
163 |
|
/** |
164 |
|
* Queue contains all elements, in traversal order, of successful addAll |
165 |
|
*/ |
166 |
public void testAddAll5(){ |
public void testAddAll5(){ |
|
try { |
|
167 |
Integer[] empty = new Integer[0]; |
Integer[] empty = new Integer[0]; |
168 |
Integer[] ints = new Integer[SIZE]; |
Integer[] ints = new Integer[SIZE]; |
169 |
for (int i = 0; i < SIZE; ++i) |
for (int i = 0; i < SIZE; ++i) |
170 |
ints[i] = new Integer(i); |
ints[i] = i; |
171 |
LinkedList q = new LinkedList(); |
LinkedList q = new LinkedList(); |
172 |
assertFalse(q.addAll(Arrays.asList(empty))); |
assertFalse(q.addAll(Arrays.asList(empty))); |
173 |
assertTrue(q.addAll(Arrays.asList(ints))); |
assertTrue(q.addAll(Arrays.asList(ints))); |
174 |
for (int i = 0; i < SIZE; ++i) |
for (int i = 0; i < SIZE; ++i) |
175 |
assertEquals(ints[i], q.poll()); |
assertEquals(ints[i], q.poll()); |
176 |
} |
} |
177 |
finally {} |
|
178 |
|
/** |
179 |
|
* addAll with too large an index throws IOOBE |
180 |
|
*/ |
181 |
|
public void testAddAll2_IndexOutOfBoundsException() { |
182 |
|
LinkedList l = new LinkedList(); |
183 |
|
l.add(new Object()); |
184 |
|
LinkedList m = new LinkedList(); |
185 |
|
m.add(new Object()); |
186 |
|
try { |
187 |
|
l.addAll(4,m); |
188 |
|
shouldThrow(); |
189 |
|
} catch (IndexOutOfBoundsException success) {} |
190 |
|
} |
191 |
|
|
192 |
|
/** |
193 |
|
* addAll with negative index throws IOOBE |
194 |
|
*/ |
195 |
|
public void testAddAll4_BadIndex() { |
196 |
|
LinkedList l = new LinkedList(); |
197 |
|
l.add(new Object()); |
198 |
|
LinkedList m = new LinkedList(); |
199 |
|
m.add(new Object()); |
200 |
|
try { |
201 |
|
l.addAll(-1,m); |
202 |
|
shouldThrow(); |
203 |
|
} catch (IndexOutOfBoundsException success) {} |
204 |
} |
} |
205 |
|
|
206 |
|
/** |
207 |
|
* poll succeeds unless empty |
208 |
|
*/ |
209 |
public void testPoll(){ |
public void testPoll(){ |
210 |
LinkedList q = populatedQueue(SIZE); |
LinkedList q = populatedQueue(SIZE); |
211 |
for (int i = 0; i < SIZE; ++i) { |
for (int i = 0; i < SIZE; ++i) { |
212 |
assertEquals(i, ((Integer)q.poll()).intValue()); |
assertEquals(i, q.poll()); |
213 |
} |
} |
214 |
assertNull(q.poll()); |
assertNull(q.poll()); |
215 |
} |
} |
216 |
|
|
217 |
|
/** |
218 |
|
* peek returns next element, or null if empty |
219 |
|
*/ |
220 |
public void testPeek(){ |
public void testPeek(){ |
221 |
LinkedList q = populatedQueue(SIZE); |
LinkedList q = populatedQueue(SIZE); |
222 |
for (int i = 0; i < SIZE; ++i) { |
for (int i = 0; i < SIZE; ++i) { |
223 |
assertEquals(i, ((Integer)q.peek()).intValue()); |
assertEquals(i, q.peek()); |
224 |
q.poll(); |
assertEquals(i, q.poll()); |
225 |
assertTrue(q.peek() == null || |
assertTrue(q.peek() == null || |
226 |
i != ((Integer)q.peek()).intValue()); |
!q.peek().equals(i)); |
227 |
} |
} |
228 |
assertNull(q.peek()); |
assertNull(q.peek()); |
229 |
} |
} |
230 |
|
|
231 |
|
/** |
232 |
|
* element returns next element, or throws NSEE if empty |
233 |
|
*/ |
234 |
public void testElement(){ |
public void testElement(){ |
235 |
LinkedList q = populatedQueue(SIZE); |
LinkedList q = populatedQueue(SIZE); |
236 |
for (int i = 0; i < SIZE; ++i) { |
for (int i = 0; i < SIZE; ++i) { |
237 |
assertEquals(i, ((Integer)q.element()).intValue()); |
assertEquals(i, q.element()); |
238 |
q.poll(); |
assertEquals(i, q.poll()); |
239 |
} |
} |
240 |
try { |
try { |
241 |
q.element(); |
q.element(); |
242 |
fail("no such element"); |
shouldThrow(); |
243 |
} |
} catch (NoSuchElementException success) {} |
|
catch (NoSuchElementException success) {} |
|
244 |
} |
} |
245 |
|
|
246 |
|
/** |
247 |
|
* remove removes next element, or throws NSEE if empty |
248 |
|
*/ |
249 |
public void testRemove(){ |
public void testRemove(){ |
250 |
LinkedList q = populatedQueue(SIZE); |
LinkedList q = populatedQueue(SIZE); |
251 |
for (int i = 0; i < SIZE; ++i) { |
for (int i = 0; i < SIZE; ++i) { |
252 |
assertEquals(i, ((Integer)q.remove()).intValue()); |
assertEquals(i, q.remove()); |
253 |
} |
} |
254 |
try { |
try { |
255 |
q.remove(); |
q.remove(); |
256 |
fail("remove should throw"); |
shouldThrow(); |
257 |
} catch (NoSuchElementException success){ |
} catch (NoSuchElementException success) {} |
|
} |
|
258 |
} |
} |
259 |
|
|
260 |
|
/** |
261 |
|
* remove(x) removes x and returns true if present |
262 |
|
*/ |
263 |
public void testRemoveElement(){ |
public void testRemoveElement(){ |
264 |
LinkedList q = populatedQueue(SIZE); |
LinkedList q = populatedQueue(SIZE); |
265 |
for (int i = 1; i < SIZE; i+=2) { |
for (int i = 1; i < SIZE; i+=2) { |
266 |
assertTrue(q.remove(new Integer(i))); |
assertTrue(q.contains(i)); |
267 |
|
assertTrue(q.remove((Integer)i)); |
268 |
|
assertFalse(q.contains(i)); |
269 |
|
assertTrue(q.contains(i - 1)); |
270 |
} |
} |
271 |
for (int i = 0; i < SIZE; i+=2) { |
for (int i = 0; i < SIZE; i+=2) { |
272 |
assertTrue(q.remove(new Integer(i))); |
assertTrue(q.contains(i)); |
273 |
assertFalse(q.remove(new Integer(i+1))); |
assertTrue(q.remove((Integer)i)); |
274 |
|
assertFalse(q.contains(i)); |
275 |
|
assertFalse(q.remove((Integer)(i + 1))); |
276 |
|
assertFalse(q.contains(i + 1)); |
277 |
} |
} |
278 |
assertTrue(q.isEmpty()); |
assertTrue(q.isEmpty()); |
279 |
} |
} |
280 |
|
|
281 |
|
/** |
282 |
|
* contains(x) reports true when elements added but not yet removed |
283 |
|
*/ |
284 |
public void testContains(){ |
public void testContains(){ |
285 |
LinkedList q = populatedQueue(SIZE); |
LinkedList q = populatedQueue(SIZE); |
286 |
for (int i = 0; i < SIZE; ++i) { |
for (int i = 0; i < SIZE; ++i) { |
290 |
} |
} |
291 |
} |
} |
292 |
|
|
293 |
|
/** |
294 |
|
* clear removes all elements |
295 |
|
*/ |
296 |
public void testClear(){ |
public void testClear(){ |
297 |
LinkedList q = populatedQueue(SIZE); |
LinkedList q = populatedQueue(SIZE); |
298 |
q.clear(); |
q.clear(); |
299 |
assertTrue(q.isEmpty()); |
assertTrue(q.isEmpty()); |
300 |
assertEquals(0, q.size()); |
assertEquals(0, q.size()); |
301 |
q.add(new Integer(1)); |
assertTrue(q.add(new Integer(1))); |
302 |
assertFalse(q.isEmpty()); |
assertFalse(q.isEmpty()); |
303 |
q.clear(); |
q.clear(); |
304 |
assertTrue(q.isEmpty()); |
assertTrue(q.isEmpty()); |
305 |
} |
} |
306 |
|
|
307 |
|
/** |
308 |
|
* containsAll(c) is true when c contains a subset of elements |
309 |
|
*/ |
310 |
public void testContainsAll(){ |
public void testContainsAll(){ |
311 |
LinkedList q = populatedQueue(SIZE); |
LinkedList q = populatedQueue(SIZE); |
312 |
LinkedList p = new LinkedList(); |
LinkedList p = new LinkedList(); |
313 |
for (int i = 0; i < SIZE; ++i) { |
for (int i = 0; i < SIZE; ++i) { |
314 |
assertTrue(q.containsAll(p)); |
assertTrue(q.containsAll(p)); |
315 |
assertFalse(p.containsAll(q)); |
assertFalse(p.containsAll(q)); |
316 |
p.add(new Integer(i)); |
assertTrue(p.add(new Integer(i))); |
317 |
} |
} |
318 |
assertTrue(p.containsAll(q)); |
assertTrue(p.containsAll(q)); |
319 |
} |
} |
320 |
|
|
321 |
|
/** |
322 |
|
* retainAll(c) retains only those elements of c and reports true if changed |
323 |
|
*/ |
324 |
public void testRetainAll(){ |
public void testRetainAll(){ |
325 |
LinkedList q = populatedQueue(SIZE); |
LinkedList q = populatedQueue(SIZE); |
326 |
LinkedList p = populatedQueue(SIZE); |
LinkedList p = populatedQueue(SIZE); |
337 |
} |
} |
338 |
} |
} |
339 |
|
|
340 |
|
/** |
341 |
|
* removeAll(c) removes only those elements of c and reports true if changed |
342 |
|
*/ |
343 |
public void testRemoveAll(){ |
public void testRemoveAll(){ |
344 |
for (int i = 1; i < SIZE; ++i) { |
for (int i = 1; i < SIZE; ++i) { |
345 |
LinkedList q = populatedQueue(SIZE); |
LinkedList q = populatedQueue(SIZE); |
347 |
assertTrue(q.removeAll(p)); |
assertTrue(q.removeAll(p)); |
348 |
assertEquals(SIZE-i, q.size()); |
assertEquals(SIZE-i, q.size()); |
349 |
for (int j = 0; j < i; ++j) { |
for (int j = 0; j < i; ++j) { |
350 |
Integer I = (Integer)(p.remove()); |
Integer x = (Integer)(p.remove()); |
351 |
assertFalse(q.contains(I)); |
assertFalse(q.contains(x)); |
352 |
} |
} |
353 |
} |
} |
354 |
} |
} |
355 |
|
|
356 |
|
/** |
357 |
|
* toArray contains all elements in FIFO order |
358 |
|
*/ |
359 |
public void testToArray(){ |
public void testToArray(){ |
360 |
LinkedList q = populatedQueue(SIZE); |
LinkedList q = populatedQueue(SIZE); |
361 |
Object[] o = q.toArray(); |
Object[] a = q.toArray(); |
362 |
Arrays.sort(o); |
assertSame(Object[].class, a.getClass()); |
363 |
for(int i = 0; i < o.length; i++) |
for (Object o : a) |
364 |
assertEquals(o[i], q.poll()); |
assertSame(o, q.poll()); |
365 |
|
assertTrue(q.isEmpty()); |
366 |
} |
} |
367 |
|
|
368 |
|
/** |
369 |
|
* toArray(a) contains all elements in FIFO order |
370 |
|
*/ |
371 |
public void testToArray2(){ |
public void testToArray2(){ |
372 |
LinkedList q = populatedQueue(SIZE); |
LinkedList<Integer> q = populatedQueue(SIZE); |
373 |
Integer[] ints = new Integer[SIZE]; |
Integer[] ints = new Integer[SIZE]; |
374 |
ints = (Integer[])q.toArray(ints); |
Integer[] array = q.toArray(ints); |
375 |
Arrays.sort(ints); |
assertSame(ints, array); |
376 |
for(int i = 0; i < ints.length; i++) |
for (Integer o : ints) |
377 |
assertEquals(ints[i], q.poll()); |
assertSame(o, q.poll()); |
378 |
|
assertTrue(q.isEmpty()); |
379 |
} |
} |
380 |
|
|
381 |
|
/** |
382 |
|
* toArray(null) throws NullPointerException |
383 |
|
*/ |
384 |
|
public void testToArray_NullArg() { |
385 |
|
LinkedList l = new LinkedList(); |
386 |
|
l.add(new Object()); |
387 |
|
try { |
388 |
|
l.toArray(null); |
389 |
|
shouldThrow(); |
390 |
|
} catch (NullPointerException success) {} |
391 |
|
} |
392 |
|
|
393 |
|
/** |
394 |
|
* toArray(incompatible array type) throws ArrayStoreException |
395 |
|
*/ |
396 |
|
public void testToArray1_BadArg() { |
397 |
|
LinkedList l = new LinkedList(); |
398 |
|
l.add(new Integer(5)); |
399 |
|
try { |
400 |
|
l.toArray(new String[10]); |
401 |
|
shouldThrow(); |
402 |
|
} catch (ArrayStoreException success) {} |
403 |
|
} |
404 |
|
|
405 |
|
/** |
406 |
|
* iterator iterates through all elements |
407 |
|
*/ |
408 |
public void testIterator(){ |
public void testIterator(){ |
409 |
LinkedList q = populatedQueue(SIZE); |
LinkedList q = populatedQueue(SIZE); |
|
int i = 0; |
|
410 |
Iterator it = q.iterator(); |
Iterator it = q.iterator(); |
411 |
while(it.hasNext()) { |
int i; |
412 |
|
for (i = 0; it.hasNext(); i++) |
413 |
assertTrue(q.contains(it.next())); |
assertTrue(q.contains(it.next())); |
|
++i; |
|
|
} |
|
414 |
assertEquals(i, SIZE); |
assertEquals(i, SIZE); |
415 |
|
assertIteratorExhausted(it); |
416 |
} |
} |
417 |
|
|
418 |
public void testIteratorOrdering() { |
/** |
419 |
|
* iterator of empty collection has no elements |
420 |
|
*/ |
421 |
|
public void testEmptyIterator() { |
422 |
|
assertIteratorExhausted(new LinkedList().iterator()); |
423 |
|
} |
424 |
|
|
425 |
|
/** |
426 |
|
* iterator ordering is FIFO |
427 |
|
*/ |
428 |
|
public void testIteratorOrdering() { |
429 |
final LinkedList q = new LinkedList(); |
final LinkedList q = new LinkedList(); |
|
|
|
430 |
q.add(new Integer(1)); |
q.add(new Integer(1)); |
431 |
q.add(new Integer(2)); |
q.add(new Integer(2)); |
432 |
q.add(new Integer(3)); |
q.add(new Integer(3)); |
|
|
|
433 |
int k = 0; |
int k = 0; |
434 |
for (Iterator it = q.iterator(); it.hasNext();) { |
for (Iterator it = q.iterator(); it.hasNext();) { |
435 |
int i = ((Integer)(it.next())).intValue(); |
assertEquals(++k, it.next()); |
|
assertEquals("items should come out in order", ++k, i); |
|
436 |
} |
} |
437 |
|
|
438 |
assertEquals("should go through 3 elements", 3, k); |
assertEquals(3, k); |
439 |
} |
} |
440 |
|
|
441 |
|
/** |
442 |
|
* iterator.remove removes current element |
443 |
|
*/ |
444 |
public void testIteratorRemove () { |
public void testIteratorRemove () { |
445 |
final LinkedList q = new LinkedList(); |
final LinkedList q = new LinkedList(); |
|
|
|
446 |
q.add(new Integer(1)); |
q.add(new Integer(1)); |
447 |
q.add(new Integer(2)); |
q.add(new Integer(2)); |
448 |
q.add(new Integer(3)); |
q.add(new Integer(3)); |
|
|
|
449 |
Iterator it = q.iterator(); |
Iterator it = q.iterator(); |
450 |
it.next(); |
assertEquals(1, it.next()); |
451 |
it.remove(); |
it.remove(); |
|
|
|
452 |
it = q.iterator(); |
it = q.iterator(); |
453 |
assertEquals(it.next(), new Integer(2)); |
assertEquals(2, it.next()); |
454 |
assertEquals(it.next(), new Integer(3)); |
assertEquals(3, it.next()); |
455 |
assertFalse(it.hasNext()); |
assertFalse(it.hasNext()); |
456 |
} |
} |
457 |
|
|
458 |
|
/** |
459 |
public void testToString(){ |
* Descending iterator iterates through all elements |
460 |
|
*/ |
461 |
|
public void testDescendingIterator() { |
462 |
LinkedList q = populatedQueue(SIZE); |
LinkedList q = populatedQueue(SIZE); |
463 |
String s = q.toString(); |
int i = 0; |
464 |
for (int i = 0; i < SIZE; ++i) { |
Iterator it = q.descendingIterator(); |
465 |
assertTrue(s.indexOf(String.valueOf(i)) >= 0); |
while (it.hasNext()) { |
466 |
|
assertTrue(q.contains(it.next())); |
467 |
|
++i; |
468 |
} |
} |
469 |
|
assertEquals(i, SIZE); |
470 |
|
assertFalse(it.hasNext()); |
471 |
|
try { |
472 |
|
it.next(); |
473 |
|
shouldThrow(); |
474 |
|
} catch (NoSuchElementException success) {} |
475 |
} |
} |
476 |
|
|
477 |
public void testAddFirst(){ |
/** |
478 |
LinkedList q = populatedQueue(3); |
* Descending iterator ordering is reverse FIFO |
479 |
q.addFirst(new Integer(4)); |
*/ |
480 |
assertEquals(new Integer(4),q.get(0)); |
public void testDescendingIteratorOrdering() { |
481 |
|
final LinkedList q = new LinkedList(); |
482 |
|
q.add(new Integer(3)); |
483 |
|
q.add(new Integer(2)); |
484 |
|
q.add(new Integer(1)); |
485 |
|
int k = 0; |
486 |
|
for (Iterator it = q.descendingIterator(); it.hasNext();) { |
487 |
|
assertEquals(++k, it.next()); |
488 |
} |
} |
489 |
|
|
490 |
public void testAddLast(){ |
assertEquals(3, k); |
|
LinkedList q = populatedQueue(3); |
|
|
q.addLast(new Integer(3)); |
|
|
assertEquals(new Integer(3),q.get(3)); |
|
491 |
} |
} |
492 |
|
|
493 |
public void testGetFirst() { |
/** |
494 |
LinkedList q = populatedQueue(3); |
* descendingIterator.remove removes current element |
495 |
assertEquals(new Integer(0),q.getFirst()); |
*/ |
496 |
|
public void testDescendingIteratorRemove() { |
497 |
|
final LinkedList q = new LinkedList(); |
498 |
|
q.add(three); |
499 |
|
q.add(two); |
500 |
|
q.add(one); |
501 |
|
Iterator it = q.descendingIterator(); |
502 |
|
it.next(); |
503 |
|
it.remove(); |
504 |
|
it = q.descendingIterator(); |
505 |
|
assertSame(it.next(), two); |
506 |
|
assertSame(it.next(), three); |
507 |
|
assertFalse(it.hasNext()); |
508 |
} |
} |
509 |
|
|
510 |
public void testGetLast() { |
/** |
511 |
LinkedList q = populatedQueue(3); |
* toString contains toStrings of elements |
512 |
assertEquals(new Integer(2),q.getLast()); |
*/ |
513 |
|
public void testToString() { |
514 |
|
LinkedList q = populatedQueue(SIZE); |
515 |
|
String s = q.toString(); |
516 |
|
for (int i = 0; i < SIZE; ++i) { |
517 |
|
assertTrue(s.contains(String.valueOf(i))); |
518 |
} |
} |
|
|
|
|
public void testIndexOf(){ |
|
|
LinkedList q = populatedQueue(3); |
|
|
assertEquals(0,q.indexOf(new Integer(0))); |
|
|
assertEquals(1,q.indexOf(new Integer(1))); |
|
|
assertEquals(2,q.indexOf(new Integer(2))); |
|
|
assertEquals(-1, q.indexOf("not there")); |
|
519 |
} |
} |
520 |
|
|
521 |
public void testLastIndexOf(){ |
/** |
522 |
|
* peek returns element inserted with addFirst |
523 |
|
*/ |
524 |
|
public void testAddFirst() { |
525 |
LinkedList q = populatedQueue(3); |
LinkedList q = populatedQueue(3); |
526 |
q.add(new Integer(2)); |
q.addFirst(four); |
527 |
assertEquals(3,q.lastIndexOf(new Integer(2))); |
assertSame(four, q.peek()); |
|
assertEquals(-1, q.lastIndexOf("not there")); |
|
528 |
} |
} |
529 |
|
|
530 |
public void testSet(){ |
/** |
531 |
|
* peekFirst returns element inserted with push |
532 |
|
*/ |
533 |
|
public void testPush() { |
534 |
LinkedList q = populatedQueue(3); |
LinkedList q = populatedQueue(3); |
535 |
q.set(0,(new Integer(1))); |
q.push(four); |
536 |
assertFalse(q.contains(new Integer(0))); |
assertSame(four, q.peekFirst()); |
|
assertEquals(new Integer(1), q.get(0)); |
|
|
} |
|
|
|
|
|
|
|
|
public void testGetFirst_NoSuchElementException(){ |
|
|
try { |
|
|
LinkedList l = new LinkedList(); |
|
|
l.getFirst(); |
|
|
fail("First Element"); |
|
|
} |
|
|
catch(NoSuchElementException success) {} |
|
|
} |
|
|
|
|
|
public void testRemoveFirst() { |
|
|
try { |
|
|
LinkedList l = new LinkedList(); |
|
|
l.removeFirst(); |
|
|
fail("R: First Element"); |
|
|
} |
|
|
catch(NoSuchElementException success) {} |
|
537 |
} |
} |
538 |
|
|
539 |
public void testRemoveLast() { |
/** |
540 |
try { |
* pop removes next element, or throws NSEE if empty |
541 |
LinkedList l = new LinkedList(); |
*/ |
542 |
l.removeLast(); |
public void testPop() { |
543 |
fail("R: Last Element"); |
LinkedList q = populatedQueue(SIZE); |
544 |
} |
for (int i = 0; i < SIZE; ++i) { |
545 |
catch(NoSuchElementException success) {} |
assertEquals(i, q.pop()); |
546 |
} |
} |
|
|
|
|
public void testGetLast_NoSuchElementException(){ |
|
547 |
try { |
try { |
548 |
LinkedList l = new LinkedList(); |
q.pop(); |
549 |
l.getLast(); |
shouldThrow(); |
550 |
fail("Last Element"); |
} catch (NoSuchElementException success) {} |
|
} |
|
|
catch(NoSuchElementException success) {} |
|
551 |
} |
} |
552 |
|
|
553 |
|
/** |
554 |
public void testAddAll_NullPointerException(){ |
* OfferFirst succeeds |
555 |
try { |
*/ |
556 |
LinkedList l = new LinkedList(); |
public void testOfferFirst() { |
557 |
l.addAll((Collection)null); |
LinkedList q = new LinkedList(); |
558 |
fail("Add All Failed"); |
assertTrue(q.offerFirst(new Integer(0))); |
559 |
} |
assertTrue(q.offerFirst(new Integer(1))); |
|
catch(NullPointerException success){} |
|
560 |
} |
} |
561 |
|
|
562 |
|
/** |
563 |
public void testAddAll1_OutOfBounds() { |
* OfferLast succeeds |
564 |
try { |
*/ |
565 |
LinkedList l = new LinkedList(); |
public void testOfferLast() { |
566 |
l.addAll(4,new LinkedList()); |
LinkedList q = new LinkedList(); |
567 |
fail("boolean addAll(int, Collection) should throw IndexOutOfBoundsException"); |
assertTrue(q.offerLast(new Integer(0))); |
568 |
} |
assertTrue(q.offerLast(new Integer(1))); |
|
catch(IndexOutOfBoundsException success) {} |
|
569 |
} |
} |
570 |
|
|
571 |
|
/** |
572 |
public void testAddAll2_IndexOutOfBoundsException() { |
* pollLast succeeds unless empty |
573 |
try { |
*/ |
574 |
LinkedList l = new LinkedList(); |
public void testPollLast() { |
575 |
l.add(new Object()); |
LinkedList q = populatedQueue(SIZE); |
576 |
LinkedList m = new LinkedList(); |
for (int i = SIZE - 1; i >= 0; --i) { |
577 |
m.add(new Object()); |
assertEquals(i, q.pollLast()); |
|
l.addAll(4,m); |
|
|
fail("Add All Failed " + l.size()); |
|
|
}catch(IndexOutOfBoundsException success) {} |
|
578 |
} |
} |
579 |
|
assertNull(q.pollLast()); |
|
public void testAddAll4_BadIndex() { |
|
|
try { |
|
|
LinkedList l = new LinkedList(); |
|
|
l.add(new Object()); |
|
|
LinkedList m = new LinkedList(); |
|
|
m.add(new Object()); |
|
|
l.addAll(-1,m); |
|
|
fail("Add All Failed " + l.size()); |
|
|
}catch(IndexOutOfBoundsException success){} |
|
580 |
} |
} |
581 |
|
|
582 |
public void testget1() { |
/** |
583 |
try { |
* peekFirst returns next element, or null if empty |
584 |
LinkedList l = new LinkedList(); |
*/ |
585 |
l.add(new Object()); |
public void testPeekFirst() { |
586 |
l.get(-1); |
LinkedList q = populatedQueue(SIZE); |
587 |
fail("get Failed - l.get(-1)"); |
for (int i = 0; i < SIZE; ++i) { |
588 |
}catch(IndexOutOfBoundsException success) {} |
assertEquals(i, q.peekFirst()); |
589 |
|
assertEquals(i, q.pollFirst()); |
590 |
|
assertTrue(q.peekFirst() == null || |
591 |
|
!q.peekFirst().equals(i)); |
592 |
} |
} |
593 |
|
assertNull(q.peekFirst()); |
|
public void testget2() { |
|
|
try { |
|
|
LinkedList l = new LinkedList(); |
|
|
l.add(new Object()); |
|
|
l.get(5); |
|
|
fail("get Failed - l.get(5) l.size(): " + l.size()); |
|
|
}catch(IndexOutOfBoundsException success){} |
|
594 |
} |
} |
595 |
|
|
596 |
public void testset1() { |
/** |
597 |
try { |
* peekLast returns next element, or null if empty |
598 |
LinkedList l = new LinkedList(); |
*/ |
599 |
l.add(new Object()); |
public void testPeekLast() { |
600 |
l.set(-1,new Object()); |
LinkedList q = populatedQueue(SIZE); |
601 |
fail("set failed - l.set(-1,...)" + l.size()); |
for (int i = SIZE - 1; i >= 0; --i) { |
602 |
}catch(IndexOutOfBoundsException success){} |
assertEquals(i, q.peekLast()); |
603 |
|
assertEquals(i, q.pollLast()); |
604 |
|
assertTrue(q.peekLast() == null || |
605 |
|
!q.peekLast().equals(i)); |
606 |
} |
} |
607 |
|
assertNull(q.peekLast()); |
|
public void testset2() { |
|
|
try { |
|
|
LinkedList l = new LinkedList(); |
|
|
l.add(new Object()); |
|
|
l.set(5,new Object()); |
|
|
fail("set failed = l.set(5,..) l.size():" + l.size()); |
|
|
}catch(IndexOutOfBoundsException success){} |
|
608 |
} |
} |
609 |
|
|
610 |
public void testadd1() { |
public void testFirstElement() { |
611 |
try { |
LinkedList q = populatedQueue(SIZE); |
612 |
LinkedList l = new LinkedList(); |
for (int i = 0; i < SIZE; ++i) { |
613 |
l.add(new Object()); |
assertEquals(i, q.getFirst()); |
614 |
l.add(-1,new Object()); |
assertEquals(i, q.pollFirst()); |
|
fail("Add Failed - l.add(-1) l.size(): " + l.size()); |
|
|
}catch(IndexOutOfBoundsException success){} |
|
615 |
} |
} |
|
|
|
|
public void add2(){ |
|
616 |
try { |
try { |
617 |
LinkedList l = new LinkedList(); |
q.getFirst(); |
618 |
l.add(new Object()); |
shouldThrow(); |
619 |
l.add(5,new Object()); |
} catch (NoSuchElementException success) {} |
|
fail("Add Failed l.add(f,...)"); |
|
|
}catch(IndexOutOfBoundsException success) {} |
|
620 |
} |
} |
621 |
|
|
622 |
public void testremove(){ |
/** |
623 |
try { |
* getLast returns next element, or throws NSEE if empty |
624 |
LinkedList l = new LinkedList(); |
*/ |
625 |
l.add(new Object()); |
public void testLastElement() { |
626 |
l.remove(-1); |
LinkedList q = populatedQueue(SIZE); |
627 |
fail("Remove Failed l.remove(-1); l.size():" + l.size()); |
for (int i = SIZE - 1; i >= 0; --i) { |
628 |
}catch(IndexOutOfBoundsException success){} |
assertEquals(i, q.getLast()); |
629 |
|
assertEquals(i, q.pollLast()); |
630 |
} |
} |
|
|
|
|
public void testremove1(){ |
|
631 |
try { |
try { |
632 |
LinkedList l = new LinkedList(); |
q.getLast(); |
633 |
l.add(new Object()); |
shouldThrow(); |
634 |
l.remove(5); |
} catch (NoSuchElementException success) {} |
635 |
fail("Remove Failed l.remove(5); l.size():" + l.size()); |
assertNull(q.peekLast()); |
|
}catch(IndexOutOfBoundsException success){} |
|
636 |
} |
} |
637 |
|
|
638 |
|
/** |
639 |
public void testremove2(){ |
* removeFirstOccurrence(x) removes x and returns true if present |
640 |
try{ |
*/ |
641 |
LinkedList l = new LinkedList(); |
public void testRemoveFirstOccurrence() { |
642 |
l.remove(); |
LinkedList q = populatedQueue(SIZE); |
643 |
fail("LinkedList - Object remove() should throw a NoSuchElementException"); |
for (int i = 1; i < SIZE; i += 2) { |
644 |
}catch(NoSuchElementException e){} |
assertTrue(q.removeFirstOccurrence(new Integer(i))); |
645 |
} |
} |
646 |
|
for (int i = 0; i < SIZE; i += 2) { |
647 |
public void testlistIt1() { |
assertTrue(q.removeFirstOccurrence(new Integer(i))); |
648 |
try { |
assertFalse(q.removeFirstOccurrence(new Integer(i + 1))); |
|
LinkedList l = new LinkedList(); |
|
|
l.add(new Object()); |
|
|
l.listIterator(5); |
|
|
fail("l.listIterator(5) l.size():" + l.size()); |
|
|
}catch(IndexOutOfBoundsException success){} |
|
649 |
} |
} |
650 |
|
assertTrue(q.isEmpty()); |
|
public void testlistIt2() { |
|
|
try { |
|
|
LinkedList l = new LinkedList(); |
|
|
l.add(new Object()); |
|
|
l.listIterator(-1); |
|
|
fail("l.listIterator(-1) l.size():" + l.size()); |
|
|
}catch(IndexOutOfBoundsException success){} |
|
651 |
} |
} |
652 |
|
|
653 |
public void testlistIt3() { |
/** |
654 |
try { |
* removeLastOccurrence(x) removes x and returns true if present |
655 |
LinkedList l = new LinkedList(); |
*/ |
656 |
l.add(new Object()); |
public void testRemoveLastOccurrence() { |
657 |
ListIterator a = l.listIterator(0); |
LinkedList q = populatedQueue(SIZE); |
658 |
l.removeFirst(); |
for (int i = 1; i < SIZE; i += 2) { |
659 |
a.next(); |
assertTrue(q.removeLastOccurrence(new Integer(i))); |
|
fail("l.listIterator(-1) l.size():" + l.size()); |
|
|
}catch(ConcurrentModificationException success){} |
|
660 |
} |
} |
661 |
|
for (int i = 0; i < SIZE; i += 2) { |
662 |
public void testToArray_BadArg() { |
assertTrue(q.removeLastOccurrence(new Integer(i))); |
663 |
try { |
assertFalse(q.removeLastOccurrence(new Integer(i + 1))); |
|
LinkedList l = new LinkedList(); |
|
|
l.add(new Object()); |
|
|
Object o[] = l.toArray(null); |
|
|
fail("l.toArray(null) did not throw an exception"); |
|
|
}catch(NullPointerException success){} |
|
664 |
} |
} |
665 |
|
assertTrue(q.isEmpty()); |
|
public void testToArray1_BadArg() { |
|
|
try { |
|
|
LinkedList l = new LinkedList(); |
|
|
l.add(new Integer(5)); |
|
|
Object o[] = l.toArray(new String[10] ); |
|
|
fail("l.toArray(String[] f) did not throw an exception, an Integer was added"); |
|
|
}catch(ArrayStoreException success){} |
|
666 |
} |
} |
667 |
|
|
668 |
} |
} |