54 |
|
* Returns a new set of first 5 ints. |
55 |
|
*/ |
56 |
|
private static ConcurrentSkipListSet<Item> set5() { |
57 |
< |
ConcurrentSkipListSet<Item> q = new ConcurrentSkipListSet<Item>(); |
57 |
> |
ConcurrentSkipListSet<Item> q = new ConcurrentSkipListSet<>(); |
58 |
|
assertTrue(q.isEmpty()); |
59 |
|
q.add(one); |
60 |
|
q.add(two); |
109 |
|
*/ |
110 |
|
public void testConstructor6() { |
111 |
|
Item[] items = defaultItems; |
112 |
< |
ConcurrentSkipListSet<Item> q = new ConcurrentSkipListSet<Item>(Arrays.asList(items)); |
112 |
> |
ConcurrentSkipListSet<Item> q = new ConcurrentSkipListSet<>(Arrays.asList(items)); |
113 |
|
for (int i = 0; i < SIZE; ++i) |
114 |
|
mustEqual(items[i], q.pollFirst()); |
115 |
|
} |
120 |
|
public void testConstructor7() { |
121 |
|
MyReverseComparator cmp = new MyReverseComparator(); |
122 |
|
@SuppressWarnings("unchecked") |
123 |
< |
ConcurrentSkipListSet<Item> q = new ConcurrentSkipListSet<Item>(cmp); |
123 |
> |
ConcurrentSkipListSet<Item> q = new ConcurrentSkipListSet<>(cmp); |
124 |
|
mustEqual(cmp, q.comparator()); |
125 |
|
Item[] items = defaultItems; |
126 |
|
q.addAll(Arrays.asList(items)); |
132 |
|
* isEmpty is true before add, false after |
133 |
|
*/ |
134 |
|
public void testEmpty() { |
135 |
< |
ConcurrentSkipListSet<Item> q = new ConcurrentSkipListSet<Item>(); |
135 |
> |
ConcurrentSkipListSet<Item> q = new ConcurrentSkipListSet<>(); |
136 |
|
assertTrue(q.isEmpty()); |
137 |
|
mustAdd(q, one); |
138 |
|
assertFalse(q.isEmpty()); |
161 |
|
* add(null) throws NPE |
162 |
|
*/ |
163 |
|
public void testAddNull() { |
164 |
< |
ConcurrentSkipListSet<Item> q = new ConcurrentSkipListSet<Item>(); |
164 |
> |
ConcurrentSkipListSet<Item> q = new ConcurrentSkipListSet<>(); |
165 |
|
try { |
166 |
|
q.add(null); |
167 |
|
shouldThrow(); |
172 |
|
* Add of comparable element succeeds |
173 |
|
*/ |
174 |
|
public void testAdd() { |
175 |
< |
ConcurrentSkipListSet<Item> q = new ConcurrentSkipListSet<Item>(); |
175 |
> |
ConcurrentSkipListSet<Item> q = new ConcurrentSkipListSet<>(); |
176 |
|
assertTrue(q.add(zero)); |
177 |
|
assertTrue(q.add(one)); |
178 |
|
} |
181 |
|
* Add of duplicate element fails |
182 |
|
*/ |
183 |
|
public void testAddDup() { |
184 |
< |
ConcurrentSkipListSet<Item> q = new ConcurrentSkipListSet<Item>(); |
184 |
> |
ConcurrentSkipListSet<Item> q = new ConcurrentSkipListSet<>(); |
185 |
|
assertTrue(q.add(zero)); |
186 |
|
assertFalse(q.add(zero)); |
187 |
|
} |
190 |
|
* Add of non-Comparable throws CCE |
191 |
|
*/ |
192 |
|
public void testAddNonComparable() { |
193 |
< |
ConcurrentSkipListSet<Object> q = new ConcurrentSkipListSet<Object>(); |
193 |
> |
ConcurrentSkipListSet<Object> q = new ConcurrentSkipListSet<>(); |
194 |
|
try { |
195 |
|
q.add(new Object()); |
196 |
|
q.add(new Object()); |
209 |
|
* addAll(null) throws NPE |
210 |
|
*/ |
211 |
|
public void testAddAll1() { |
212 |
< |
ConcurrentSkipListSet<Item> q = new ConcurrentSkipListSet<Item>(); |
212 |
> |
ConcurrentSkipListSet<Item> q = new ConcurrentSkipListSet<>(); |
213 |
|
try { |
214 |
|
q.addAll(null); |
215 |
|
shouldThrow(); |
220 |
|
* addAll of a collection with null elements throws NPE |
221 |
|
*/ |
222 |
|
public void testAddAll2() { |
223 |
< |
ConcurrentSkipListSet<Item> q = new ConcurrentSkipListSet<Item>(); |
223 |
> |
ConcurrentSkipListSet<Item> q = new ConcurrentSkipListSet<>(); |
224 |
|
Item[] items = new Item[SIZE]; |
225 |
|
try { |
226 |
|
q.addAll(Arrays.asList(items)); |
233 |
|
* possibly adding some elements |
234 |
|
*/ |
235 |
|
public void testAddAll3() { |
236 |
< |
ConcurrentSkipListSet<Item> q = new ConcurrentSkipListSet<Item>(); |
236 |
> |
ConcurrentSkipListSet<Item> q = new ConcurrentSkipListSet<>(); |
237 |
|
Item[] items = new Item[2]; items[0] = zero; |
238 |
|
try { |
239 |
|
q.addAll(Arrays.asList(items)); |
247 |
|
public void testAddAll5() { |
248 |
|
Item[] empty = new Item[0]; |
249 |
|
Item[] items = defaultItems; |
250 |
< |
ConcurrentSkipListSet<Item> q = new ConcurrentSkipListSet<Item>(); |
250 |
> |
ConcurrentSkipListSet<Item> q = new ConcurrentSkipListSet<>(); |
251 |
|
assertFalse(q.addAll(Arrays.asList(empty))); |
252 |
|
assertTrue(q.addAll(Arrays.asList(items))); |
253 |
|
for (int i = 0; i < SIZE; ++i) |
328 |
|
*/ |
329 |
|
public void testContainsAll() { |
330 |
|
ConcurrentSkipListSet<Item> q = populatedSet(SIZE); |
331 |
< |
ConcurrentSkipListSet<Item> p = new ConcurrentSkipListSet<Item>(); |
331 |
> |
ConcurrentSkipListSet<Item> p = new ConcurrentSkipListSet<>(); |
332 |
|
for (int i = 0; i < SIZE; ++i) { |
333 |
|
assertTrue(q.containsAll(p)); |
334 |
|
assertFalse(p.containsAll(q)); |
484 |
|
* iterator of empty set has no elements |
485 |
|
*/ |
486 |
|
public void testEmptyIterator() { |
487 |
< |
NavigableSet<Item> s = new ConcurrentSkipListSet<Item>(); |
487 |
> |
NavigableSet<Item> s = new ConcurrentSkipListSet<>(); |
488 |
|
assertIteratorExhausted(s.iterator()); |
489 |
|
assertIteratorExhausted(s.descendingSet().iterator()); |
490 |
|
} |
493 |
|
* iterator.remove removes current element |
494 |
|
*/ |
495 |
|
public void testIteratorRemove() { |
496 |
< |
final ConcurrentSkipListSet<Item> q = new ConcurrentSkipListSet<Item>(); |
496 |
> |
final ConcurrentSkipListSet<Item> q = new ConcurrentSkipListSet<>(); |
497 |
|
q.add(two); |
498 |
|
q.add(one); |
499 |
|
q.add(three); |
700 |
|
*/ |
701 |
|
public void testAddAll_idempotent() throws Exception { |
702 |
|
Set<Item> x = populatedSet(SIZE); |
703 |
< |
Set<Item> y = new ConcurrentSkipListSet<Item>(x); |
703 |
> |
Set<Item> y = new ConcurrentSkipListSet<>(x); |
704 |
|
y.addAll(x); |
705 |
|
mustEqual(x, y); |
706 |
|
mustEqual(y, x); |