| 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 |
| 4 |
> |
* http://creativecommons.org/publicdomain/zero/1.0/ |
| 5 |
|
*/ |
| 6 |
|
|
| 7 |
< |
import junit.framework.*; |
| 8 |
< |
import java.util.*; |
| 9 |
< |
import java.util.concurrent.*; |
| 10 |
< |
import java.io.*; |
| 7 |
> |
import java.util.Arrays; |
| 8 |
> |
import java.util.BitSet; |
| 9 |
> |
import java.util.Collection; |
| 10 |
> |
import java.util.Comparator; |
| 11 |
> |
import java.util.Iterator; |
| 12 |
> |
import java.util.NavigableSet; |
| 13 |
> |
import java.util.NoSuchElementException; |
| 14 |
> |
import java.util.Random; |
| 15 |
> |
import java.util.Set; |
| 16 |
> |
import java.util.SortedSet; |
| 17 |
> |
import java.util.TreeSet; |
| 18 |
> |
|
| 19 |
> |
import junit.framework.Test; |
| 20 |
> |
import junit.framework.TestSuite; |
| 21 |
|
|
| 22 |
|
public class TreeSetTest extends JSR166TestCase { |
| 23 |
|
public static void main(String[] args) { |
| 24 |
< |
junit.textui.TestRunner.run (suite()); |
| 24 |
> |
junit.textui.TestRunner.run(suite()); |
| 25 |
|
} |
| 26 |
|
public static Test suite() { |
| 27 |
< |
return new TestSuite(TreeSetTest.class); |
| 27 |
> |
return new TestSuite(TreeSetTest.class); |
| 28 |
|
} |
| 29 |
|
|
| 30 |
< |
static class MyReverseComparator implements Comparator { |
| 30 |
> |
static class MyReverseComparator implements Comparator { |
| 31 |
|
public int compare(Object x, Object y) { |
| 32 |
< |
int i = ((Integer)x).intValue(); |
| 23 |
< |
int j = ((Integer)y).intValue(); |
| 24 |
< |
if (i < j) return 1; |
| 25 |
< |
if (i > j) return -1; |
| 26 |
< |
return 0; |
| 32 |
> |
return ((Comparable)y).compareTo(x); |
| 33 |
|
} |
| 34 |
|
} |
| 35 |
|
|
| 39 |
|
static final int SIZE = 20; |
| 40 |
|
|
| 41 |
|
/** |
| 42 |
< |
* Create a set of given size containing consecutive |
| 42 |
> |
* Returns a new set of given size containing consecutive |
| 43 |
|
* Integers 0 ... n. |
| 44 |
|
*/ |
| 45 |
< |
private TreeSet populatedSet(int n) { |
| 46 |
< |
TreeSet q = new TreeSet(); |
| 45 |
> |
private TreeSet<Integer> populatedSet(int n) { |
| 46 |
> |
TreeSet<Integer> q = new TreeSet<Integer>(); |
| 47 |
|
assertTrue(q.isEmpty()); |
| 48 |
< |
for(int i = n-1; i >= 0; i-=2) |
| 49 |
< |
assertTrue(q.add(new Integer(i))); |
| 50 |
< |
for(int i = (n & 1); i < n; i+=2) |
| 51 |
< |
assertTrue(q.add(new Integer(i))); |
| 48 |
> |
for (int i = n-1; i >= 0; i -= 2) |
| 49 |
> |
assertTrue(q.add(new Integer(i))); |
| 50 |
> |
for (int i = (n & 1); i < n; i += 2) |
| 51 |
> |
assertTrue(q.add(new Integer(i))); |
| 52 |
|
assertFalse(q.isEmpty()); |
| 53 |
< |
assertEquals(n, q.size()); |
| 53 |
> |
assertEquals(n, q.size()); |
| 54 |
|
return q; |
| 55 |
|
} |
| 56 |
|
|
| 57 |
|
/** |
| 58 |
< |
* Create set of first 5 ints |
| 58 |
> |
* Returns a new set of first 5 ints. |
| 59 |
|
*/ |
| 60 |
|
private TreeSet set5() { |
| 61 |
|
TreeSet q = new TreeSet(); |
| 65 |
|
q.add(three); |
| 66 |
|
q.add(four); |
| 67 |
|
q.add(five); |
| 68 |
< |
assertEquals(5, q.size()); |
| 68 |
> |
assertEquals(5, q.size()); |
| 69 |
|
return q; |
| 70 |
|
} |
| 71 |
< |
|
| 71 |
> |
|
| 72 |
|
/** |
| 73 |
|
* A new set has unbounded capacity |
| 74 |
|
*/ |
| 81 |
|
*/ |
| 82 |
|
public void testConstructor3() { |
| 83 |
|
try { |
| 84 |
< |
TreeSet q = new TreeSet((Collection)null); |
| 84 |
> |
new TreeSet((Collection)null); |
| 85 |
|
shouldThrow(); |
| 86 |
< |
} |
| 81 |
< |
catch (NullPointerException success) {} |
| 86 |
> |
} catch (NullPointerException success) {} |
| 87 |
|
} |
| 88 |
|
|
| 89 |
|
/** |
| 92 |
|
public void testConstructor4() { |
| 93 |
|
try { |
| 94 |
|
Integer[] ints = new Integer[SIZE]; |
| 95 |
< |
TreeSet q = new TreeSet(Arrays.asList(ints)); |
| 95 |
> |
new TreeSet(Arrays.asList(ints)); |
| 96 |
|
shouldThrow(); |
| 97 |
< |
} |
| 93 |
< |
catch (NullPointerException success) {} |
| 97 |
> |
} catch (NullPointerException success) {} |
| 98 |
|
} |
| 99 |
|
|
| 100 |
|
/** |
| 105 |
|
Integer[] ints = new Integer[SIZE]; |
| 106 |
|
for (int i = 0; i < SIZE-1; ++i) |
| 107 |
|
ints[i] = new Integer(i); |
| 108 |
< |
TreeSet q = new TreeSet(Arrays.asList(ints)); |
| 108 |
> |
new TreeSet(Arrays.asList(ints)); |
| 109 |
|
shouldThrow(); |
| 110 |
< |
} |
| 107 |
< |
catch (NullPointerException success) {} |
| 110 |
> |
} catch (NullPointerException success) {} |
| 111 |
|
} |
| 112 |
|
|
| 113 |
|
/** |
| 114 |
|
* Set contains all elements of collection used to initialize |
| 115 |
|
*/ |
| 116 |
|
public void testConstructor6() { |
| 117 |
< |
try { |
| 118 |
< |
Integer[] ints = new Integer[SIZE]; |
| 119 |
< |
for (int i = 0; i < SIZE; ++i) |
| 120 |
< |
ints[i] = new Integer(i); |
| 121 |
< |
TreeSet q = new TreeSet(Arrays.asList(ints)); |
| 122 |
< |
for (int i = 0; i < SIZE; ++i) |
| 120 |
< |
assertEquals(ints[i], q.pollFirst()); |
| 121 |
< |
} |
| 122 |
< |
finally {} |
| 117 |
> |
Integer[] ints = new Integer[SIZE]; |
| 118 |
> |
for (int i = 0; i < SIZE; ++i) |
| 119 |
> |
ints[i] = new Integer(i); |
| 120 |
> |
TreeSet q = new TreeSet(Arrays.asList(ints)); |
| 121 |
> |
for (int i = 0; i < SIZE; ++i) |
| 122 |
> |
assertEquals(ints[i], q.pollFirst()); |
| 123 |
|
} |
| 124 |
|
|
| 125 |
|
/** |
| 126 |
|
* The comparator used in constructor is used |
| 127 |
|
*/ |
| 128 |
|
public void testConstructor7() { |
| 129 |
< |
try { |
| 130 |
< |
MyReverseComparator cmp = new MyReverseComparator(); |
| 131 |
< |
TreeSet q = new TreeSet(cmp); |
| 132 |
< |
assertEquals(cmp, q.comparator()); |
| 133 |
< |
Integer[] ints = new Integer[SIZE]; |
| 134 |
< |
for (int i = 0; i < SIZE; ++i) |
| 135 |
< |
ints[i] = new Integer(i); |
| 136 |
< |
q.addAll(Arrays.asList(ints)); |
| 137 |
< |
for (int i = SIZE-1; i >= 0; --i) |
| 138 |
< |
assertEquals(ints[i], q.pollFirst()); |
| 139 |
< |
} |
| 140 |
< |
finally {} |
| 129 |
> |
MyReverseComparator cmp = new MyReverseComparator(); |
| 130 |
> |
TreeSet q = new TreeSet(cmp); |
| 131 |
> |
assertEquals(cmp, q.comparator()); |
| 132 |
> |
Integer[] ints = new Integer[SIZE]; |
| 133 |
> |
for (int i = 0; i < SIZE; ++i) |
| 134 |
> |
ints[i] = new Integer(i); |
| 135 |
> |
q.addAll(Arrays.asList(ints)); |
| 136 |
> |
for (int i = SIZE-1; i >= 0; --i) |
| 137 |
> |
assertEquals(ints[i], q.pollFirst()); |
| 138 |
|
} |
| 139 |
|
|
| 140 |
|
/** |
| 170 |
|
* add(null) throws NPE if nonempty |
| 171 |
|
*/ |
| 172 |
|
public void testAddNull() { |
| 173 |
< |
try { |
| 173 |
> |
try { |
| 174 |
|
TreeSet q = populatedSet(SIZE); |
| 175 |
|
q.add(null); |
| 176 |
|
shouldThrow(); |
| 177 |
< |
} catch (NullPointerException success) { } |
| 177 |
> |
} catch (NullPointerException success) {} |
| 178 |
|
} |
| 179 |
|
|
| 180 |
|
/** |
| 205 |
|
q.add(new Object()); |
| 206 |
|
q.add(new Object()); |
| 207 |
|
shouldThrow(); |
| 208 |
< |
} |
| 212 |
< |
catch(ClassCastException success) {} |
| 208 |
> |
} catch (ClassCastException success) {} |
| 209 |
|
} |
| 210 |
|
|
| 211 |
|
/** |
| 216 |
|
TreeSet q = new TreeSet(); |
| 217 |
|
q.addAll(null); |
| 218 |
|
shouldThrow(); |
| 219 |
< |
} |
| 224 |
< |
catch (NullPointerException success) {} |
| 219 |
> |
} catch (NullPointerException success) {} |
| 220 |
|
} |
| 221 |
+ |
|
| 222 |
|
/** |
| 223 |
|
* addAll of a collection with null elements throws NPE |
| 224 |
|
*/ |
| 228 |
|
Integer[] ints = new Integer[SIZE]; |
| 229 |
|
q.addAll(Arrays.asList(ints)); |
| 230 |
|
shouldThrow(); |
| 231 |
< |
} |
| 236 |
< |
catch (NullPointerException success) {} |
| 231 |
> |
} catch (NullPointerException success) {} |
| 232 |
|
} |
| 233 |
+ |
|
| 234 |
|
/** |
| 235 |
|
* addAll of a collection with any null elements throws NPE after |
| 236 |
|
* possibly adding some elements |
| 243 |
|
ints[i] = new Integer(i); |
| 244 |
|
q.addAll(Arrays.asList(ints)); |
| 245 |
|
shouldThrow(); |
| 246 |
< |
} |
| 251 |
< |
catch (NullPointerException success) {} |
| 246 |
> |
} catch (NullPointerException success) {} |
| 247 |
|
} |
| 248 |
|
|
| 249 |
|
/** |
| 250 |
|
* Set contains all elements of successful addAll |
| 251 |
|
*/ |
| 252 |
|
public void testAddAll5() { |
| 253 |
< |
try { |
| 254 |
< |
Integer[] empty = new Integer[0]; |
| 255 |
< |
Integer[] ints = new Integer[SIZE]; |
| 256 |
< |
for (int i = 0; i < SIZE; ++i) |
| 257 |
< |
ints[i] = new Integer(SIZE-1-i); |
| 258 |
< |
TreeSet q = new TreeSet(); |
| 259 |
< |
assertFalse(q.addAll(Arrays.asList(empty))); |
| 260 |
< |
assertTrue(q.addAll(Arrays.asList(ints))); |
| 261 |
< |
for (int i = 0; i < SIZE; ++i) |
| 267 |
< |
assertEquals(new Integer(i), q.pollFirst()); |
| 268 |
< |
} |
| 269 |
< |
finally {} |
| 253 |
> |
Integer[] empty = new Integer[0]; |
| 254 |
> |
Integer[] ints = new Integer[SIZE]; |
| 255 |
> |
for (int i = 0; i < SIZE; ++i) |
| 256 |
> |
ints[i] = new Integer(SIZE-1-i); |
| 257 |
> |
TreeSet q = new TreeSet(); |
| 258 |
> |
assertFalse(q.addAll(Arrays.asList(empty))); |
| 259 |
> |
assertTrue(q.addAll(Arrays.asList(ints))); |
| 260 |
> |
for (int i = 0; i < SIZE; ++i) |
| 261 |
> |
assertEquals(new Integer(i), q.pollFirst()); |
| 262 |
|
} |
| 263 |
|
|
| 264 |
|
/** |
| 267 |
|
public void testPollFirst() { |
| 268 |
|
TreeSet q = populatedSet(SIZE); |
| 269 |
|
for (int i = 0; i < SIZE; ++i) { |
| 270 |
< |
assertEquals(i, ((Integer)q.pollFirst()).intValue()); |
| 270 |
> |
assertEquals(i, q.pollFirst()); |
| 271 |
|
} |
| 272 |
< |
assertNull(q.pollFirst()); |
| 272 |
> |
assertNull(q.pollFirst()); |
| 273 |
|
} |
| 274 |
|
|
| 275 |
|
/** |
| 278 |
|
public void testPollLast() { |
| 279 |
|
TreeSet q = populatedSet(SIZE); |
| 280 |
|
for (int i = SIZE-1; i >= 0; --i) { |
| 281 |
< |
assertEquals(i, ((Integer)q.pollLast()).intValue()); |
| 281 |
> |
assertEquals(i, q.pollLast()); |
| 282 |
|
} |
| 283 |
< |
assertNull(q.pollFirst()); |
| 283 |
> |
assertNull(q.pollFirst()); |
| 284 |
|
} |
| 285 |
|
|
| 294 |
– |
|
| 286 |
|
/** |
| 287 |
|
* remove(x) removes x and returns true if present |
| 288 |
|
*/ |
| 289 |
|
public void testRemoveElement() { |
| 290 |
|
TreeSet q = populatedSet(SIZE); |
| 291 |
< |
for (int i = 1; i < SIZE; i+=2) { |
| 292 |
< |
assertTrue(q.remove(new Integer(i))); |
| 293 |
< |
} |
| 294 |
< |
for (int i = 0; i < SIZE; i+=2) { |
| 295 |
< |
assertTrue(q.remove(new Integer(i))); |
| 296 |
< |
assertFalse(q.remove(new Integer(i+1))); |
| 291 |
> |
for (int i = 1; i < SIZE; i += 2) { |
| 292 |
> |
assertTrue(q.contains(i)); |
| 293 |
> |
assertTrue(q.remove(i)); |
| 294 |
> |
assertFalse(q.contains(i)); |
| 295 |
> |
assertTrue(q.contains(i-1)); |
| 296 |
> |
} |
| 297 |
> |
for (int i = 0; i < SIZE; i += 2) { |
| 298 |
> |
assertTrue(q.contains(i)); |
| 299 |
> |
assertTrue(q.remove(i)); |
| 300 |
> |
assertFalse(q.contains(i)); |
| 301 |
> |
assertFalse(q.remove(i+1)); |
| 302 |
> |
assertFalse(q.contains(i+1)); |
| 303 |
|
} |
| 304 |
|
assertTrue(q.isEmpty()); |
| 305 |
|
} |
| 306 |
< |
|
| 306 |
> |
|
| 307 |
|
/** |
| 308 |
|
* contains(x) reports true when elements added but not yet removed |
| 309 |
|
*/ |
| 373 |
|
assertTrue(q.removeAll(p)); |
| 374 |
|
assertEquals(SIZE-i, q.size()); |
| 375 |
|
for (int j = 0; j < i; ++j) { |
| 376 |
< |
Integer I = (Integer)(p.pollFirst()); |
| 377 |
< |
assertFalse(q.contains(I)); |
| 376 |
> |
Integer x = (Integer)(p.pollFirst()); |
| 377 |
> |
assertFalse(q.contains(x)); |
| 378 |
|
} |
| 379 |
|
} |
| 380 |
|
} |
| 381 |
|
|
| 385 |
– |
|
| 386 |
– |
|
| 382 |
|
/** |
| 383 |
|
* lower returns preceding element |
| 384 |
|
*/ |
| 395 |
|
|
| 396 |
|
Object e4 = q.lower(zero); |
| 397 |
|
assertNull(e4); |
| 403 |
– |
|
| 398 |
|
} |
| 399 |
|
|
| 400 |
|
/** |
| 413 |
|
|
| 414 |
|
Object e4 = q.higher(six); |
| 415 |
|
assertNull(e4); |
| 422 |
– |
|
| 416 |
|
} |
| 417 |
|
|
| 418 |
|
/** |
| 431 |
|
|
| 432 |
|
Object e4 = q.floor(zero); |
| 433 |
|
assertNull(e4); |
| 441 |
– |
|
| 434 |
|
} |
| 435 |
|
|
| 436 |
|
/** |
| 449 |
|
|
| 450 |
|
Object e4 = q.ceiling(six); |
| 451 |
|
assertNull(e4); |
| 460 |
– |
|
| 452 |
|
} |
| 453 |
|
|
| 454 |
|
/** |
| 455 |
< |
* toArray contains all elements |
| 455 |
> |
* toArray contains all elements in sorted order |
| 456 |
|
*/ |
| 457 |
|
public void testToArray() { |
| 458 |
|
TreeSet q = populatedSet(SIZE); |
| 459 |
< |
Object[] o = q.toArray(); |
| 460 |
< |
Arrays.sort(o); |
| 461 |
< |
for(int i = 0; i < o.length; i++) |
| 471 |
< |
assertEquals(o[i], q.pollFirst()); |
| 459 |
> |
Object[] o = q.toArray(); |
| 460 |
> |
for (int i = 0; i < o.length; i++) |
| 461 |
> |
assertSame(o[i], q.pollFirst()); |
| 462 |
|
} |
| 463 |
|
|
| 464 |
|
/** |
| 465 |
< |
* toArray(a) contains all elements |
| 465 |
> |
* toArray(a) contains all elements in sorted order |
| 466 |
|
*/ |
| 467 |
|
public void testToArray2() { |
| 468 |
< |
TreeSet q = populatedSet(SIZE); |
| 469 |
< |
Integer[] ints = new Integer[SIZE]; |
| 470 |
< |
ints = (Integer[])q.toArray(ints); |
| 471 |
< |
Arrays.sort(ints); |
| 472 |
< |
for(int i = 0; i < ints.length; i++) |
| 473 |
< |
assertEquals(ints[i], q.pollFirst()); |
| 468 |
> |
TreeSet<Integer> q = populatedSet(SIZE); |
| 469 |
> |
Integer[] ints = new Integer[SIZE]; |
| 470 |
> |
Integer[] array = q.toArray(ints); |
| 471 |
> |
assertSame(ints, array); |
| 472 |
> |
for (int i = 0; i < ints.length; i++) |
| 473 |
> |
assertSame(ints[i], q.pollFirst()); |
| 474 |
|
} |
| 475 |
< |
|
| 475 |
> |
|
| 476 |
|
/** |
| 477 |
|
* iterator iterates through all elements |
| 478 |
|
*/ |
| 479 |
|
public void testIterator() { |
| 480 |
|
TreeSet q = populatedSet(SIZE); |
| 481 |
< |
int i = 0; |
| 482 |
< |
Iterator it = q.iterator(); |
| 483 |
< |
while(it.hasNext()) { |
| 481 |
> |
Iterator it = q.iterator(); |
| 482 |
> |
int i; |
| 483 |
> |
for (i = 0; it.hasNext(); i++) |
| 484 |
|
assertTrue(q.contains(it.next())); |
| 495 |
– |
++i; |
| 496 |
– |
} |
| 485 |
|
assertEquals(i, SIZE); |
| 486 |
+ |
assertIteratorExhausted(it); |
| 487 |
|
} |
| 488 |
|
|
| 489 |
|
/** |
| 490 |
|
* iterator of empty set has no elements |
| 491 |
|
*/ |
| 492 |
|
public void testEmptyIterator() { |
| 493 |
< |
TreeSet q = new TreeSet(); |
| 505 |
< |
int i = 0; |
| 506 |
< |
Iterator it = q.iterator(); |
| 507 |
< |
while(it.hasNext()) { |
| 508 |
< |
assertTrue(q.contains(it.next())); |
| 509 |
< |
++i; |
| 510 |
< |
} |
| 511 |
< |
assertEquals(i, 0); |
| 493 |
> |
assertIteratorExhausted(new TreeSet().iterator()); |
| 494 |
|
} |
| 495 |
|
|
| 496 |
|
/** |
| 497 |
|
* iterator.remove removes current element |
| 498 |
|
*/ |
| 499 |
< |
public void testIteratorRemove () { |
| 499 |
> |
public void testIteratorRemove() { |
| 500 |
|
final TreeSet q = new TreeSet(); |
| 501 |
|
q.add(new Integer(2)); |
| 502 |
|
q.add(new Integer(1)); |
| 512 |
|
assertFalse(it.hasNext()); |
| 513 |
|
} |
| 514 |
|
|
| 533 |
– |
|
| 515 |
|
/** |
| 516 |
|
* toString contains toStrings of elements |
| 517 |
|
*/ |
| 519 |
|
TreeSet q = populatedSet(SIZE); |
| 520 |
|
String s = q.toString(); |
| 521 |
|
for (int i = 0; i < SIZE; ++i) { |
| 522 |
< |
assertTrue(s.indexOf(String.valueOf(i)) >= 0); |
| 522 |
> |
assertTrue(s.contains(String.valueOf(i))); |
| 523 |
|
} |
| 524 |
< |
} |
| 524 |
> |
} |
| 525 |
|
|
| 526 |
|
/** |
| 527 |
< |
* A deserialized serialized set has same elements |
| 527 |
> |
* A deserialized serialized set has same elements |
| 528 |
|
*/ |
| 529 |
< |
public void testSerialization() { |
| 530 |
< |
TreeSet q = populatedSet(SIZE); |
| 531 |
< |
try { |
| 532 |
< |
ByteArrayOutputStream bout = new ByteArrayOutputStream(10000); |
| 533 |
< |
ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout)); |
| 534 |
< |
out.writeObject(q); |
| 535 |
< |
out.close(); |
| 536 |
< |
|
| 537 |
< |
ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray()); |
| 538 |
< |
ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin)); |
| 539 |
< |
TreeSet r = (TreeSet)in.readObject(); |
| 559 |
< |
assertEquals(q.size(), r.size()); |
| 560 |
< |
while (!q.isEmpty()) |
| 561 |
< |
assertEquals(q.pollFirst(), r.pollFirst()); |
| 562 |
< |
} catch(Exception e){ |
| 563 |
< |
e.printStackTrace(); |
| 564 |
< |
unexpectedException(); |
| 529 |
> |
public void testSerialization() throws Exception { |
| 530 |
> |
NavigableSet x = populatedSet(SIZE); |
| 531 |
> |
NavigableSet y = serialClone(x); |
| 532 |
> |
|
| 533 |
> |
assertNotSame(x, y); |
| 534 |
> |
assertEquals(x.size(), y.size()); |
| 535 |
> |
assertEquals(x, y); |
| 536 |
> |
assertEquals(y, x); |
| 537 |
> |
while (!x.isEmpty()) { |
| 538 |
> |
assertFalse(y.isEmpty()); |
| 539 |
> |
assertEquals(x.pollFirst(), y.pollFirst()); |
| 540 |
|
} |
| 541 |
+ |
assertTrue(y.isEmpty()); |
| 542 |
|
} |
| 543 |
|
|
| 544 |
|
/** |
| 660 |
|
assertEquals(4, set.size()); |
| 661 |
|
} |
| 662 |
|
|
| 663 |
+ |
Random rnd = new Random(666); |
| 664 |
+ |
BitSet bs; |
| 665 |
+ |
|
| 666 |
+ |
/** |
| 667 |
+ |
* Subsets of subsets subdivide correctly |
| 668 |
+ |
*/ |
| 669 |
+ |
public void testRecursiveSubSets() throws Exception { |
| 670 |
+ |
int setSize = expensiveTests ? 1000 : 100; |
| 671 |
+ |
Class cl = TreeSet.class; |
| 672 |
+ |
|
| 673 |
+ |
NavigableSet<Integer> set = newSet(cl); |
| 674 |
+ |
bs = new BitSet(setSize); |
| 675 |
+ |
|
| 676 |
+ |
populate(set, setSize); |
| 677 |
+ |
check(set, 0, setSize - 1, true); |
| 678 |
+ |
check(set.descendingSet(), 0, setSize - 1, false); |
| 679 |
+ |
|
| 680 |
+ |
mutateSet(set, 0, setSize - 1); |
| 681 |
+ |
check(set, 0, setSize - 1, true); |
| 682 |
+ |
check(set.descendingSet(), 0, setSize - 1, false); |
| 683 |
+ |
|
| 684 |
+ |
bashSubSet(set.subSet(0, true, setSize, false), |
| 685 |
+ |
0, setSize - 1, true); |
| 686 |
+ |
} |
| 687 |
+ |
|
| 688 |
+ |
/** |
| 689 |
+ |
* addAll is idempotent |
| 690 |
+ |
*/ |
| 691 |
+ |
public void testAddAll_idempotent() throws Exception { |
| 692 |
+ |
Set x = populatedSet(SIZE); |
| 693 |
+ |
Set y = new TreeSet(x); |
| 694 |
+ |
y.addAll(x); |
| 695 |
+ |
assertEquals(x, y); |
| 696 |
+ |
assertEquals(y, x); |
| 697 |
+ |
} |
| 698 |
+ |
|
| 699 |
+ |
static NavigableSet<Integer> newSet(Class cl) throws Exception { |
| 700 |
+ |
NavigableSet<Integer> result = (NavigableSet<Integer>) cl.newInstance(); |
| 701 |
+ |
assertEquals(0, result.size()); |
| 702 |
+ |
assertFalse(result.iterator().hasNext()); |
| 703 |
+ |
return result; |
| 704 |
+ |
} |
| 705 |
+ |
|
| 706 |
+ |
void populate(NavigableSet<Integer> set, int limit) { |
| 707 |
+ |
for (int i = 0, n = 2 * limit / 3; i < n; i++) { |
| 708 |
+ |
int element = rnd.nextInt(limit); |
| 709 |
+ |
put(set, element); |
| 710 |
+ |
} |
| 711 |
+ |
} |
| 712 |
+ |
|
| 713 |
+ |
void mutateSet(NavigableSet<Integer> set, int min, int max) { |
| 714 |
+ |
int size = set.size(); |
| 715 |
+ |
int rangeSize = max - min + 1; |
| 716 |
+ |
|
| 717 |
+ |
// Remove a bunch of entries directly |
| 718 |
+ |
for (int i = 0, n = rangeSize / 2; i < n; i++) { |
| 719 |
+ |
remove(set, min - 5 + rnd.nextInt(rangeSize + 10)); |
| 720 |
+ |
} |
| 721 |
+ |
|
| 722 |
+ |
// Remove a bunch of entries with iterator |
| 723 |
+ |
for (Iterator<Integer> it = set.iterator(); it.hasNext(); ) { |
| 724 |
+ |
if (rnd.nextBoolean()) { |
| 725 |
+ |
bs.clear(it.next()); |
| 726 |
+ |
it.remove(); |
| 727 |
+ |
} |
| 728 |
+ |
} |
| 729 |
+ |
|
| 730 |
+ |
// Add entries till we're back to original size |
| 731 |
+ |
while (set.size() < size) { |
| 732 |
+ |
int element = min + rnd.nextInt(rangeSize); |
| 733 |
+ |
assertTrue(element >= min && element <= max); |
| 734 |
+ |
put(set, element); |
| 735 |
+ |
} |
| 736 |
+ |
} |
| 737 |
+ |
|
| 738 |
+ |
void mutateSubSet(NavigableSet<Integer> set, int min, int max) { |
| 739 |
+ |
int size = set.size(); |
| 740 |
+ |
int rangeSize = max - min + 1; |
| 741 |
+ |
|
| 742 |
+ |
// Remove a bunch of entries directly |
| 743 |
+ |
for (int i = 0, n = rangeSize / 2; i < n; i++) { |
| 744 |
+ |
remove(set, min - 5 + rnd.nextInt(rangeSize + 10)); |
| 745 |
+ |
} |
| 746 |
+ |
|
| 747 |
+ |
// Remove a bunch of entries with iterator |
| 748 |
+ |
for (Iterator<Integer> it = set.iterator(); it.hasNext(); ) { |
| 749 |
+ |
if (rnd.nextBoolean()) { |
| 750 |
+ |
bs.clear(it.next()); |
| 751 |
+ |
it.remove(); |
| 752 |
+ |
} |
| 753 |
+ |
} |
| 754 |
+ |
|
| 755 |
+ |
// Add entries till we're back to original size |
| 756 |
+ |
while (set.size() < size) { |
| 757 |
+ |
int element = min - 5 + rnd.nextInt(rangeSize + 10); |
| 758 |
+ |
if (element >= min && element <= max) { |
| 759 |
+ |
put(set, element); |
| 760 |
+ |
} else { |
| 761 |
+ |
try { |
| 762 |
+ |
set.add(element); |
| 763 |
+ |
shouldThrow(); |
| 764 |
+ |
} catch (IllegalArgumentException success) {} |
| 765 |
+ |
} |
| 766 |
+ |
} |
| 767 |
+ |
} |
| 768 |
+ |
|
| 769 |
+ |
void put(NavigableSet<Integer> set, int element) { |
| 770 |
+ |
if (set.add(element)) |
| 771 |
+ |
bs.set(element); |
| 772 |
+ |
} |
| 773 |
+ |
|
| 774 |
+ |
void remove(NavigableSet<Integer> set, int element) { |
| 775 |
+ |
if (set.remove(element)) |
| 776 |
+ |
bs.clear(element); |
| 777 |
+ |
} |
| 778 |
+ |
|
| 779 |
+ |
void bashSubSet(NavigableSet<Integer> set, |
| 780 |
+ |
int min, int max, boolean ascending) { |
| 781 |
+ |
check(set, min, max, ascending); |
| 782 |
+ |
check(set.descendingSet(), min, max, !ascending); |
| 783 |
+ |
|
| 784 |
+ |
mutateSubSet(set, min, max); |
| 785 |
+ |
check(set, min, max, ascending); |
| 786 |
+ |
check(set.descendingSet(), min, max, !ascending); |
| 787 |
+ |
|
| 788 |
+ |
// Recurse |
| 789 |
+ |
if (max - min < 2) |
| 790 |
+ |
return; |
| 791 |
+ |
int midPoint = (min + max) / 2; |
| 792 |
+ |
|
| 793 |
+ |
// headSet - pick direction and endpoint inclusion randomly |
| 794 |
+ |
boolean incl = rnd.nextBoolean(); |
| 795 |
+ |
NavigableSet<Integer> hm = set.headSet(midPoint, incl); |
| 796 |
+ |
if (ascending) { |
| 797 |
+ |
if (rnd.nextBoolean()) |
| 798 |
+ |
bashSubSet(hm, min, midPoint - (incl ? 0 : 1), true); |
| 799 |
+ |
else |
| 800 |
+ |
bashSubSet(hm.descendingSet(), min, midPoint - (incl ? 0 : 1), |
| 801 |
+ |
false); |
| 802 |
+ |
} else { |
| 803 |
+ |
if (rnd.nextBoolean()) |
| 804 |
+ |
bashSubSet(hm, midPoint + (incl ? 0 : 1), max, false); |
| 805 |
+ |
else |
| 806 |
+ |
bashSubSet(hm.descendingSet(), midPoint + (incl ? 0 : 1), max, |
| 807 |
+ |
true); |
| 808 |
+ |
} |
| 809 |
+ |
|
| 810 |
+ |
// tailSet - pick direction and endpoint inclusion randomly |
| 811 |
+ |
incl = rnd.nextBoolean(); |
| 812 |
+ |
NavigableSet<Integer> tm = set.tailSet(midPoint,incl); |
| 813 |
+ |
if (ascending) { |
| 814 |
+ |
if (rnd.nextBoolean()) |
| 815 |
+ |
bashSubSet(tm, midPoint + (incl ? 0 : 1), max, true); |
| 816 |
+ |
else |
| 817 |
+ |
bashSubSet(tm.descendingSet(), midPoint + (incl ? 0 : 1), max, |
| 818 |
+ |
false); |
| 819 |
+ |
} else { |
| 820 |
+ |
if (rnd.nextBoolean()) { |
| 821 |
+ |
bashSubSet(tm, min, midPoint - (incl ? 0 : 1), false); |
| 822 |
+ |
} else { |
| 823 |
+ |
bashSubSet(tm.descendingSet(), min, midPoint - (incl ? 0 : 1), |
| 824 |
+ |
true); |
| 825 |
+ |
} |
| 826 |
+ |
} |
| 827 |
+ |
|
| 828 |
+ |
// subSet - pick direction and endpoint inclusion randomly |
| 829 |
+ |
int rangeSize = max - min + 1; |
| 830 |
+ |
int[] endpoints = new int[2]; |
| 831 |
+ |
endpoints[0] = min + rnd.nextInt(rangeSize); |
| 832 |
+ |
endpoints[1] = min + rnd.nextInt(rangeSize); |
| 833 |
+ |
Arrays.sort(endpoints); |
| 834 |
+ |
boolean lowIncl = rnd.nextBoolean(); |
| 835 |
+ |
boolean highIncl = rnd.nextBoolean(); |
| 836 |
+ |
if (ascending) { |
| 837 |
+ |
NavigableSet<Integer> sm = set.subSet( |
| 838 |
+ |
endpoints[0], lowIncl, endpoints[1], highIncl); |
| 839 |
+ |
if (rnd.nextBoolean()) |
| 840 |
+ |
bashSubSet(sm, endpoints[0] + (lowIncl ? 0 : 1), |
| 841 |
+ |
endpoints[1] - (highIncl ? 0 : 1), true); |
| 842 |
+ |
else |
| 843 |
+ |
bashSubSet(sm.descendingSet(), endpoints[0] + (lowIncl ? 0 : 1), |
| 844 |
+ |
endpoints[1] - (highIncl ? 0 : 1), false); |
| 845 |
+ |
} else { |
| 846 |
+ |
NavigableSet<Integer> sm = set.subSet( |
| 847 |
+ |
endpoints[1], highIncl, endpoints[0], lowIncl); |
| 848 |
+ |
if (rnd.nextBoolean()) |
| 849 |
+ |
bashSubSet(sm, endpoints[0] + (lowIncl ? 0 : 1), |
| 850 |
+ |
endpoints[1] - (highIncl ? 0 : 1), false); |
| 851 |
+ |
else |
| 852 |
+ |
bashSubSet(sm.descendingSet(), endpoints[0] + (lowIncl ? 0 : 1), |
| 853 |
+ |
endpoints[1] - (highIncl ? 0 : 1), true); |
| 854 |
+ |
} |
| 855 |
+ |
} |
| 856 |
+ |
|
| 857 |
+ |
/** |
| 858 |
+ |
* min and max are both inclusive. If max < min, interval is empty. |
| 859 |
+ |
*/ |
| 860 |
+ |
void check(NavigableSet<Integer> set, |
| 861 |
+ |
final int min, final int max, final boolean ascending) { |
| 862 |
+ |
class ReferenceSet { |
| 863 |
+ |
int lower(int element) { |
| 864 |
+ |
return ascending ? |
| 865 |
+ |
lowerAscending(element) : higherAscending(element); |
| 866 |
+ |
} |
| 867 |
+ |
int floor(int element) { |
| 868 |
+ |
return ascending ? |
| 869 |
+ |
floorAscending(element) : ceilingAscending(element); |
| 870 |
+ |
} |
| 871 |
+ |
int ceiling(int element) { |
| 872 |
+ |
return ascending ? |
| 873 |
+ |
ceilingAscending(element) : floorAscending(element); |
| 874 |
+ |
} |
| 875 |
+ |
int higher(int element) { |
| 876 |
+ |
return ascending ? |
| 877 |
+ |
higherAscending(element) : lowerAscending(element); |
| 878 |
+ |
} |
| 879 |
+ |
int first() { |
| 880 |
+ |
return ascending ? firstAscending() : lastAscending(); |
| 881 |
+ |
} |
| 882 |
+ |
int last() { |
| 883 |
+ |
return ascending ? lastAscending() : firstAscending(); |
| 884 |
+ |
} |
| 885 |
+ |
int lowerAscending(int element) { |
| 886 |
+ |
return floorAscending(element - 1); |
| 887 |
+ |
} |
| 888 |
+ |
int floorAscending(int element) { |
| 889 |
+ |
if (element < min) |
| 890 |
+ |
return -1; |
| 891 |
+ |
else if (element > max) |
| 892 |
+ |
element = max; |
| 893 |
+ |
|
| 894 |
+ |
// BitSet should support this! Test would run much faster |
| 895 |
+ |
while (element >= min) { |
| 896 |
+ |
if (bs.get(element)) |
| 897 |
+ |
return element; |
| 898 |
+ |
element--; |
| 899 |
+ |
} |
| 900 |
+ |
return -1; |
| 901 |
+ |
} |
| 902 |
+ |
int ceilingAscending(int element) { |
| 903 |
+ |
if (element < min) |
| 904 |
+ |
element = min; |
| 905 |
+ |
else if (element > max) |
| 906 |
+ |
return -1; |
| 907 |
+ |
int result = bs.nextSetBit(element); |
| 908 |
+ |
return result > max ? -1 : result; |
| 909 |
+ |
} |
| 910 |
+ |
int higherAscending(int element) { |
| 911 |
+ |
return ceilingAscending(element + 1); |
| 912 |
+ |
} |
| 913 |
+ |
private int firstAscending() { |
| 914 |
+ |
int result = ceilingAscending(min); |
| 915 |
+ |
return result > max ? -1 : result; |
| 916 |
+ |
} |
| 917 |
+ |
private int lastAscending() { |
| 918 |
+ |
int result = floorAscending(max); |
| 919 |
+ |
return result < min ? -1 : result; |
| 920 |
+ |
} |
| 921 |
+ |
} |
| 922 |
+ |
ReferenceSet rs = new ReferenceSet(); |
| 923 |
+ |
|
| 924 |
+ |
// Test contents using containsElement |
| 925 |
+ |
int size = 0; |
| 926 |
+ |
for (int i = min; i <= max; i++) { |
| 927 |
+ |
boolean bsContainsI = bs.get(i); |
| 928 |
+ |
assertEquals(bsContainsI, set.contains(i)); |
| 929 |
+ |
if (bsContainsI) |
| 930 |
+ |
size++; |
| 931 |
+ |
} |
| 932 |
+ |
assertEquals(size, set.size()); |
| 933 |
+ |
|
| 934 |
+ |
// Test contents using contains elementSet iterator |
| 935 |
+ |
int size2 = 0; |
| 936 |
+ |
int previousElement = -1; |
| 937 |
+ |
for (int element : set) { |
| 938 |
+ |
assertTrue(bs.get(element)); |
| 939 |
+ |
size2++; |
| 940 |
+ |
assertTrue(previousElement < 0 || (ascending ? |
| 941 |
+ |
element - previousElement > 0 : element - previousElement < 0)); |
| 942 |
+ |
previousElement = element; |
| 943 |
+ |
} |
| 944 |
+ |
assertEquals(size2, size); |
| 945 |
+ |
|
| 946 |
+ |
// Test navigation ops |
| 947 |
+ |
for (int element = min - 1; element <= max + 1; element++) { |
| 948 |
+ |
assertEq(set.lower(element), rs.lower(element)); |
| 949 |
+ |
assertEq(set.floor(element), rs.floor(element)); |
| 950 |
+ |
assertEq(set.higher(element), rs.higher(element)); |
| 951 |
+ |
assertEq(set.ceiling(element), rs.ceiling(element)); |
| 952 |
+ |
} |
| 953 |
+ |
|
| 954 |
+ |
// Test extrema |
| 955 |
+ |
if (set.size() != 0) { |
| 956 |
+ |
assertEq(set.first(), rs.first()); |
| 957 |
+ |
assertEq(set.last(), rs.last()); |
| 958 |
+ |
} else { |
| 959 |
+ |
assertEq(rs.first(), -1); |
| 960 |
+ |
assertEq(rs.last(), -1); |
| 961 |
+ |
try { |
| 962 |
+ |
set.first(); |
| 963 |
+ |
shouldThrow(); |
| 964 |
+ |
} catch (NoSuchElementException success) {} |
| 965 |
+ |
try { |
| 966 |
+ |
set.last(); |
| 967 |
+ |
shouldThrow(); |
| 968 |
+ |
} catch (NoSuchElementException success) {} |
| 969 |
+ |
} |
| 970 |
+ |
} |
| 971 |
+ |
|
| 972 |
+ |
static void assertEq(Integer i, int j) { |
| 973 |
+ |
if (i == null) |
| 974 |
+ |
assertEquals(j, -1); |
| 975 |
+ |
else |
| 976 |
+ |
assertEquals((int) i, j); |
| 977 |
+ |
} |
| 978 |
+ |
|
| 979 |
+ |
static boolean eq(Integer i, int j) { |
| 980 |
+ |
return i == null ? j == -1 : i == j; |
| 981 |
+ |
} |
| 982 |
+ |
|
| 983 |
|
} |
