1 |
/* |
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 java.util.ArrayList; |
10 |
import java.util.Arrays; |
11 |
import java.util.Collection; |
12 |
import java.util.Collections; |
13 |
import java.util.Iterator; |
14 |
import java.util.LinkedList; |
15 |
import java.util.List; |
16 |
import java.util.ListIterator; |
17 |
import java.util.NoSuchElementException; |
18 |
import java.util.Vector; |
19 |
import java.util.concurrent.CopyOnWriteArrayList; |
20 |
|
21 |
import junit.framework.Test; |
22 |
import junit.framework.TestSuite; |
23 |
|
24 |
public class CopyOnWriteArrayListTest extends JSR166TestCase { |
25 |
|
26 |
public static void main(String[] args) { |
27 |
junit.textui.TestRunner.run(suite()); |
28 |
} |
29 |
|
30 |
public static Test suite() { |
31 |
return new TestSuite(CopyOnWriteArrayListTest.class); |
32 |
} |
33 |
|
34 |
static CopyOnWriteArrayList<Integer> populatedArray(int n) { |
35 |
CopyOnWriteArrayList<Integer> a = new CopyOnWriteArrayList<Integer>(); |
36 |
assertTrue(a.isEmpty()); |
37 |
for (int i = 0; i < n; i++) |
38 |
a.add(i); |
39 |
assertFalse(a.isEmpty()); |
40 |
assertEquals(n, a.size()); |
41 |
return a; |
42 |
} |
43 |
|
44 |
static CopyOnWriteArrayList<Integer> populatedArray(Integer[] elements) { |
45 |
CopyOnWriteArrayList<Integer> a = new CopyOnWriteArrayList<Integer>(); |
46 |
assertTrue(a.isEmpty()); |
47 |
for (int i = 0; i < elements.length; i++) |
48 |
a.add(elements[i]); |
49 |
assertFalse(a.isEmpty()); |
50 |
assertEquals(elements.length, a.size()); |
51 |
return a; |
52 |
} |
53 |
|
54 |
/** |
55 |
* a new list is empty |
56 |
*/ |
57 |
public void testConstructor() { |
58 |
CopyOnWriteArrayList a = new CopyOnWriteArrayList(); |
59 |
assertTrue(a.isEmpty()); |
60 |
} |
61 |
|
62 |
/** |
63 |
* new list contains all elements of initializing array |
64 |
*/ |
65 |
public void testConstructor2() { |
66 |
Integer[] ints = new Integer[SIZE]; |
67 |
for (int i = 0; i < SIZE-1; ++i) |
68 |
ints[i] = new Integer(i); |
69 |
CopyOnWriteArrayList a = new CopyOnWriteArrayList(ints); |
70 |
for (int i = 0; i < SIZE; ++i) |
71 |
assertEquals(ints[i], a.get(i)); |
72 |
} |
73 |
|
74 |
/** |
75 |
* new list contains all elements of initializing collection |
76 |
*/ |
77 |
public void testConstructor3() { |
78 |
Integer[] ints = new Integer[SIZE]; |
79 |
for (int i = 0; i < SIZE-1; ++i) |
80 |
ints[i] = new Integer(i); |
81 |
CopyOnWriteArrayList a = new CopyOnWriteArrayList(Arrays.asList(ints)); |
82 |
for (int i = 0; i < SIZE; ++i) |
83 |
assertEquals(ints[i], a.get(i)); |
84 |
} |
85 |
|
86 |
/** |
87 |
* addAll adds each element from the given collection |
88 |
*/ |
89 |
public void testAddAll() { |
90 |
CopyOnWriteArrayList full = populatedArray(3); |
91 |
Vector v = new Vector(); |
92 |
v.add(three); |
93 |
v.add(four); |
94 |
v.add(five); |
95 |
full.addAll(v); |
96 |
assertEquals(6, full.size()); |
97 |
} |
98 |
|
99 |
/** |
100 |
* addAllAbsent adds each element from the given collection that did not |
101 |
* already exist in the List |
102 |
*/ |
103 |
public void testAddAllAbsent() { |
104 |
CopyOnWriteArrayList full = populatedArray(3); |
105 |
Vector v = new Vector(); |
106 |
v.add(three); |
107 |
v.add(four); |
108 |
v.add(one); // will not add this element |
109 |
full.addAllAbsent(v); |
110 |
assertEquals(5, full.size()); |
111 |
} |
112 |
|
113 |
/** |
114 |
* addIfAbsent will not add the element if it already exists in the list |
115 |
*/ |
116 |
public void testAddIfAbsent() { |
117 |
CopyOnWriteArrayList full = populatedArray(SIZE); |
118 |
full.addIfAbsent(one); |
119 |
assertEquals(SIZE, full.size()); |
120 |
} |
121 |
|
122 |
/** |
123 |
* addIfAbsent adds the element when it does not exist in the list |
124 |
*/ |
125 |
public void testAddIfAbsent2() { |
126 |
CopyOnWriteArrayList full = populatedArray(SIZE); |
127 |
full.addIfAbsent(three); |
128 |
assertTrue(full.contains(three)); |
129 |
} |
130 |
|
131 |
/** |
132 |
* clear removes all elements from the list |
133 |
*/ |
134 |
public void testClear() { |
135 |
CopyOnWriteArrayList full = populatedArray(SIZE); |
136 |
full.clear(); |
137 |
assertEquals(0, full.size()); |
138 |
} |
139 |
|
140 |
/** |
141 |
* Cloned list is equal |
142 |
*/ |
143 |
public void testClone() { |
144 |
CopyOnWriteArrayList l1 = populatedArray(SIZE); |
145 |
CopyOnWriteArrayList l2 = (CopyOnWriteArrayList)(l1.clone()); |
146 |
assertEquals(l1, l2); |
147 |
l1.clear(); |
148 |
assertFalse(l1.equals(l2)); |
149 |
} |
150 |
|
151 |
/** |
152 |
* contains is true for added elements |
153 |
*/ |
154 |
public void testContains() { |
155 |
CopyOnWriteArrayList full = populatedArray(3); |
156 |
assertTrue(full.contains(one)); |
157 |
assertFalse(full.contains(five)); |
158 |
} |
159 |
|
160 |
/** |
161 |
* adding at an index places it in the indicated index |
162 |
*/ |
163 |
public void testAddIndex() { |
164 |
CopyOnWriteArrayList full = populatedArray(3); |
165 |
full.add(0, m1); |
166 |
assertEquals(4, full.size()); |
167 |
assertEquals(m1, full.get(0)); |
168 |
assertEquals(zero, full.get(1)); |
169 |
|
170 |
full.add(2, m2); |
171 |
assertEquals(5, full.size()); |
172 |
assertEquals(m2, full.get(2)); |
173 |
assertEquals(two, full.get(4)); |
174 |
} |
175 |
|
176 |
/** |
177 |
* lists with same elements are equal and have same hashCode |
178 |
*/ |
179 |
public void testEquals() { |
180 |
CopyOnWriteArrayList a = populatedArray(3); |
181 |
CopyOnWriteArrayList b = populatedArray(3); |
182 |
assertTrue(a.equals(b)); |
183 |
assertTrue(b.equals(a)); |
184 |
assertEquals(a.hashCode(), b.hashCode()); |
185 |
a.add(m1); |
186 |
assertFalse(a.equals(b)); |
187 |
assertFalse(b.equals(a)); |
188 |
b.add(m1); |
189 |
assertTrue(a.equals(b)); |
190 |
assertTrue(b.equals(a)); |
191 |
assertEquals(a.hashCode(), b.hashCode()); |
192 |
} |
193 |
|
194 |
/** |
195 |
* containsAll returns true for collection with subset of elements |
196 |
*/ |
197 |
public void testContainsAll() { |
198 |
CopyOnWriteArrayList full = populatedArray(3); |
199 |
Vector v = new Vector(); |
200 |
v.add(one); |
201 |
v.add(two); |
202 |
assertTrue(full.containsAll(v)); |
203 |
v.add(six); |
204 |
assertFalse(full.containsAll(v)); |
205 |
} |
206 |
|
207 |
/** |
208 |
* get returns the value at the given index |
209 |
*/ |
210 |
public void testGet() { |
211 |
CopyOnWriteArrayList full = populatedArray(3); |
212 |
assertEquals(0, full.get(0)); |
213 |
} |
214 |
|
215 |
/** |
216 |
* indexOf gives the index for the given object |
217 |
*/ |
218 |
public void testIndexOf() { |
219 |
CopyOnWriteArrayList full = populatedArray(3); |
220 |
assertEquals(1, full.indexOf(one)); |
221 |
assertEquals(-1, full.indexOf("puppies")); |
222 |
} |
223 |
|
224 |
/** |
225 |
* indexOf gives the index based on the given index |
226 |
* at which to start searching |
227 |
*/ |
228 |
public void testIndexOf2() { |
229 |
CopyOnWriteArrayList full = populatedArray(3); |
230 |
assertEquals(1, full.indexOf(one, 0)); |
231 |
assertEquals(-1, full.indexOf(one, 2)); |
232 |
} |
233 |
|
234 |
/** |
235 |
* isEmpty returns true when empty, else false |
236 |
*/ |
237 |
public void testIsEmpty() { |
238 |
CopyOnWriteArrayList empty = new CopyOnWriteArrayList(); |
239 |
CopyOnWriteArrayList full = populatedArray(SIZE); |
240 |
assertTrue(empty.isEmpty()); |
241 |
assertFalse(full.isEmpty()); |
242 |
} |
243 |
|
244 |
/** |
245 |
* iterator() returns an iterator containing the elements of the |
246 |
* list in insertion order |
247 |
*/ |
248 |
public void testIterator() { |
249 |
Collection empty = new CopyOnWriteArrayList(); |
250 |
assertFalse(empty.iterator().hasNext()); |
251 |
try { |
252 |
empty.iterator().next(); |
253 |
shouldThrow(); |
254 |
} catch (NoSuchElementException success) {} |
255 |
|
256 |
Integer[] elements = new Integer[SIZE]; |
257 |
for (int i = 0; i < SIZE; i++) |
258 |
elements[i] = i; |
259 |
Collections.shuffle(Arrays.asList(elements)); |
260 |
Collection<Integer> full = populatedArray(elements); |
261 |
|
262 |
Iterator it = full.iterator(); |
263 |
for (int j = 0; j < SIZE; j++) { |
264 |
assertTrue(it.hasNext()); |
265 |
assertEquals(elements[j], it.next()); |
266 |
} |
267 |
assertFalse(it.hasNext()); |
268 |
try { |
269 |
it.next(); |
270 |
shouldThrow(); |
271 |
} catch (NoSuchElementException success) {} |
272 |
} |
273 |
|
274 |
/** |
275 |
* iterator.remove throws UnsupportedOperationException |
276 |
*/ |
277 |
public void testIteratorRemove() { |
278 |
CopyOnWriteArrayList full = populatedArray(SIZE); |
279 |
Iterator it = full.iterator(); |
280 |
it.next(); |
281 |
try { |
282 |
it.remove(); |
283 |
shouldThrow(); |
284 |
} catch (UnsupportedOperationException success) {} |
285 |
} |
286 |
|
287 |
/** |
288 |
* toString contains toString of elements |
289 |
*/ |
290 |
public void testToString() { |
291 |
assertEquals("[]", new CopyOnWriteArrayList().toString()); |
292 |
CopyOnWriteArrayList full = populatedArray(3); |
293 |
String s = full.toString(); |
294 |
for (int i = 0; i < 3; ++i) |
295 |
assertTrue(s.contains(String.valueOf(i))); |
296 |
assertEquals(new ArrayList(full).toString(), |
297 |
full.toString()); |
298 |
} |
299 |
|
300 |
/** |
301 |
* lastIndexOf returns the index for the given object |
302 |
*/ |
303 |
public void testLastIndexOf1() { |
304 |
CopyOnWriteArrayList full = populatedArray(3); |
305 |
full.add(one); |
306 |
full.add(three); |
307 |
assertEquals(3, full.lastIndexOf(one)); |
308 |
assertEquals(-1, full.lastIndexOf(six)); |
309 |
} |
310 |
|
311 |
/** |
312 |
* lastIndexOf returns the index from the given starting point |
313 |
*/ |
314 |
public void testLastIndexOf2() { |
315 |
CopyOnWriteArrayList full = populatedArray(3); |
316 |
full.add(one); |
317 |
full.add(three); |
318 |
assertEquals(3, full.lastIndexOf(one, 4)); |
319 |
assertEquals(-1, full.lastIndexOf(three, 3)); |
320 |
} |
321 |
|
322 |
/** |
323 |
* listIterator traverses all elements |
324 |
*/ |
325 |
public void testListIterator1() { |
326 |
CopyOnWriteArrayList full = populatedArray(SIZE); |
327 |
ListIterator i = full.listIterator(); |
328 |
int j; |
329 |
for (j = 0; i.hasNext(); j++) |
330 |
assertEquals(j, i.next()); |
331 |
assertEquals(SIZE, j); |
332 |
} |
333 |
|
334 |
/** |
335 |
* listIterator only returns those elements after the given index |
336 |
*/ |
337 |
public void testListIterator2() { |
338 |
CopyOnWriteArrayList full = populatedArray(3); |
339 |
ListIterator i = full.listIterator(1); |
340 |
int j; |
341 |
for (j = 0; i.hasNext(); j++) |
342 |
assertEquals(j+1, i.next()); |
343 |
assertEquals(2, j); |
344 |
} |
345 |
|
346 |
/** |
347 |
* remove(int) removes and returns the object at the given index |
348 |
*/ |
349 |
public void testRemove_int() { |
350 |
int SIZE = 3; |
351 |
for (int i = 0; i < SIZE; i++) { |
352 |
CopyOnWriteArrayList full = populatedArray(SIZE); |
353 |
assertEquals(i, full.remove(i)); |
354 |
assertEquals(SIZE - 1, full.size()); |
355 |
assertFalse(full.contains(new Integer(i))); |
356 |
} |
357 |
} |
358 |
|
359 |
/** |
360 |
* remove(Object) removes the object if found and returns true |
361 |
*/ |
362 |
public void testRemove_Object() { |
363 |
int SIZE = 3; |
364 |
for (int i = 0; i < SIZE; i++) { |
365 |
CopyOnWriteArrayList full = populatedArray(SIZE); |
366 |
assertFalse(full.remove(new Integer(-42))); |
367 |
assertTrue(full.remove(new Integer(i))); |
368 |
assertEquals(SIZE - 1, full.size()); |
369 |
assertFalse(full.contains(new Integer(i))); |
370 |
} |
371 |
CopyOnWriteArrayList x = new CopyOnWriteArrayList(Arrays.asList(4, 5, 6)); |
372 |
assertTrue(x.remove(new Integer(6))); |
373 |
assertEquals(x, Arrays.asList(4, 5)); |
374 |
assertTrue(x.remove(new Integer(4))); |
375 |
assertEquals(x, Arrays.asList(5)); |
376 |
assertTrue(x.remove(new Integer(5))); |
377 |
assertEquals(x, Arrays.asList()); |
378 |
assertFalse(x.remove(new Integer(5))); |
379 |
} |
380 |
|
381 |
/** |
382 |
* removeAll removes all elements from the given collection |
383 |
*/ |
384 |
public void testRemoveAll() { |
385 |
CopyOnWriteArrayList full = populatedArray(3); |
386 |
Vector v = new Vector(); |
387 |
v.add(one); |
388 |
v.add(two); |
389 |
full.removeAll(v); |
390 |
assertEquals(1, full.size()); |
391 |
} |
392 |
|
393 |
/** |
394 |
* set changes the element at the given index |
395 |
*/ |
396 |
public void testSet() { |
397 |
CopyOnWriteArrayList full = populatedArray(3); |
398 |
assertEquals(2, full.set(2, four)); |
399 |
assertEquals(4, full.get(2)); |
400 |
} |
401 |
|
402 |
/** |
403 |
* size returns the number of elements |
404 |
*/ |
405 |
public void testSize() { |
406 |
CopyOnWriteArrayList empty = new CopyOnWriteArrayList(); |
407 |
CopyOnWriteArrayList full = populatedArray(SIZE); |
408 |
assertEquals(SIZE, full.size()); |
409 |
assertEquals(0, empty.size()); |
410 |
} |
411 |
|
412 |
/** |
413 |
* toArray() returns an Object array containing all elements from |
414 |
* the list in insertion order |
415 |
*/ |
416 |
public void testToArray() { |
417 |
Object[] a = new CopyOnWriteArrayList().toArray(); |
418 |
assertTrue(Arrays.equals(new Object[0], a)); |
419 |
assertSame(Object[].class, a.getClass()); |
420 |
|
421 |
Integer[] elements = new Integer[SIZE]; |
422 |
for (int i = 0; i < SIZE; i++) |
423 |
elements[i] = i; |
424 |
Collections.shuffle(Arrays.asList(elements)); |
425 |
Collection<Integer> full = populatedArray(elements); |
426 |
|
427 |
assertTrue(Arrays.equals(elements, full.toArray())); |
428 |
assertSame(Object[].class, full.toArray().getClass()); |
429 |
} |
430 |
|
431 |
/** |
432 |
* toArray(Integer array) returns an Integer array containing all |
433 |
* elements from the list in insertion order |
434 |
*/ |
435 |
public void testToArray2() { |
436 |
Collection empty = new CopyOnWriteArrayList(); |
437 |
Integer[] a; |
438 |
|
439 |
a = new Integer[0]; |
440 |
assertSame(a, empty.toArray(a)); |
441 |
|
442 |
a = new Integer[SIZE/2]; |
443 |
Arrays.fill(a, 42); |
444 |
assertSame(a, empty.toArray(a)); |
445 |
assertNull(a[0]); |
446 |
for (int i = 1; i < a.length; i++) |
447 |
assertEquals(42, (int) a[i]); |
448 |
|
449 |
Integer[] elements = new Integer[SIZE]; |
450 |
for (int i = 0; i < SIZE; i++) |
451 |
elements[i] = i; |
452 |
Collections.shuffle(Arrays.asList(elements)); |
453 |
Collection<Integer> full = populatedArray(elements); |
454 |
|
455 |
Arrays.fill(a, 42); |
456 |
assertTrue(Arrays.equals(elements, full.toArray(a))); |
457 |
for (int i = 0; i < a.length; i++) |
458 |
assertEquals(42, (int) a[i]); |
459 |
assertSame(Integer[].class, full.toArray(a).getClass()); |
460 |
|
461 |
a = new Integer[SIZE]; |
462 |
Arrays.fill(a, 42); |
463 |
assertSame(a, full.toArray(a)); |
464 |
assertTrue(Arrays.equals(elements, a)); |
465 |
|
466 |
a = new Integer[2*SIZE]; |
467 |
Arrays.fill(a, 42); |
468 |
assertSame(a, full.toArray(a)); |
469 |
assertTrue(Arrays.equals(elements, Arrays.copyOf(a, SIZE))); |
470 |
assertNull(a[SIZE]); |
471 |
for (int i = SIZE + 1; i < a.length; i++) |
472 |
assertEquals(42, (int) a[i]); |
473 |
} |
474 |
|
475 |
/** |
476 |
* sublists contains elements at indexes offset from their base |
477 |
*/ |
478 |
public void testSubList() { |
479 |
CopyOnWriteArrayList a = populatedArray(10); |
480 |
assertTrue(a.subList(1,1).isEmpty()); |
481 |
for (int j = 0; j < 9; ++j) { |
482 |
for (int i = j ; i < 10; ++i) { |
483 |
List b = a.subList(j,i); |
484 |
for (int k = j; k < i; ++k) { |
485 |
assertEquals(new Integer(k), b.get(k-j)); |
486 |
} |
487 |
} |
488 |
} |
489 |
|
490 |
List s = a.subList(2, 5); |
491 |
assertEquals(3, s.size()); |
492 |
s.set(2, m1); |
493 |
assertEquals(a.get(4), m1); |
494 |
s.clear(); |
495 |
assertEquals(7, a.size()); |
496 |
} |
497 |
|
498 |
// Exception tests |
499 |
|
500 |
/** |
501 |
* toArray throws an ArrayStoreException when the given array |
502 |
* can not store the objects inside the list |
503 |
*/ |
504 |
public void testToArray_ArrayStoreException() { |
505 |
CopyOnWriteArrayList c = new CopyOnWriteArrayList(); |
506 |
c.add("zfasdfsdf"); |
507 |
c.add("asdadasd"); |
508 |
try { |
509 |
c.toArray(new Long[5]); |
510 |
shouldThrow(); |
511 |
} catch (ArrayStoreException success) {} |
512 |
} |
513 |
|
514 |
/** |
515 |
* get throws an IndexOutOfBoundsException on a negative index |
516 |
*/ |
517 |
public void testGet1_IndexOutOfBoundsException() { |
518 |
CopyOnWriteArrayList c = populatedArray(5); |
519 |
List[] lists = { c, c.subList(1, c.size() - 1) }; |
520 |
for (List list : lists) { |
521 |
try { |
522 |
list.get(-1); |
523 |
shouldThrow(); |
524 |
} catch (IndexOutOfBoundsException success) {} |
525 |
} |
526 |
} |
527 |
|
528 |
/** |
529 |
* get throws an IndexOutOfBoundsException on a too high index |
530 |
*/ |
531 |
public void testGet2_IndexOutOfBoundsException() { |
532 |
CopyOnWriteArrayList c = populatedArray(5); |
533 |
List[] lists = { c, c.subList(1, c.size() - 1) }; |
534 |
for (List list : lists) { |
535 |
try { |
536 |
list.get(list.size()); |
537 |
shouldThrow(); |
538 |
} catch (IndexOutOfBoundsException success) {} |
539 |
} |
540 |
} |
541 |
|
542 |
/** |
543 |
* set throws an IndexOutOfBoundsException on a negative index |
544 |
*/ |
545 |
public void testSet1_IndexOutOfBoundsException() { |
546 |
CopyOnWriteArrayList c = populatedArray(5); |
547 |
List[] lists = { c, c.subList(1, c.size() - 1) }; |
548 |
for (List list : lists) { |
549 |
try { |
550 |
list.set(-1, "qwerty"); |
551 |
shouldThrow(); |
552 |
} catch (IndexOutOfBoundsException success) {} |
553 |
} |
554 |
} |
555 |
|
556 |
/** |
557 |
* set throws an IndexOutOfBoundsException on a too high index |
558 |
*/ |
559 |
public void testSet2() { |
560 |
CopyOnWriteArrayList c = populatedArray(5); |
561 |
List[] lists = { c, c.subList(1, c.size() - 1) }; |
562 |
for (List list : lists) { |
563 |
try { |
564 |
list.set(list.size(), "qwerty"); |
565 |
shouldThrow(); |
566 |
} catch (IndexOutOfBoundsException success) {} |
567 |
} |
568 |
} |
569 |
|
570 |
/** |
571 |
* add throws an IndexOutOfBoundsException on a negative index |
572 |
*/ |
573 |
public void testAdd1_IndexOutOfBoundsException() { |
574 |
CopyOnWriteArrayList c = populatedArray(5); |
575 |
List[] lists = { c, c.subList(1, c.size() - 1) }; |
576 |
for (List list : lists) { |
577 |
try { |
578 |
list.add(-1, "qwerty"); |
579 |
shouldThrow(); |
580 |
} catch (IndexOutOfBoundsException success) {} |
581 |
} |
582 |
} |
583 |
|
584 |
/** |
585 |
* add throws an IndexOutOfBoundsException on a too high index |
586 |
*/ |
587 |
public void testAdd2_IndexOutOfBoundsException() { |
588 |
CopyOnWriteArrayList c = populatedArray(5); |
589 |
List[] lists = { c, c.subList(1, c.size() - 1) }; |
590 |
for (List list : lists) { |
591 |
try { |
592 |
list.add(list.size() + 1, "qwerty"); |
593 |
shouldThrow(); |
594 |
} catch (IndexOutOfBoundsException success) {} |
595 |
} |
596 |
} |
597 |
|
598 |
/** |
599 |
* remove throws an IndexOutOfBoundsException on a negative index |
600 |
*/ |
601 |
public void testRemove1_IndexOutOfBounds() { |
602 |
CopyOnWriteArrayList c = populatedArray(5); |
603 |
List[] lists = { c, c.subList(1, c.size() - 1) }; |
604 |
for (List list : lists) { |
605 |
try { |
606 |
list.remove(-1); |
607 |
shouldThrow(); |
608 |
} catch (IndexOutOfBoundsException success) {} |
609 |
} |
610 |
} |
611 |
|
612 |
/** |
613 |
* remove throws an IndexOutOfBoundsException on a too high index |
614 |
*/ |
615 |
public void testRemove2_IndexOutOfBounds() { |
616 |
CopyOnWriteArrayList c = populatedArray(5); |
617 |
List[] lists = { c, c.subList(1, c.size() - 1) }; |
618 |
for (List list : lists) { |
619 |
try { |
620 |
list.remove(list.size()); |
621 |
shouldThrow(); |
622 |
} catch (IndexOutOfBoundsException success) {} |
623 |
} |
624 |
} |
625 |
|
626 |
/** |
627 |
* addAll throws an IndexOutOfBoundsException on a negative index |
628 |
*/ |
629 |
public void testAddAll1_IndexOutOfBoundsException() { |
630 |
CopyOnWriteArrayList c = populatedArray(5); |
631 |
List[] lists = { c, c.subList(1, c.size() - 1) }; |
632 |
for (List list : lists) { |
633 |
try { |
634 |
list.addAll(-1, new LinkedList()); |
635 |
shouldThrow(); |
636 |
} catch (IndexOutOfBoundsException success) {} |
637 |
} |
638 |
} |
639 |
|
640 |
/** |
641 |
* addAll throws an IndexOutOfBoundsException on a too high index |
642 |
*/ |
643 |
public void testAddAll2_IndexOutOfBoundsException() { |
644 |
CopyOnWriteArrayList c = populatedArray(5); |
645 |
List[] lists = { c, c.subList(1, c.size() - 1) }; |
646 |
for (List list : lists) { |
647 |
try { |
648 |
list.addAll(list.size() + 1, new LinkedList()); |
649 |
shouldThrow(); |
650 |
} catch (IndexOutOfBoundsException success) {} |
651 |
} |
652 |
} |
653 |
|
654 |
/** |
655 |
* listIterator throws an IndexOutOfBoundsException on a negative index |
656 |
*/ |
657 |
public void testListIterator1_IndexOutOfBoundsException() { |
658 |
CopyOnWriteArrayList c = populatedArray(5); |
659 |
List[] lists = { c, c.subList(1, c.size() - 1) }; |
660 |
for (List list : lists) { |
661 |
try { |
662 |
list.listIterator(-1); |
663 |
shouldThrow(); |
664 |
} catch (IndexOutOfBoundsException success) {} |
665 |
} |
666 |
} |
667 |
|
668 |
/** |
669 |
* listIterator throws an IndexOutOfBoundsException on a too high index |
670 |
*/ |
671 |
public void testListIterator2_IndexOutOfBoundsException() { |
672 |
CopyOnWriteArrayList c = populatedArray(5); |
673 |
List[] lists = { c, c.subList(1, c.size() - 1) }; |
674 |
for (List list : lists) { |
675 |
try { |
676 |
list.listIterator(list.size() + 1); |
677 |
shouldThrow(); |
678 |
} catch (IndexOutOfBoundsException success) {} |
679 |
} |
680 |
} |
681 |
|
682 |
/** |
683 |
* subList throws an IndexOutOfBoundsException on a negative index |
684 |
*/ |
685 |
public void testSubList1_IndexOutOfBoundsException() { |
686 |
CopyOnWriteArrayList c = populatedArray(5); |
687 |
List[] lists = { c, c.subList(1, c.size() - 1) }; |
688 |
for (List list : lists) { |
689 |
try { |
690 |
list.subList(-1, list.size()); |
691 |
shouldThrow(); |
692 |
} catch (IndexOutOfBoundsException success) {} |
693 |
} |
694 |
} |
695 |
|
696 |
/** |
697 |
* subList throws an IndexOutOfBoundsException on a too high index |
698 |
*/ |
699 |
public void testSubList2_IndexOutOfBoundsException() { |
700 |
CopyOnWriteArrayList c = populatedArray(5); |
701 |
List[] lists = { c, c.subList(1, c.size() - 1) }; |
702 |
for (List list : lists) { |
703 |
try { |
704 |
list.subList(0, list.size() + 1); |
705 |
shouldThrow(); |
706 |
} catch (IndexOutOfBoundsException success) {} |
707 |
} |
708 |
} |
709 |
|
710 |
/** |
711 |
* subList throws IndexOutOfBoundsException when the second index |
712 |
* is lower then the first |
713 |
*/ |
714 |
public void testSubList3_IndexOutOfBoundsException() { |
715 |
CopyOnWriteArrayList c = populatedArray(5); |
716 |
List[] lists = { c, c.subList(1, c.size() - 1) }; |
717 |
for (List list : lists) { |
718 |
try { |
719 |
list.subList(list.size() - 1, 1); |
720 |
shouldThrow(); |
721 |
} catch (IndexOutOfBoundsException success) {} |
722 |
} |
723 |
} |
724 |
|
725 |
/** |
726 |
* a deserialized serialized list is equal |
727 |
*/ |
728 |
public void testSerialization() throws Exception { |
729 |
List x = populatedArray(SIZE); |
730 |
List y = serialClone(x); |
731 |
|
732 |
assertNotSame(x, y); |
733 |
assertEquals(x.size(), y.size()); |
734 |
assertEquals(x.toString(), y.toString()); |
735 |
assertTrue(Arrays.equals(x.toArray(), y.toArray())); |
736 |
assertEquals(x, y); |
737 |
assertEquals(y, x); |
738 |
while (!x.isEmpty()) { |
739 |
assertFalse(y.isEmpty()); |
740 |
assertEquals(x.remove(0), y.remove(0)); |
741 |
} |
742 |
assertTrue(y.isEmpty()); |
743 |
} |
744 |
|
745 |
} |