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/licenses/publicdomain |
5 |
*/ |
6 |
|
7 |
import junit.framework.*; |
8 |
import java.util.*; |
9 |
import java.util.concurrent.*; |
10 |
import java.io.*; |
11 |
|
12 |
public class ConcurrentSkipListSetTest extends JSR166TestCase { |
13 |
public static void main(String[] args) { |
14 |
junit.textui.TestRunner.run(suite()); |
15 |
} |
16 |
public static Test suite() { |
17 |
return new TestSuite(ConcurrentSkipListSetTest.class); |
18 |
} |
19 |
|
20 |
static class MyReverseComparator implements Comparator { |
21 |
public int compare(Object x, Object y) { |
22 |
return ((Comparable)y).compareTo(x); |
23 |
} |
24 |
} |
25 |
|
26 |
/** |
27 |
* Create a set of given size containing consecutive |
28 |
* Integers 0 ... n. |
29 |
*/ |
30 |
private ConcurrentSkipListSet populatedSet(int n) { |
31 |
ConcurrentSkipListSet q = new ConcurrentSkipListSet(); |
32 |
assertTrue(q.isEmpty()); |
33 |
for (int i = n-1; i >= 0; i-=2) |
34 |
assertTrue(q.add(new Integer(i))); |
35 |
for (int i = (n & 1); i < n; i+=2) |
36 |
assertTrue(q.add(new Integer(i))); |
37 |
assertFalse(q.isEmpty()); |
38 |
assertEquals(n, q.size()); |
39 |
return q; |
40 |
} |
41 |
|
42 |
/** |
43 |
* Create set of first 5 ints |
44 |
*/ |
45 |
private ConcurrentSkipListSet set5() { |
46 |
ConcurrentSkipListSet q = new ConcurrentSkipListSet(); |
47 |
assertTrue(q.isEmpty()); |
48 |
q.add(one); |
49 |
q.add(two); |
50 |
q.add(three); |
51 |
q.add(four); |
52 |
q.add(five); |
53 |
assertEquals(5, q.size()); |
54 |
return q; |
55 |
} |
56 |
|
57 |
/** |
58 |
* A new set has unbounded capacity |
59 |
*/ |
60 |
public void testConstructor1() { |
61 |
assertEquals(0, new ConcurrentSkipListSet().size()); |
62 |
} |
63 |
|
64 |
/** |
65 |
* Initializing from null Collection throws NPE |
66 |
*/ |
67 |
public void testConstructor3() { |
68 |
try { |
69 |
ConcurrentSkipListSet q = new ConcurrentSkipListSet((Collection)null); |
70 |
shouldThrow(); |
71 |
} catch (NullPointerException success) {} |
72 |
} |
73 |
|
74 |
/** |
75 |
* Initializing from Collection of null elements throws NPE |
76 |
*/ |
77 |
public void testConstructor4() { |
78 |
try { |
79 |
Integer[] ints = new Integer[SIZE]; |
80 |
ConcurrentSkipListSet q = new ConcurrentSkipListSet(Arrays.asList(ints)); |
81 |
shouldThrow(); |
82 |
} catch (NullPointerException success) {} |
83 |
} |
84 |
|
85 |
/** |
86 |
* Initializing from Collection with some null elements throws NPE |
87 |
*/ |
88 |
public void testConstructor5() { |
89 |
try { |
90 |
Integer[] ints = new Integer[SIZE]; |
91 |
for (int i = 0; i < SIZE-1; ++i) |
92 |
ints[i] = new Integer(i); |
93 |
ConcurrentSkipListSet q = new ConcurrentSkipListSet(Arrays.asList(ints)); |
94 |
shouldThrow(); |
95 |
} catch (NullPointerException success) {} |
96 |
} |
97 |
|
98 |
/** |
99 |
* Set contains all elements of collection used to initialize |
100 |
*/ |
101 |
public void testConstructor6() { |
102 |
Integer[] ints = new Integer[SIZE]; |
103 |
for (int i = 0; i < SIZE; ++i) |
104 |
ints[i] = new Integer(i); |
105 |
ConcurrentSkipListSet q = new ConcurrentSkipListSet(Arrays.asList(ints)); |
106 |
for (int i = 0; i < SIZE; ++i) |
107 |
assertEquals(ints[i], q.pollFirst()); |
108 |
} |
109 |
|
110 |
/** |
111 |
* The comparator used in constructor is used |
112 |
*/ |
113 |
public void testConstructor7() { |
114 |
MyReverseComparator cmp = new MyReverseComparator(); |
115 |
ConcurrentSkipListSet q = new ConcurrentSkipListSet(cmp); |
116 |
assertEquals(cmp, q.comparator()); |
117 |
Integer[] ints = new Integer[SIZE]; |
118 |
for (int i = 0; i < SIZE; ++i) |
119 |
ints[i] = new Integer(i); |
120 |
q.addAll(Arrays.asList(ints)); |
121 |
for (int i = SIZE-1; i >= 0; --i) |
122 |
assertEquals(ints[i], q.pollFirst()); |
123 |
} |
124 |
|
125 |
/** |
126 |
* isEmpty is true before add, false after |
127 |
*/ |
128 |
public void testEmpty() { |
129 |
ConcurrentSkipListSet q = new ConcurrentSkipListSet(); |
130 |
assertTrue(q.isEmpty()); |
131 |
q.add(new Integer(1)); |
132 |
assertFalse(q.isEmpty()); |
133 |
q.add(new Integer(2)); |
134 |
q.pollFirst(); |
135 |
q.pollFirst(); |
136 |
assertTrue(q.isEmpty()); |
137 |
} |
138 |
|
139 |
/** |
140 |
* size changes when elements added and removed |
141 |
*/ |
142 |
public void testSize() { |
143 |
ConcurrentSkipListSet q = populatedSet(SIZE); |
144 |
for (int i = 0; i < SIZE; ++i) { |
145 |
assertEquals(SIZE-i, q.size()); |
146 |
q.pollFirst(); |
147 |
} |
148 |
for (int i = 0; i < SIZE; ++i) { |
149 |
assertEquals(i, q.size()); |
150 |
q.add(new Integer(i)); |
151 |
} |
152 |
} |
153 |
|
154 |
/** |
155 |
* add(null) throws NPE |
156 |
*/ |
157 |
public void testAddNull() { |
158 |
try { |
159 |
ConcurrentSkipListSet q = new ConcurrentSkipListSet(); |
160 |
q.add(null); |
161 |
shouldThrow(); |
162 |
} catch (NullPointerException success) {} |
163 |
} |
164 |
|
165 |
/** |
166 |
* Add of comparable element succeeds |
167 |
*/ |
168 |
public void testAdd() { |
169 |
ConcurrentSkipListSet q = new ConcurrentSkipListSet(); |
170 |
assertTrue(q.add(zero)); |
171 |
assertTrue(q.add(one)); |
172 |
} |
173 |
|
174 |
/** |
175 |
* Add of duplicate element fails |
176 |
*/ |
177 |
public void testAddDup() { |
178 |
ConcurrentSkipListSet q = new ConcurrentSkipListSet(); |
179 |
assertTrue(q.add(zero)); |
180 |
assertFalse(q.add(zero)); |
181 |
} |
182 |
|
183 |
/** |
184 |
* Add of non-Comparable throws CCE |
185 |
*/ |
186 |
public void testAddNonComparable() { |
187 |
try { |
188 |
ConcurrentSkipListSet q = new ConcurrentSkipListSet(); |
189 |
q.add(new Object()); |
190 |
q.add(new Object()); |
191 |
q.add(new Object()); |
192 |
shouldThrow(); |
193 |
} catch (ClassCastException success) {} |
194 |
} |
195 |
|
196 |
/** |
197 |
* addAll(null) throws NPE |
198 |
*/ |
199 |
public void testAddAll1() { |
200 |
try { |
201 |
ConcurrentSkipListSet q = new ConcurrentSkipListSet(); |
202 |
q.addAll(null); |
203 |
shouldThrow(); |
204 |
} catch (NullPointerException success) {} |
205 |
} |
206 |
|
207 |
/** |
208 |
* addAll of a collection with null elements throws NPE |
209 |
*/ |
210 |
public void testAddAll2() { |
211 |
try { |
212 |
ConcurrentSkipListSet q = new ConcurrentSkipListSet(); |
213 |
Integer[] ints = new Integer[SIZE]; |
214 |
q.addAll(Arrays.asList(ints)); |
215 |
shouldThrow(); |
216 |
} catch (NullPointerException success) {} |
217 |
} |
218 |
|
219 |
/** |
220 |
* addAll of a collection with any null elements throws NPE after |
221 |
* possibly adding some elements |
222 |
*/ |
223 |
public void testAddAll3() { |
224 |
try { |
225 |
ConcurrentSkipListSet q = new ConcurrentSkipListSet(); |
226 |
Integer[] ints = new Integer[SIZE]; |
227 |
for (int i = 0; i < SIZE-1; ++i) |
228 |
ints[i] = new Integer(i); |
229 |
q.addAll(Arrays.asList(ints)); |
230 |
shouldThrow(); |
231 |
} catch (NullPointerException success) {} |
232 |
} |
233 |
|
234 |
/** |
235 |
* Set contains all elements of successful addAll |
236 |
*/ |
237 |
public void testAddAll5() { |
238 |
Integer[] empty = new Integer[0]; |
239 |
Integer[] ints = new Integer[SIZE]; |
240 |
for (int i = 0; i < SIZE; ++i) |
241 |
ints[i] = new Integer(SIZE-1-i); |
242 |
ConcurrentSkipListSet q = new ConcurrentSkipListSet(); |
243 |
assertFalse(q.addAll(Arrays.asList(empty))); |
244 |
assertTrue(q.addAll(Arrays.asList(ints))); |
245 |
for (int i = 0; i < SIZE; ++i) |
246 |
assertEquals(i, q.pollFirst()); |
247 |
} |
248 |
|
249 |
/** |
250 |
* pollFirst succeeds unless empty |
251 |
*/ |
252 |
public void testPollFirst() { |
253 |
ConcurrentSkipListSet q = populatedSet(SIZE); |
254 |
for (int i = 0; i < SIZE; ++i) { |
255 |
assertEquals(i, q.pollFirst()); |
256 |
} |
257 |
assertNull(q.pollFirst()); |
258 |
} |
259 |
|
260 |
/** |
261 |
* pollLast succeeds unless empty |
262 |
*/ |
263 |
public void testPollLast() { |
264 |
ConcurrentSkipListSet q = populatedSet(SIZE); |
265 |
for (int i = SIZE-1; i >= 0; --i) { |
266 |
assertEquals(i, q.pollLast()); |
267 |
} |
268 |
assertNull(q.pollFirst()); |
269 |
} |
270 |
|
271 |
|
272 |
/** |
273 |
* remove(x) removes x and returns true if present |
274 |
*/ |
275 |
public void testRemoveElement() { |
276 |
ConcurrentSkipListSet q = populatedSet(SIZE); |
277 |
for (int i = 1; i < SIZE; i+=2) { |
278 |
assertTrue(q.remove(new Integer(i))); |
279 |
} |
280 |
for (int i = 0; i < SIZE; i+=2) { |
281 |
assertTrue(q.remove(new Integer(i))); |
282 |
assertFalse(q.remove(new Integer(i+1))); |
283 |
} |
284 |
assertTrue(q.isEmpty()); |
285 |
} |
286 |
|
287 |
/** |
288 |
* contains(x) reports true when elements added but not yet removed |
289 |
*/ |
290 |
public void testContains() { |
291 |
ConcurrentSkipListSet q = populatedSet(SIZE); |
292 |
for (int i = 0; i < SIZE; ++i) { |
293 |
assertTrue(q.contains(new Integer(i))); |
294 |
q.pollFirst(); |
295 |
assertFalse(q.contains(new Integer(i))); |
296 |
} |
297 |
} |
298 |
|
299 |
/** |
300 |
* clear removes all elements |
301 |
*/ |
302 |
public void testClear() { |
303 |
ConcurrentSkipListSet q = populatedSet(SIZE); |
304 |
q.clear(); |
305 |
assertTrue(q.isEmpty()); |
306 |
assertEquals(0, q.size()); |
307 |
q.add(new Integer(1)); |
308 |
assertFalse(q.isEmpty()); |
309 |
q.clear(); |
310 |
assertTrue(q.isEmpty()); |
311 |
} |
312 |
|
313 |
/** |
314 |
* containsAll(c) is true when c contains a subset of elements |
315 |
*/ |
316 |
public void testContainsAll() { |
317 |
ConcurrentSkipListSet q = populatedSet(SIZE); |
318 |
ConcurrentSkipListSet p = new ConcurrentSkipListSet(); |
319 |
for (int i = 0; i < SIZE; ++i) { |
320 |
assertTrue(q.containsAll(p)); |
321 |
assertFalse(p.containsAll(q)); |
322 |
p.add(new Integer(i)); |
323 |
} |
324 |
assertTrue(p.containsAll(q)); |
325 |
} |
326 |
|
327 |
/** |
328 |
* retainAll(c) retains only those elements of c and reports true if changed |
329 |
*/ |
330 |
public void testRetainAll() { |
331 |
ConcurrentSkipListSet q = populatedSet(SIZE); |
332 |
ConcurrentSkipListSet p = populatedSet(SIZE); |
333 |
for (int i = 0; i < SIZE; ++i) { |
334 |
boolean changed = q.retainAll(p); |
335 |
if (i == 0) |
336 |
assertFalse(changed); |
337 |
else |
338 |
assertTrue(changed); |
339 |
|
340 |
assertTrue(q.containsAll(p)); |
341 |
assertEquals(SIZE-i, q.size()); |
342 |
p.pollFirst(); |
343 |
} |
344 |
} |
345 |
|
346 |
/** |
347 |
* removeAll(c) removes only those elements of c and reports true if changed |
348 |
*/ |
349 |
public void testRemoveAll() { |
350 |
for (int i = 1; i < SIZE; ++i) { |
351 |
ConcurrentSkipListSet q = populatedSet(SIZE); |
352 |
ConcurrentSkipListSet p = populatedSet(i); |
353 |
assertTrue(q.removeAll(p)); |
354 |
assertEquals(SIZE-i, q.size()); |
355 |
for (int j = 0; j < i; ++j) { |
356 |
Integer I = (Integer)(p.pollFirst()); |
357 |
assertFalse(q.contains(I)); |
358 |
} |
359 |
} |
360 |
} |
361 |
|
362 |
|
363 |
|
364 |
/** |
365 |
* lower returns preceding element |
366 |
*/ |
367 |
public void testLower() { |
368 |
ConcurrentSkipListSet q = set5(); |
369 |
Object e1 = q.lower(three); |
370 |
assertEquals(two, e1); |
371 |
|
372 |
Object e2 = q.lower(six); |
373 |
assertEquals(five, e2); |
374 |
|
375 |
Object e3 = q.lower(one); |
376 |
assertNull(e3); |
377 |
|
378 |
Object e4 = q.lower(zero); |
379 |
assertNull(e4); |
380 |
} |
381 |
|
382 |
/** |
383 |
* higher returns next element |
384 |
*/ |
385 |
public void testHigher() { |
386 |
ConcurrentSkipListSet q = set5(); |
387 |
Object e1 = q.higher(three); |
388 |
assertEquals(four, e1); |
389 |
|
390 |
Object e2 = q.higher(zero); |
391 |
assertEquals(one, e2); |
392 |
|
393 |
Object e3 = q.higher(five); |
394 |
assertNull(e3); |
395 |
|
396 |
Object e4 = q.higher(six); |
397 |
assertNull(e4); |
398 |
} |
399 |
|
400 |
/** |
401 |
* floor returns preceding element |
402 |
*/ |
403 |
public void testFloor() { |
404 |
ConcurrentSkipListSet q = set5(); |
405 |
Object e1 = q.floor(three); |
406 |
assertEquals(three, e1); |
407 |
|
408 |
Object e2 = q.floor(six); |
409 |
assertEquals(five, e2); |
410 |
|
411 |
Object e3 = q.floor(one); |
412 |
assertEquals(one, e3); |
413 |
|
414 |
Object e4 = q.floor(zero); |
415 |
assertNull(e4); |
416 |
} |
417 |
|
418 |
/** |
419 |
* ceiling returns next element |
420 |
*/ |
421 |
public void testCeiling() { |
422 |
ConcurrentSkipListSet q = set5(); |
423 |
Object e1 = q.ceiling(three); |
424 |
assertEquals(three, e1); |
425 |
|
426 |
Object e2 = q.ceiling(zero); |
427 |
assertEquals(one, e2); |
428 |
|
429 |
Object e3 = q.ceiling(five); |
430 |
assertEquals(five, e3); |
431 |
|
432 |
Object e4 = q.ceiling(six); |
433 |
assertNull(e4); |
434 |
} |
435 |
|
436 |
/** |
437 |
* toArray contains all elements |
438 |
*/ |
439 |
public void testToArray() { |
440 |
ConcurrentSkipListSet q = populatedSet(SIZE); |
441 |
Object[] o = q.toArray(); |
442 |
Arrays.sort(o); |
443 |
for (int i = 0; i < o.length; i++) |
444 |
assertEquals(o[i], q.pollFirst()); |
445 |
} |
446 |
|
447 |
/** |
448 |
* toArray(a) contains all elements |
449 |
*/ |
450 |
public void testToArray2() { |
451 |
ConcurrentSkipListSet q = populatedSet(SIZE); |
452 |
Integer[] ints = new Integer[SIZE]; |
453 |
ints = (Integer[])q.toArray(ints); |
454 |
Arrays.sort(ints); |
455 |
for (int i = 0; i < ints.length; i++) |
456 |
assertEquals(ints[i], q.pollFirst()); |
457 |
} |
458 |
|
459 |
/** |
460 |
* iterator iterates through all elements |
461 |
*/ |
462 |
public void testIterator() { |
463 |
ConcurrentSkipListSet q = populatedSet(SIZE); |
464 |
int i = 0; |
465 |
Iterator it = q.iterator(); |
466 |
while (it.hasNext()) { |
467 |
assertTrue(q.contains(it.next())); |
468 |
++i; |
469 |
} |
470 |
assertEquals(i, SIZE); |
471 |
} |
472 |
|
473 |
/** |
474 |
* iterator of empty set has no elements |
475 |
*/ |
476 |
public void testEmptyIterator() { |
477 |
ConcurrentSkipListSet q = new ConcurrentSkipListSet(); |
478 |
int i = 0; |
479 |
Iterator it = q.iterator(); |
480 |
while (it.hasNext()) { |
481 |
assertTrue(q.contains(it.next())); |
482 |
++i; |
483 |
} |
484 |
assertEquals(i, 0); |
485 |
} |
486 |
|
487 |
/** |
488 |
* iterator.remove removes current element |
489 |
*/ |
490 |
public void testIteratorRemove() { |
491 |
final ConcurrentSkipListSet q = new ConcurrentSkipListSet(); |
492 |
q.add(new Integer(2)); |
493 |
q.add(new Integer(1)); |
494 |
q.add(new Integer(3)); |
495 |
|
496 |
Iterator it = q.iterator(); |
497 |
it.next(); |
498 |
it.remove(); |
499 |
|
500 |
it = q.iterator(); |
501 |
assertEquals(it.next(), new Integer(2)); |
502 |
assertEquals(it.next(), new Integer(3)); |
503 |
assertFalse(it.hasNext()); |
504 |
} |
505 |
|
506 |
|
507 |
/** |
508 |
* toString contains toStrings of elements |
509 |
*/ |
510 |
public void testToString() { |
511 |
ConcurrentSkipListSet q = populatedSet(SIZE); |
512 |
String s = q.toString(); |
513 |
for (int i = 0; i < SIZE; ++i) { |
514 |
assertTrue(s.indexOf(String.valueOf(i)) >= 0); |
515 |
} |
516 |
} |
517 |
|
518 |
/** |
519 |
* A deserialized serialized set has same elements |
520 |
*/ |
521 |
public void testSerialization() throws Exception { |
522 |
ConcurrentSkipListSet q = populatedSet(SIZE); |
523 |
ByteArrayOutputStream bout = new ByteArrayOutputStream(10000); |
524 |
ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout)); |
525 |
out.writeObject(q); |
526 |
out.close(); |
527 |
|
528 |
ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray()); |
529 |
ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin)); |
530 |
ConcurrentSkipListSet r = (ConcurrentSkipListSet)in.readObject(); |
531 |
assertEquals(q.size(), r.size()); |
532 |
while (!q.isEmpty()) |
533 |
assertEquals(q.pollFirst(), r.pollFirst()); |
534 |
} |
535 |
|
536 |
/** |
537 |
* subSet returns set with keys in requested range |
538 |
*/ |
539 |
public void testSubSetContents() { |
540 |
ConcurrentSkipListSet set = set5(); |
541 |
SortedSet sm = set.subSet(two, four); |
542 |
assertEquals(two, sm.first()); |
543 |
assertEquals(three, sm.last()); |
544 |
assertEquals(2, sm.size()); |
545 |
assertFalse(sm.contains(one)); |
546 |
assertTrue(sm.contains(two)); |
547 |
assertTrue(sm.contains(three)); |
548 |
assertFalse(sm.contains(four)); |
549 |
assertFalse(sm.contains(five)); |
550 |
Iterator i = sm.iterator(); |
551 |
Object k; |
552 |
k = (Integer)(i.next()); |
553 |
assertEquals(two, k); |
554 |
k = (Integer)(i.next()); |
555 |
assertEquals(three, k); |
556 |
assertFalse(i.hasNext()); |
557 |
Iterator j = sm.iterator(); |
558 |
j.next(); |
559 |
j.remove(); |
560 |
assertFalse(set.contains(two)); |
561 |
assertEquals(4, set.size()); |
562 |
assertEquals(1, sm.size()); |
563 |
assertEquals(three, sm.first()); |
564 |
assertEquals(three, sm.last()); |
565 |
assertTrue(sm.remove(three)); |
566 |
assertTrue(sm.isEmpty()); |
567 |
assertEquals(3, set.size()); |
568 |
} |
569 |
|
570 |
public void testSubSetContents2() { |
571 |
ConcurrentSkipListSet set = set5(); |
572 |
SortedSet sm = set.subSet(two, three); |
573 |
assertEquals(1, sm.size()); |
574 |
assertEquals(two, sm.first()); |
575 |
assertEquals(two, sm.last()); |
576 |
assertFalse(sm.contains(one)); |
577 |
assertTrue(sm.contains(two)); |
578 |
assertFalse(sm.contains(three)); |
579 |
assertFalse(sm.contains(four)); |
580 |
assertFalse(sm.contains(five)); |
581 |
Iterator i = sm.iterator(); |
582 |
Object k; |
583 |
k = (Integer)(i.next()); |
584 |
assertEquals(two, k); |
585 |
assertFalse(i.hasNext()); |
586 |
Iterator j = sm.iterator(); |
587 |
j.next(); |
588 |
j.remove(); |
589 |
assertFalse(set.contains(two)); |
590 |
assertEquals(4, set.size()); |
591 |
assertEquals(0, sm.size()); |
592 |
assertTrue(sm.isEmpty()); |
593 |
assertFalse(sm.remove(three)); |
594 |
assertEquals(4, set.size()); |
595 |
} |
596 |
|
597 |
/** |
598 |
* headSet returns set with keys in requested range |
599 |
*/ |
600 |
public void testHeadSetContents() { |
601 |
ConcurrentSkipListSet set = set5(); |
602 |
SortedSet sm = set.headSet(four); |
603 |
assertTrue(sm.contains(one)); |
604 |
assertTrue(sm.contains(two)); |
605 |
assertTrue(sm.contains(three)); |
606 |
assertFalse(sm.contains(four)); |
607 |
assertFalse(sm.contains(five)); |
608 |
Iterator i = sm.iterator(); |
609 |
Object k; |
610 |
k = (Integer)(i.next()); |
611 |
assertEquals(one, k); |
612 |
k = (Integer)(i.next()); |
613 |
assertEquals(two, k); |
614 |
k = (Integer)(i.next()); |
615 |
assertEquals(three, k); |
616 |
assertFalse(i.hasNext()); |
617 |
sm.clear(); |
618 |
assertTrue(sm.isEmpty()); |
619 |
assertEquals(2, set.size()); |
620 |
assertEquals(four, set.first()); |
621 |
} |
622 |
|
623 |
/** |
624 |
* tailSet returns set with keys in requested range |
625 |
*/ |
626 |
public void testTailSetContents() { |
627 |
ConcurrentSkipListSet set = set5(); |
628 |
SortedSet sm = set.tailSet(two); |
629 |
assertFalse(sm.contains(one)); |
630 |
assertTrue(sm.contains(two)); |
631 |
assertTrue(sm.contains(three)); |
632 |
assertTrue(sm.contains(four)); |
633 |
assertTrue(sm.contains(five)); |
634 |
Iterator i = sm.iterator(); |
635 |
Object k; |
636 |
k = (Integer)(i.next()); |
637 |
assertEquals(two, k); |
638 |
k = (Integer)(i.next()); |
639 |
assertEquals(three, k); |
640 |
k = (Integer)(i.next()); |
641 |
assertEquals(four, k); |
642 |
k = (Integer)(i.next()); |
643 |
assertEquals(five, k); |
644 |
assertFalse(i.hasNext()); |
645 |
|
646 |
SortedSet ssm = sm.tailSet(four); |
647 |
assertEquals(four, ssm.first()); |
648 |
assertEquals(five, ssm.last()); |
649 |
assertTrue(ssm.remove(four)); |
650 |
assertEquals(1, ssm.size()); |
651 |
assertEquals(3, sm.size()); |
652 |
assertEquals(4, set.size()); |
653 |
} |
654 |
|
655 |
Random rnd = new Random(666); |
656 |
BitSet bs; |
657 |
|
658 |
/** |
659 |
* Subsets of subsets subdivide correctly |
660 |
*/ |
661 |
public void testRecursiveSubSets() throws Exception { |
662 |
int setSize = 1000; |
663 |
Class cl = ConcurrentSkipListSet.class; |
664 |
|
665 |
NavigableSet<Integer> set = newSet(cl); |
666 |
bs = new BitSet(setSize); |
667 |
|
668 |
populate(set, setSize); |
669 |
check(set, 0, setSize - 1, true); |
670 |
check(set.descendingSet(), 0, setSize - 1, false); |
671 |
|
672 |
mutateSet(set, 0, setSize - 1); |
673 |
check(set, 0, setSize - 1, true); |
674 |
check(set.descendingSet(), 0, setSize - 1, false); |
675 |
|
676 |
bashSubSet(set.subSet(0, true, setSize, false), |
677 |
0, setSize - 1, true); |
678 |
} |
679 |
|
680 |
static NavigableSet<Integer> newSet(Class cl) throws Exception { |
681 |
NavigableSet<Integer> result = (NavigableSet<Integer>) cl.newInstance(); |
682 |
assertEquals(result.size(), 0); |
683 |
assertFalse(result.iterator().hasNext()); |
684 |
return result; |
685 |
} |
686 |
|
687 |
void populate(NavigableSet<Integer> set, int limit) { |
688 |
for (int i = 0, n = 2 * limit / 3; i < n; i++) { |
689 |
int element = rnd.nextInt(limit); |
690 |
put(set, element); |
691 |
} |
692 |
} |
693 |
|
694 |
void mutateSet(NavigableSet<Integer> set, int min, int max) { |
695 |
int size = set.size(); |
696 |
int rangeSize = max - min + 1; |
697 |
|
698 |
// Remove a bunch of entries directly |
699 |
for (int i = 0, n = rangeSize / 2; i < n; i++) { |
700 |
remove(set, min - 5 + rnd.nextInt(rangeSize + 10)); |
701 |
} |
702 |
|
703 |
// Remove a bunch of entries with iterator |
704 |
for (Iterator<Integer> it = set.iterator(); it.hasNext(); ) { |
705 |
if (rnd.nextBoolean()) { |
706 |
bs.clear(it.next()); |
707 |
it.remove(); |
708 |
} |
709 |
} |
710 |
|
711 |
// Add entries till we're back to original size |
712 |
while (set.size() < size) { |
713 |
int element = min + rnd.nextInt(rangeSize); |
714 |
assertTrue(element >= min && element<= max); |
715 |
put(set, element); |
716 |
} |
717 |
} |
718 |
|
719 |
void mutateSubSet(NavigableSet<Integer> set, int min, int max) { |
720 |
int size = set.size(); |
721 |
int rangeSize = max - min + 1; |
722 |
|
723 |
// Remove a bunch of entries directly |
724 |
for (int i = 0, n = rangeSize / 2; i < n; i++) { |
725 |
remove(set, min - 5 + rnd.nextInt(rangeSize + 10)); |
726 |
} |
727 |
|
728 |
// Remove a bunch of entries with iterator |
729 |
for (Iterator<Integer> it = set.iterator(); it.hasNext(); ) { |
730 |
if (rnd.nextBoolean()) { |
731 |
bs.clear(it.next()); |
732 |
it.remove(); |
733 |
} |
734 |
} |
735 |
|
736 |
// Add entries till we're back to original size |
737 |
while (set.size() < size) { |
738 |
int element = min - 5 + rnd.nextInt(rangeSize + 10); |
739 |
if (element >= min && element<= max) { |
740 |
put(set, element); |
741 |
} else { |
742 |
try { |
743 |
set.add(element); |
744 |
shouldThrow(); |
745 |
} catch (IllegalArgumentException success) {} |
746 |
} |
747 |
} |
748 |
} |
749 |
|
750 |
void put(NavigableSet<Integer> set, int element) { |
751 |
if (set.add(element)) |
752 |
bs.set(element); |
753 |
} |
754 |
|
755 |
void remove(NavigableSet<Integer> set, int element) { |
756 |
if (set.remove(element)) |
757 |
bs.clear(element); |
758 |
} |
759 |
|
760 |
void bashSubSet(NavigableSet<Integer> set, |
761 |
int min, int max, boolean ascending) { |
762 |
check(set, min, max, ascending); |
763 |
check(set.descendingSet(), min, max, !ascending); |
764 |
|
765 |
mutateSubSet(set, min, max); |
766 |
check(set, min, max, ascending); |
767 |
check(set.descendingSet(), min, max, !ascending); |
768 |
|
769 |
// Recurse |
770 |
if (max - min < 2) |
771 |
return; |
772 |
int midPoint = (min + max) / 2; |
773 |
|
774 |
// headSet - pick direction and endpoint inclusion randomly |
775 |
boolean incl = rnd.nextBoolean(); |
776 |
NavigableSet<Integer> hm = set.headSet(midPoint, incl); |
777 |
if (ascending) { |
778 |
if (rnd.nextBoolean()) |
779 |
bashSubSet(hm, min, midPoint - (incl ? 0 : 1), true); |
780 |
else |
781 |
bashSubSet(hm.descendingSet(), min, midPoint - (incl ? 0 : 1), |
782 |
false); |
783 |
} else { |
784 |
if (rnd.nextBoolean()) |
785 |
bashSubSet(hm, midPoint + (incl ? 0 : 1), max, false); |
786 |
else |
787 |
bashSubSet(hm.descendingSet(), midPoint + (incl ? 0 : 1), max, |
788 |
true); |
789 |
} |
790 |
|
791 |
// tailSet - pick direction and endpoint inclusion randomly |
792 |
incl = rnd.nextBoolean(); |
793 |
NavigableSet<Integer> tm = set.tailSet(midPoint,incl); |
794 |
if (ascending) { |
795 |
if (rnd.nextBoolean()) |
796 |
bashSubSet(tm, midPoint + (incl ? 0 : 1), max, true); |
797 |
else |
798 |
bashSubSet(tm.descendingSet(), midPoint + (incl ? 0 : 1), max, |
799 |
false); |
800 |
} else { |
801 |
if (rnd.nextBoolean()) { |
802 |
bashSubSet(tm, min, midPoint - (incl ? 0 : 1), false); |
803 |
} else { |
804 |
bashSubSet(tm.descendingSet(), min, midPoint - (incl ? 0 : 1), |
805 |
true); |
806 |
} |
807 |
} |
808 |
|
809 |
// subSet - pick direction and endpoint inclusion randomly |
810 |
int rangeSize = max - min + 1; |
811 |
int[] endpoints = new int[2]; |
812 |
endpoints[0] = min + rnd.nextInt(rangeSize); |
813 |
endpoints[1] = min + rnd.nextInt(rangeSize); |
814 |
Arrays.sort(endpoints); |
815 |
boolean lowIncl = rnd.nextBoolean(); |
816 |
boolean highIncl = rnd.nextBoolean(); |
817 |
if (ascending) { |
818 |
NavigableSet<Integer> sm = set.subSet( |
819 |
endpoints[0], lowIncl, endpoints[1], highIncl); |
820 |
if (rnd.nextBoolean()) |
821 |
bashSubSet(sm, endpoints[0] + (lowIncl ? 0 : 1), |
822 |
endpoints[1] - (highIncl ? 0 : 1), true); |
823 |
else |
824 |
bashSubSet(sm.descendingSet(), endpoints[0] + (lowIncl ? 0 : 1), |
825 |
endpoints[1] - (highIncl ? 0 : 1), false); |
826 |
} else { |
827 |
NavigableSet<Integer> sm = set.subSet( |
828 |
endpoints[1], highIncl, endpoints[0], lowIncl); |
829 |
if (rnd.nextBoolean()) |
830 |
bashSubSet(sm, endpoints[0] + (lowIncl ? 0 : 1), |
831 |
endpoints[1] - (highIncl ? 0 : 1), false); |
832 |
else |
833 |
bashSubSet(sm.descendingSet(), endpoints[0] + (lowIncl ? 0 : 1), |
834 |
endpoints[1] - (highIncl ? 0 : 1), true); |
835 |
} |
836 |
} |
837 |
|
838 |
/** |
839 |
* min and max are both inclusive. If max < min, interval is empty. |
840 |
*/ |
841 |
void check(NavigableSet<Integer> set, |
842 |
final int min, final int max, final boolean ascending) { |
843 |
class ReferenceSet { |
844 |
int lower(int element) { |
845 |
return ascending ? |
846 |
lowerAscending(element) : higherAscending(element); |
847 |
} |
848 |
int floor(int element) { |
849 |
return ascending ? |
850 |
floorAscending(element) : ceilingAscending(element); |
851 |
} |
852 |
int ceiling(int element) { |
853 |
return ascending ? |
854 |
ceilingAscending(element) : floorAscending(element); |
855 |
} |
856 |
int higher(int element) { |
857 |
return ascending ? |
858 |
higherAscending(element) : lowerAscending(element); |
859 |
} |
860 |
int first() { |
861 |
return ascending ? firstAscending() : lastAscending(); |
862 |
} |
863 |
int last() { |
864 |
return ascending ? lastAscending() : firstAscending(); |
865 |
} |
866 |
int lowerAscending(int element) { |
867 |
return floorAscending(element - 1); |
868 |
} |
869 |
int floorAscending(int element) { |
870 |
if (element < min) |
871 |
return -1; |
872 |
else if (element > max) |
873 |
element = max; |
874 |
|
875 |
// BitSet should support this! Test would run much faster |
876 |
while (element >= min) { |
877 |
if (bs.get(element)) |
878 |
return(element); |
879 |
element--; |
880 |
} |
881 |
return -1; |
882 |
} |
883 |
int ceilingAscending(int element) { |
884 |
if (element < min) |
885 |
element = min; |
886 |
else if (element > max) |
887 |
return -1; |
888 |
int result = bs.nextSetBit(element); |
889 |
return result > max ? -1 : result; |
890 |
} |
891 |
int higherAscending(int element) { |
892 |
return ceilingAscending(element + 1); |
893 |
} |
894 |
private int firstAscending() { |
895 |
int result = ceilingAscending(min); |
896 |
return result > max ? -1 : result; |
897 |
} |
898 |
private int lastAscending() { |
899 |
int result = floorAscending(max); |
900 |
return result < min ? -1 : result; |
901 |
} |
902 |
} |
903 |
ReferenceSet rs = new ReferenceSet(); |
904 |
|
905 |
// Test contents using containsElement |
906 |
int size = 0; |
907 |
for (int i = min; i <= max; i++) { |
908 |
boolean bsContainsI = bs.get(i); |
909 |
assertEquals(bsContainsI, set.contains(i)); |
910 |
if (bsContainsI) |
911 |
size++; |
912 |
} |
913 |
assertEquals(set.size(), size); |
914 |
|
915 |
// Test contents using contains elementSet iterator |
916 |
int size2 = 0; |
917 |
int previousElement = -1; |
918 |
for (int element : set) { |
919 |
assertTrue(bs.get(element)); |
920 |
size2++; |
921 |
assertTrue(previousElement < 0 || (ascending ? |
922 |
element - previousElement > 0 : element - previousElement < 0)); |
923 |
previousElement = element; |
924 |
} |
925 |
assertEquals(size2, size); |
926 |
|
927 |
// Test navigation ops |
928 |
for (int element = min - 1; element <= max + 1; element++) { |
929 |
assertEq(set.lower(element), rs.lower(element)); |
930 |
assertEq(set.floor(element), rs.floor(element)); |
931 |
assertEq(set.higher(element), rs.higher(element)); |
932 |
assertEq(set.ceiling(element), rs.ceiling(element)); |
933 |
} |
934 |
|
935 |
// Test extrema |
936 |
if (set.size() != 0) { |
937 |
assertEq(set.first(), rs.first()); |
938 |
assertEq(set.last(), rs.last()); |
939 |
} else { |
940 |
assertEq(rs.first(), -1); |
941 |
assertEq(rs.last(), -1); |
942 |
try { |
943 |
set.first(); |
944 |
shouldThrow(); |
945 |
} catch (NoSuchElementException success) {} |
946 |
try { |
947 |
set.last(); |
948 |
shouldThrow(); |
949 |
} catch (NoSuchElementException success) {} |
950 |
} |
951 |
} |
952 |
|
953 |
static void assertEq(Integer i, int j) { |
954 |
if (i == null) |
955 |
assertEquals(j, -1); |
956 |
else |
957 |
assertEquals((int) i, j); |
958 |
} |
959 |
|
960 |
static boolean eq(Integer i, int j) { |
961 |
return i == null ? j == -1 : i == j; |
962 |
} |
963 |
|
964 |
} |