9 |
|
import java.util.ArrayList; |
10 |
|
import java.util.Arrays; |
11 |
|
import java.util.Collection; |
12 |
– |
import java.util.Collections; |
12 |
|
import java.util.Iterator; |
13 |
|
import java.util.NoSuchElementException; |
14 |
|
import java.util.Set; |
26 |
|
} |
27 |
|
|
28 |
|
static CopyOnWriteArraySet<Integer> populatedSet(int n) { |
29 |
< |
CopyOnWriteArraySet<Integer> a = new CopyOnWriteArraySet<Integer>(); |
29 |
> |
CopyOnWriteArraySet<Integer> a = new CopyOnWriteArraySet<>(); |
30 |
|
assertTrue(a.isEmpty()); |
31 |
|
for (int i = 0; i < n; i++) |
32 |
|
a.add(i); |
36 |
|
} |
37 |
|
|
38 |
|
static CopyOnWriteArraySet populatedSet(Integer[] elements) { |
39 |
< |
CopyOnWriteArraySet<Integer> a = new CopyOnWriteArraySet<Integer>(); |
39 |
> |
CopyOnWriteArraySet<Integer> a = new CopyOnWriteArraySet<>(); |
40 |
|
assertTrue(a.isEmpty()); |
41 |
|
for (int i = 0; i < elements.length; i++) |
42 |
|
a.add(elements[i]); |
223 |
|
Integer[] elements = new Integer[SIZE]; |
224 |
|
for (int i = 0; i < SIZE; i++) |
225 |
|
elements[i] = i; |
226 |
< |
Collections.shuffle(Arrays.asList(elements)); |
226 |
> |
shuffle(elements); |
227 |
|
Collection<Integer> full = populatedSet(elements); |
228 |
|
|
229 |
|
Iterator it = full.iterator(); |
310 |
|
Integer[] elements = new Integer[SIZE]; |
311 |
|
for (int i = 0; i < SIZE; i++) |
312 |
|
elements[i] = i; |
313 |
< |
Collections.shuffle(Arrays.asList(elements)); |
313 |
> |
shuffle(elements); |
314 |
|
Collection<Integer> full = populatedSet(elements); |
315 |
|
|
316 |
|
assertTrue(Arrays.equals(elements, full.toArray())); |
338 |
|
Integer[] elements = new Integer[SIZE]; |
339 |
|
for (int i = 0; i < SIZE; i++) |
340 |
|
elements[i] = i; |
341 |
< |
Collections.shuffle(Arrays.asList(elements)); |
341 |
> |
shuffle(elements); |
342 |
|
Collection<Integer> full = populatedSet(elements); |
343 |
|
|
344 |
|
Arrays.fill(a, 42); |