13 |
|
import java.util.Iterator; |
14 |
|
import java.util.NoSuchElementException; |
15 |
|
import java.util.Set; |
16 |
– |
import java.util.Vector; |
16 |
|
import java.util.concurrent.CopyOnWriteArraySet; |
17 |
|
|
18 |
|
import junit.framework.Test; |
20 |
|
|
21 |
|
public class CopyOnWriteArraySetTest extends JSR166TestCase { |
22 |
|
public static void main(String[] args) { |
23 |
< |
junit.textui.TestRunner.run(suite()); |
23 |
> |
main(suite(), args); |
24 |
|
} |
25 |
|
public static Test suite() { |
26 |
|
return new TestSuite(CopyOnWriteArraySetTest.class); |
31 |
|
assertTrue(a.isEmpty()); |
32 |
|
for (int i = 0; i < n; i++) |
33 |
|
a.add(i); |
34 |
< |
assertFalse(a.isEmpty()); |
34 |
> |
assertEquals(n == 0, a.isEmpty()); |
35 |
|
assertEquals(n, a.size()); |
36 |
|
return a; |
37 |
|
} |
59 |
|
*/ |
60 |
|
public void testConstructor3() { |
61 |
|
Integer[] ints = new Integer[SIZE]; |
62 |
< |
for (int i = 0; i < SIZE-1; ++i) |
62 |
> |
for (int i = 0; i < SIZE - 1; ++i) |
63 |
|
ints[i] = new Integer(i); |
64 |
|
CopyOnWriteArraySet a = new CopyOnWriteArraySet(Arrays.asList(ints)); |
65 |
|
for (int i = 0; i < SIZE; ++i) |
67 |
|
} |
68 |
|
|
69 |
|
/** |
70 |
< |
* addAll adds each element from the given collection |
70 |
> |
* addAll adds each non-duplicate element from the given collection |
71 |
|
*/ |
72 |
|
public void testAddAll() { |
73 |
< |
CopyOnWriteArraySet full = populatedSet(3); |
74 |
< |
Vector v = new Vector(); |
75 |
< |
v.add(three); |
76 |
< |
v.add(four); |
78 |
< |
v.add(five); |
79 |
< |
full.addAll(v); |
73 |
> |
Set full = populatedSet(3); |
74 |
> |
assertTrue(full.addAll(Arrays.asList(three, four, five))); |
75 |
> |
assertEquals(6, full.size()); |
76 |
> |
assertFalse(full.addAll(Arrays.asList(three, four, five))); |
77 |
|
assertEquals(6, full.size()); |
78 |
|
} |
79 |
|
|
80 |
|
/** |
81 |
< |
* addAll adds each element from the given collection that did not |
85 |
< |
* already exist in the set |
81 |
> |
* addAll adds each non-duplicate element from the given collection |
82 |
|
*/ |
83 |
|
public void testAddAll2() { |
84 |
< |
CopyOnWriteArraySet full = populatedSet(3); |
85 |
< |
Vector v = new Vector(); |
86 |
< |
v.add(three); |
87 |
< |
v.add(four); |
88 |
< |
v.add(one); // will not add this element |
93 |
< |
full.addAll(v); |
84 |
> |
Set full = populatedSet(3); |
85 |
> |
// "one" is duplicate and will not be added |
86 |
> |
assertTrue(full.addAll(Arrays.asList(three, four, one))); |
87 |
> |
assertEquals(5, full.size()); |
88 |
> |
assertFalse(full.addAll(Arrays.asList(three, four, one))); |
89 |
|
assertEquals(5, full.size()); |
90 |
|
} |
91 |
|
|
93 |
|
* add will not add the element if it already exists in the set |
94 |
|
*/ |
95 |
|
public void testAdd2() { |
96 |
< |
CopyOnWriteArraySet full = populatedSet(3); |
96 |
> |
Set full = populatedSet(3); |
97 |
|
full.add(one); |
98 |
|
assertEquals(3, full.size()); |
99 |
|
} |
102 |
|
* add adds the element when it does not exist in the set |
103 |
|
*/ |
104 |
|
public void testAdd3() { |
105 |
< |
CopyOnWriteArraySet full = populatedSet(3); |
105 |
> |
Set full = populatedSet(3); |
106 |
|
full.add(three); |
107 |
|
assertTrue(full.contains(three)); |
108 |
|
} |
111 |
|
* clear removes all elements from the set |
112 |
|
*/ |
113 |
|
public void testClear() { |
114 |
< |
CopyOnWriteArraySet full = populatedSet(3); |
114 |
> |
Collection full = populatedSet(3); |
115 |
|
full.clear(); |
116 |
|
assertEquals(0, full.size()); |
117 |
+ |
assertTrue(full.isEmpty()); |
118 |
|
} |
119 |
|
|
120 |
|
/** |
121 |
|
* contains returns true for added elements |
122 |
|
*/ |
123 |
|
public void testContains() { |
124 |
< |
CopyOnWriteArraySet full = populatedSet(3); |
124 |
> |
Collection full = populatedSet(3); |
125 |
|
assertTrue(full.contains(one)); |
126 |
|
assertFalse(full.contains(five)); |
127 |
|
} |
134 |
|
CopyOnWriteArraySet b = populatedSet(3); |
135 |
|
assertTrue(a.equals(b)); |
136 |
|
assertTrue(b.equals(a)); |
137 |
+ |
assertTrue(a.containsAll(b)); |
138 |
+ |
assertTrue(b.containsAll(a)); |
139 |
|
assertEquals(a.hashCode(), b.hashCode()); |
140 |
+ |
assertEquals(a.size(), b.size()); |
141 |
+ |
|
142 |
|
a.add(m1); |
143 |
|
assertFalse(a.equals(b)); |
144 |
|
assertFalse(b.equals(a)); |
145 |
+ |
assertTrue(a.containsAll(b)); |
146 |
+ |
assertFalse(b.containsAll(a)); |
147 |
|
b.add(m1); |
148 |
|
assertTrue(a.equals(b)); |
149 |
|
assertTrue(b.equals(a)); |
150 |
+ |
assertTrue(a.containsAll(b)); |
151 |
+ |
assertTrue(b.containsAll(a)); |
152 |
|
assertEquals(a.hashCode(), b.hashCode()); |
153 |
+ |
|
154 |
+ |
Object x = a.iterator().next(); |
155 |
+ |
a.remove(x); |
156 |
+ |
assertFalse(a.equals(b)); |
157 |
+ |
assertFalse(b.equals(a)); |
158 |
+ |
assertFalse(a.containsAll(b)); |
159 |
+ |
assertTrue(b.containsAll(a)); |
160 |
+ |
a.add(x); |
161 |
+ |
assertTrue(a.equals(b)); |
162 |
+ |
assertTrue(b.equals(a)); |
163 |
+ |
assertTrue(a.containsAll(b)); |
164 |
+ |
assertTrue(b.containsAll(a)); |
165 |
+ |
assertEquals(a.hashCode(), b.hashCode()); |
166 |
+ |
assertEquals(a.size(), b.size()); |
167 |
+ |
|
168 |
+ |
CopyOnWriteArraySet empty1 = new CopyOnWriteArraySet(Arrays.asList()); |
169 |
+ |
CopyOnWriteArraySet empty2 = new CopyOnWriteArraySet(Arrays.asList()); |
170 |
+ |
assertTrue(empty1.equals(empty1)); |
171 |
+ |
assertTrue(empty1.equals(empty2)); |
172 |
+ |
|
173 |
+ |
assertFalse(empty1.equals(a)); |
174 |
+ |
assertFalse(a.equals(empty1)); |
175 |
+ |
|
176 |
+ |
assertFalse(a.equals(null)); |
177 |
|
} |
178 |
|
|
179 |
|
/** |
180 |
|
* containsAll returns true for collections with subset of elements |
181 |
|
*/ |
182 |
|
public void testContainsAll() { |
183 |
< |
CopyOnWriteArraySet full = populatedSet(3); |
184 |
< |
Vector v = new Vector(); |
185 |
< |
v.add(one); |
186 |
< |
v.add(two); |
187 |
< |
assertTrue(full.containsAll(v)); |
188 |
< |
v.add(six); |
189 |
< |
assertFalse(full.containsAll(v)); |
183 |
> |
Collection full = populatedSet(3); |
184 |
> |
assertTrue(full.containsAll(full)); |
185 |
> |
assertTrue(full.containsAll(Arrays.asList())); |
186 |
> |
assertTrue(full.containsAll(Arrays.asList(one))); |
187 |
> |
assertTrue(full.containsAll(Arrays.asList(one, two))); |
188 |
> |
assertFalse(full.containsAll(Arrays.asList(one, two, six))); |
189 |
> |
assertFalse(full.containsAll(Arrays.asList(six))); |
190 |
> |
|
191 |
> |
CopyOnWriteArraySet empty1 = new CopyOnWriteArraySet(Arrays.asList()); |
192 |
> |
CopyOnWriteArraySet empty2 = new CopyOnWriteArraySet(Arrays.asList()); |
193 |
> |
assertTrue(empty1.containsAll(empty2)); |
194 |
> |
assertTrue(empty1.containsAll(empty1)); |
195 |
> |
assertFalse(empty1.containsAll(full)); |
196 |
> |
assertTrue(full.containsAll(empty1)); |
197 |
> |
|
198 |
> |
try { |
199 |
> |
full.containsAll(null); |
200 |
> |
shouldThrow(); |
201 |
> |
} catch (NullPointerException success) {} |
202 |
|
} |
203 |
|
|
204 |
|
/** |
205 |
|
* isEmpty is true when empty, else false |
206 |
|
*/ |
207 |
|
public void testIsEmpty() { |
208 |
< |
CopyOnWriteArraySet empty = new CopyOnWriteArraySet(); |
209 |
< |
CopyOnWriteArraySet full = populatedSet(3); |
170 |
< |
assertTrue(empty.isEmpty()); |
171 |
< |
assertFalse(full.isEmpty()); |
208 |
> |
assertTrue(populatedSet(0).isEmpty()); |
209 |
> |
assertFalse(populatedSet(3).isEmpty()); |
210 |
|
} |
211 |
|
|
212 |
|
/** |
224 |
|
Integer[] elements = new Integer[SIZE]; |
225 |
|
for (int i = 0; i < SIZE; i++) |
226 |
|
elements[i] = i; |
227 |
< |
Collections.shuffle(Arrays.asList(elements)); |
227 |
> |
shuffle(elements); |
228 |
|
Collection<Integer> full = populatedSet(elements); |
229 |
|
|
230 |
|
Iterator it = full.iterator(); |
232 |
|
assertTrue(it.hasNext()); |
233 |
|
assertEquals(elements[j], it.next()); |
234 |
|
} |
235 |
< |
assertFalse(it.hasNext()); |
236 |
< |
try { |
237 |
< |
it.next(); |
238 |
< |
shouldThrow(); |
239 |
< |
} catch (NoSuchElementException success) {} |
235 |
> |
assertIteratorExhausted(it); |
236 |
> |
} |
237 |
> |
|
238 |
> |
/** |
239 |
> |
* iterator of empty collection has no elements |
240 |
> |
*/ |
241 |
> |
public void testEmptyIterator() { |
242 |
> |
assertIteratorExhausted(new CopyOnWriteArraySet().iterator()); |
243 |
|
} |
244 |
|
|
245 |
|
/** |
246 |
|
* iterator remove is unsupported |
247 |
|
*/ |
248 |
|
public void testIteratorRemove() { |
249 |
< |
CopyOnWriteArraySet full = populatedSet(3); |
249 |
> |
Collection full = populatedSet(3); |
250 |
|
Iterator it = full.iterator(); |
251 |
|
it.next(); |
252 |
|
try { |
260 |
|
*/ |
261 |
|
public void testToString() { |
262 |
|
assertEquals("[]", new CopyOnWriteArraySet().toString()); |
263 |
< |
CopyOnWriteArraySet full = populatedSet(3); |
263 |
> |
Collection full = populatedSet(3); |
264 |
|
String s = full.toString(); |
265 |
|
for (int i = 0; i < 3; ++i) |
266 |
|
assertTrue(s.contains(String.valueOf(i))); |
272 |
|
* removeAll removes all elements from the given collection |
273 |
|
*/ |
274 |
|
public void testRemoveAll() { |
275 |
< |
CopyOnWriteArraySet full = populatedSet(3); |
276 |
< |
Vector v = new Vector(); |
277 |
< |
v.add(one); |
278 |
< |
v.add(two); |
238 |
< |
full.removeAll(v); |
275 |
> |
Set full = populatedSet(3); |
276 |
> |
assertTrue(full.removeAll(Arrays.asList(one, two))); |
277 |
> |
assertEquals(1, full.size()); |
278 |
> |
assertFalse(full.removeAll(Arrays.asList(one, two))); |
279 |
|
assertEquals(1, full.size()); |
280 |
|
} |
281 |
|
|
283 |
|
* remove removes an element |
284 |
|
*/ |
285 |
|
public void testRemove() { |
286 |
< |
CopyOnWriteArraySet full = populatedSet(3); |
286 |
> |
Collection full = populatedSet(3); |
287 |
|
full.remove(one); |
288 |
|
assertFalse(full.contains(one)); |
289 |
|
assertEquals(2, full.size()); |
293 |
|
* size returns the number of elements |
294 |
|
*/ |
295 |
|
public void testSize() { |
296 |
< |
CopyOnWriteArraySet empty = new CopyOnWriteArraySet(); |
297 |
< |
CopyOnWriteArraySet full = populatedSet(3); |
296 |
> |
Collection empty = new CopyOnWriteArraySet(); |
297 |
> |
Collection full = populatedSet(3); |
298 |
|
assertEquals(3, full.size()); |
299 |
|
assertEquals(0, empty.size()); |
300 |
|
} |
311 |
|
Integer[] elements = new Integer[SIZE]; |
312 |
|
for (int i = 0; i < SIZE; i++) |
313 |
|
elements[i] = i; |
314 |
< |
Collections.shuffle(Arrays.asList(elements)); |
314 |
> |
shuffle(elements); |
315 |
|
Collection<Integer> full = populatedSet(elements); |
316 |
|
|
317 |
|
assertTrue(Arrays.equals(elements, full.toArray())); |
329 |
|
a = new Integer[0]; |
330 |
|
assertSame(a, empty.toArray(a)); |
331 |
|
|
332 |
< |
a = new Integer[SIZE/2]; |
332 |
> |
a = new Integer[SIZE / 2]; |
333 |
|
Arrays.fill(a, 42); |
334 |
|
assertSame(a, empty.toArray(a)); |
335 |
|
assertNull(a[0]); |
339 |
|
Integer[] elements = new Integer[SIZE]; |
340 |
|
for (int i = 0; i < SIZE; i++) |
341 |
|
elements[i] = i; |
342 |
< |
Collections.shuffle(Arrays.asList(elements)); |
342 |
> |
shuffle(elements); |
343 |
|
Collection<Integer> full = populatedSet(elements); |
344 |
|
|
345 |
|
Arrays.fill(a, 42); |
353 |
|
assertSame(a, full.toArray(a)); |
354 |
|
assertTrue(Arrays.equals(elements, a)); |
355 |
|
|
356 |
< |
a = new Integer[2*SIZE]; |
356 |
> |
a = new Integer[2 * SIZE]; |
357 |
|
Arrays.fill(a, 42); |
358 |
|
assertSame(a, full.toArray(a)); |
359 |
|
assertTrue(Arrays.equals(elements, Arrays.copyOf(a, SIZE))); |
367 |
|
* not store the objects inside the set |
368 |
|
*/ |
369 |
|
public void testToArray_ArrayStoreException() { |
370 |
+ |
CopyOnWriteArraySet c = new CopyOnWriteArraySet(); |
371 |
+ |
c.add("zfasdfsdf"); |
372 |
+ |
c.add("asdadasd"); |
373 |
|
try { |
331 |
– |
CopyOnWriteArraySet c = new CopyOnWriteArraySet(); |
332 |
– |
c.add("zfasdfsdf"); |
333 |
– |
c.add("asdadasd"); |
374 |
|
c.toArray(new Long[5]); |
375 |
|
shouldThrow(); |
376 |
|
} catch (ArrayStoreException success) {} |