}
@MapFeature.Require(SUPPORTS_REMOVE)
@CollectionSize.Require(ZERO)
public void testEmptyMapPollFirst() {
assertNull(navigableMap.pollFirstEntry());
}
@CollectionSize.Require(ZERO)
public void testEmptyMapNearby() {
assertNull(navigableMap.lowerEntry(samples.e0.getKey()));
assertNull(navigableMap.lowerKey(samples.e0.getKey()));
assertNull(navigableMap.floorEntry(samples.e0.getKey()));
assertNull(navigableMap.floorKey(samples.e0.getKey()));
assertNull(navigableMap.ceilingEntry(samples.e0.getKey()));
assertNull(navigableMap.ceilingKey(samples.e0.getKey()));
assertNull(navigableMap.higherEntry(samples.e0.getKey()));
assertNull(navigableMap.higherKey(samples.e0.getKey()));
}
Connect your IDE to all the code out there
Get Codota for Java
Other popular examples for NavigableMap
54: Map.Entry<K, Value<V>> start = map.lowerEntry(key);
55: Map.Entry<K, Value<V>> end = map.ceilingEntry(key);
Full Snippet Info177: assertNull("must not have first entry", navigableMap.pollFirstEntry());
178: navigableMap.put("ka", "xx");
179: navigableMap.put("kb", "aa");
180: navigableMap.put("kc", "zz");
181: assertEquals("must have 3 entries", 3, navigableMap.size());
182: final Entry<String, String> firstEntry = navigableMap.pollFirstEntry();
-
186: assertEquals("must have 2 entries", 2, navigableMap.size());
Full Snippet Info90: Map.Entry<Long, LongSegment> lowerEntry = map.floorEntry(aLong);
-
98: LongSegment upperSegment = map.get(aLong + 1);
-
107: map.put(
-
113: map.remove(upperSegment.getMin());
-
118: map.put(
-
125: map.put(aLong, new LongSegment(aLong, upperSegment.getMax()));
-
127: map.remove(upperSegment.getMin());
-
132: map.put(aLong, new LongSegment(aLong));
Full Snippet Info