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