| 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.*; |
| 8 |
> |
import java.util.Arrays; |
| 9 |
> |
import java.util.BitSet; |
| 10 |
> |
import java.util.Collection; |
| 11 |
> |
import java.util.Comparator; |
| 12 |
> |
import java.util.Iterator; |
| 13 |
> |
import java.util.NavigableSet; |
| 14 |
> |
import java.util.NoSuchElementException; |
| 15 |
> |
import java.util.Random; |
| 16 |
> |
import java.util.Set; |
| 17 |
> |
import java.util.SortedSet; |
| 18 |
> |
import java.util.TreeSet; |
| 19 |
|
|
| 20 |
|
public class TreeSetTest extends JSR166TestCase { |
| 21 |
|
public static void main(String[] args) { |
| 281 |
|
assertNull(q.pollFirst()); |
| 282 |
|
} |
| 283 |
|
|
| 276 |
– |
|
| 284 |
|
/** |
| 285 |
|
* remove(x) removes x and returns true if present |
| 286 |
|
*/ |
| 287 |
|
public void testRemoveElement() { |
| 288 |
|
TreeSet q = populatedSet(SIZE); |
| 289 |
|
for (int i = 1; i < SIZE; i+=2) { |
| 290 |
< |
assertTrue(q.remove(new Integer(i))); |
| 290 |
> |
assertTrue(q.contains(i)); |
| 291 |
> |
assertTrue(q.remove(i)); |
| 292 |
> |
assertFalse(q.contains(i)); |
| 293 |
> |
assertTrue(q.contains(i-1)); |
| 294 |
|
} |
| 295 |
|
for (int i = 0; i < SIZE; i+=2) { |
| 296 |
< |
assertTrue(q.remove(new Integer(i))); |
| 297 |
< |
assertFalse(q.remove(new Integer(i+1))); |
| 296 |
> |
assertTrue(q.contains(i)); |
| 297 |
> |
assertTrue(q.remove(i)); |
| 298 |
> |
assertFalse(q.contains(i)); |
| 299 |
> |
assertFalse(q.remove(i+1)); |
| 300 |
> |
assertFalse(q.contains(i+1)); |
| 301 |
|
} |
| 302 |
|
assertTrue(q.isEmpty()); |
| 303 |
|
} |
| 377 |
|
} |
| 378 |
|
} |
| 379 |
|
|
| 367 |
– |
|
| 368 |
– |
|
| 380 |
|
/** |
| 381 |
|
* lower returns preceding element |
| 382 |
|
*/ |
| 518 |
|
assertFalse(it.hasNext()); |
| 519 |
|
} |
| 520 |
|
|
| 510 |
– |
|
| 521 |
|
/** |
| 522 |
|
* toString contains toStrings of elements |
| 523 |
|
*/ |
| 525 |
|
TreeSet q = populatedSet(SIZE); |
| 526 |
|
String s = q.toString(); |
| 527 |
|
for (int i = 0; i < SIZE; ++i) { |
| 528 |
< |
assertTrue(s.indexOf(String.valueOf(i)) >= 0); |
| 528 |
> |
assertTrue(s.contains(String.valueOf(i))); |
| 529 |
|
} |
| 530 |
|
} |
| 531 |
|
|
| 533 |
|
* A deserialized serialized set has same elements |
| 534 |
|
*/ |
| 535 |
|
public void testSerialization() throws Exception { |
| 536 |
< |
TreeSet q = populatedSet(SIZE); |
| 537 |
< |
ByteArrayOutputStream bout = new ByteArrayOutputStream(10000); |
| 538 |
< |
ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout)); |
| 539 |
< |
out.writeObject(q); |
| 540 |
< |
out.close(); |
| 541 |
< |
|
| 542 |
< |
ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray()); |
| 543 |
< |
ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin)); |
| 544 |
< |
TreeSet r = (TreeSet)in.readObject(); |
| 545 |
< |
assertEquals(q.size(), r.size()); |
| 546 |
< |
while (!q.isEmpty()) |
| 547 |
< |
assertEquals(q.pollFirst(), r.pollFirst()); |
| 536 |
> |
NavigableSet x = populatedSet(SIZE); |
| 537 |
> |
NavigableSet y = serialClone(x); |
| 538 |
> |
|
| 539 |
> |
assertTrue(x != y); |
| 540 |
> |
assertEquals(x.size(), y.size()); |
| 541 |
> |
assertEquals(x, y); |
| 542 |
> |
assertEquals(y, x); |
| 543 |
> |
while (!x.isEmpty()) { |
| 544 |
> |
assertFalse(y.isEmpty()); |
| 545 |
> |
assertEquals(x.pollFirst(), y.pollFirst()); |
| 546 |
> |
} |
| 547 |
> |
assertTrue(y.isEmpty()); |
| 548 |
|
} |
| 549 |
|
|
| 550 |
|
/** |
| 854 |
|
*/ |
| 855 |
|
void check(NavigableSet<Integer> set, |
| 856 |
|
final int min, final int max, final boolean ascending) { |
| 857 |
< |
class ReferenceSet { |
| 857 |
> |
class ReferenceSet { |
| 858 |
|
int lower(int element) { |
| 859 |
|
return ascending ? |
| 860 |
|
lowerAscending(element) : higherAscending(element); |
