64 |
|
test(new PriorityQueue<>(), AComparable::new, |
65 |
|
(q, e) -> { |
66 |
|
assertEquals(q.size(), 1); |
67 |
< |
assertTrue(e == null); |
67 |
> |
assertNull(e); |
68 |
|
}); |
69 |
|
|
70 |
|
test(new PriorityBlockingQueue<>(), NonComparable::new, |
75 |
|
test(new PriorityBlockingQueue<>(), AComparable::new, |
76 |
|
(q, e) -> { |
77 |
|
assertEquals(q.size(), 1); |
78 |
< |
assertTrue(e == null); |
78 |
> |
assertNull(e); |
79 |
|
}); |
80 |
|
} |
81 |
|
|
98 |
|
test(new TreeSet<>(), AComparable::new, |
99 |
|
(s, e) -> { |
100 |
|
assertEquals(s.size(), 1); |
101 |
< |
assertTrue(e == null); |
101 |
> |
assertNull(e); |
102 |
|
}); |
103 |
|
|
104 |
|
test(new ConcurrentSkipListSet<>(), NonComparable::new, |
109 |
|
test(new ConcurrentSkipListSet<>(), AComparable::new, |
110 |
|
(s, e) -> { |
111 |
|
assertEquals(s.size(), 1); |
112 |
< |
assertTrue(e == null); |
112 |
> |
assertNull(e); |
113 |
|
}); |
114 |
|
} |
115 |
|
|
131 |
|
test(new TreeMap<>(), AComparable::new, |
132 |
|
(m, e) -> { |
133 |
|
assertEquals(m.size(), 1); |
134 |
< |
assertTrue(e == null); |
134 |
> |
assertNull(e); |
135 |
|
}); |
136 |
|
|
137 |
|
test(new ConcurrentSkipListMap<>(), NonComparable::new, |
142 |
|
test(new ConcurrentSkipListMap<>(), AComparable::new, |
143 |
|
(s, e) -> { |
144 |
|
assertEquals(s.size(), 1); |
145 |
< |
assertTrue(e == null); |
145 |
> |
assertNull(e); |
146 |
|
}); |
147 |
|
} |
148 |
|
|