K
- the type of keys maintained by this map
V
- the type of mapped values
Map<K,V>
ConcurrentNavigableMap<K,V>
, NavigableMap<K,V>
, SortedMap<K,V>
ConcurrentSkipListMap
, LinkedHashMap
, TreeMap
Map.Entry<K,V>
Returns the first key-value mapping in this map, or null
if the map is empty.
Returns the last key-value mapping in this map, or null
if the map is empty.
Removes and returns the first key-value mapping in this map, or null
if the map is empty (optional operation).
Removes and returns the last key-value mapping in this map, or null
if the map is empty (optional operation).
Inserts the given mapping into the map if it is not already present, or replaces the value of a mapping if it is already present (optional operation).
Inserts the given mapping into the map if it is not already present, or replaces the value of a mapping if it is already present (optional operation).
Returns a reverse-ordered
viewof this map.
Returns a
SequencedSet
view of this map's
entrySet
.
Returns a
SequencedSet
view of this map's
keySet
.
Returns a
SequencedCollection
view of this map's
values
collection.
Methods declared in interface java.util.Mapclear, compute, computeIfAbsent, computeIfPresent, containsKey, containsValue, entrySet, equals, forEach, get, getOrDefault, hashCode, isEmpty, keySet, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAll, size, values
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4