use of java.util.TreeSet in project mapdb by jankotek.
the class TreeSetTest method testAddNull.
/**
* add(null) throws NPE if nonempty
*/
public void testAddNull() {
TreeSet q = populatedSet(SIZE);
try {
q.add(null);
shouldThrow();
} catch (NullPointerException success) {
}
}
use of java.util.TreeSet in project mapdb by jankotek.
the class TreeSetTest method testSubSetContents2.
public void testSubSetContents2() {
TreeSet set = set5();
SortedSet sm = set.subSet(two, three);
assertEquals(1, sm.size());
assertEquals(two, sm.first());
assertEquals(two, sm.last());
assertFalse(sm.contains(one));
assertTrue(sm.contains(two));
assertFalse(sm.contains(three));
assertFalse(sm.contains(four));
assertFalse(sm.contains(five));
Iterator i = sm.iterator();
Object k;
k = (Integer) (i.next());
assertEquals(two, k);
assertFalse(i.hasNext());
Iterator j = sm.iterator();
j.next();
j.remove();
assertFalse(set.contains(two));
assertEquals(4, set.size());
assertEquals(0, sm.size());
assertTrue(sm.isEmpty());
assertFalse(sm.remove(three));
assertEquals(4, set.size());
}
use of java.util.TreeSet in project mapdb by jankotek.
the class TreeSetTest method testToArray.
/**
* toArray contains all elements in sorted order
*/
public void testToArray() {
TreeSet q = populatedSet(SIZE);
Object[] o = q.toArray();
for (int i = 0; i < o.length; i++) assertSame(o[i], q.pollFirst());
}
use of java.util.TreeSet in project mapdb by jankotek.
the class TreeSetTest method testFloor.
/**
* floor returns preceding element
*/
public void testFloor() {
TreeSet q = set5();
Object e1 = q.floor(three);
assertEquals(three, e1);
Object e2 = q.floor(six);
assertEquals(five, e2);
Object e3 = q.floor(one);
assertEquals(one, e3);
Object e4 = q.floor(zero);
assertNull(e4);
}
use of java.util.TreeSet in project mapdb by jankotek.
the class TreeSetTest method testRetainAll.
/**
* retainAll(c) retains only those elements of c and reports true if changed
*/
public void testRetainAll() {
TreeSet q = populatedSet(SIZE);
TreeSet p = populatedSet(SIZE);
for (int i = 0; i < SIZE; ++i) {
boolean changed = q.retainAll(p);
if (i == 0)
assertFalse(changed);
else
assertTrue(changed);
assertTrue(q.containsAll(p));
assertEquals(SIZE - i, q.size());
p.pollFirst();
}
}
Aggregations