| Package | Description |
|---|---|
| java.util |
| Modifier and Type | Class and Description |
|---|---|
static class |
AbstractMap.SimpleEntry<K,V>
A key-value mapping.
|
static class |
AbstractMap.SimpleImmutableEntry<K,V>
An immutable key-value mapping.
|
| Modifier and Type | Method and Description |
|---|---|
Map.Entry<K,V> |
TreeMap.ceilingEntry(K key)
Answers an entry related with the smallest key greater than or equal to
the specified key, or null if no such key.
|
Map.Entry<K,V> |
NavigableMap.ceilingEntry(K key)
Answers an entry related with the smallest key greater than or equal to
the specified key, or null if no such key.
|
Map.Entry<K,V> |
TreeMap.firstEntry()
Answers the entry with the smallest key, or null if the map is empty.
|
Map.Entry<K,V> |
NavigableMap.firstEntry()
Answers the entry with the smallest key, or null if the map is empty.
|
Map.Entry<K,V> |
TreeMap.floorEntry(K key)
Answers an entry related with the biggest key less than or equal to the
specified key, or null if no such key.
|
Map.Entry<K,V> |
NavigableMap.floorEntry(K key)
Answers an entry related with the biggest key less than or equal to the
specified key, or null if no such key.
|
Map.Entry<K,V> |
TreeMap.higherEntry(K key)
Answers an entry related with the smallest key greater than the specified
key, or null if no such key.
|
Map.Entry<K,V> |
NavigableMap.higherEntry(K key)
Answers an entry related with the smallest key greater than the specified
key, or null if no such key.
|
Map.Entry<K,V> |
TreeMap.lastEntry()
Answers the entry with the biggest key, or null if the map is empty.
|
Map.Entry<K,V> |
NavigableMap.lastEntry()
Answers the entry with the biggest key, or null if the map is empty.
|
Map.Entry<K,V> |
TreeMap.lowerEntry(K key)
Answers an entry related with the biggest key less than the specified
key, or null if no such key.
|
Map.Entry<K,V> |
NavigableMap.lowerEntry(K key)
Answers an entry related with the biggest key less than the specified
key, or null if no such key.
|
Map.Entry<K,V> |
TreeMap.pollFirstEntry()
Deletes and answers the entry with the smallest key, or null if the map
is empty.
|
Map.Entry<K,V> |
NavigableMap.pollFirstEntry()
Deletes and answers the entry with the smallest key, or null if the map
is empty.
|
Map.Entry<K,V> |
TreeMap.pollLastEntry()
Deletes and answers the entry with the biggest key, or null if the map is
empty.
|
Map.Entry<K,V> |
NavigableMap.pollLastEntry()
Deletes and answers the entry with the biggest key, or null if the map is
empty.
|
| Modifier and Type | Method and Description |
|---|---|
Set<Map.Entry<K,V>> |
TreeMap.entrySet()
Returns a set containing all of the mappings in this map.
|
Set<Map.Entry<K,V>> |
Map.entrySet()
Returns a
Set containing all of the mappings in this Map. |
Set<Map.Entry<K,V>> |
LinkedHashMap.entrySet()
Returns a set containing all of the mappings in this map.
|
Set<Map.Entry<K,V>> |
IdentityHashMap.entrySet()
Returns a set containing all of the mappings in this map.
|
Set<Map.Entry<K,V>> |
Hashtable.entrySet()
Returns a set of the mappings contained in this
Hashtable. |
Set<Map.Entry<K,V>> |
HashMap.entrySet()
Returns a set containing all of the mappings in this map.
|
abstract Set<Map.Entry<K,V>> |
AbstractMap.entrySet()
Returns a set containing all of the mappings in this map.
|
| Modifier and Type | Method and Description |
|---|---|
protected boolean |
LinkedHashMap.removeEldestEntry(Map.Entry<K,V> eldest)
This method is queried from the put and putAll methods to check if the
eldest member of the map should be deleted before adding the new member.
|
| Constructor and Description |
|---|
SimpleEntry(Map.Entry<? extends K,? extends V> entry)
Constructs a new instance by an entry
|
SimpleImmutableEntry(Map.Entry<? extends K,? extends V> entry)
Constructs a new instance by an entry
|
Copyright © 2026. All rights reserved.