Uses of Interface
java.util.Map.Entry
Package
Description
Provides a simple high-level Http server API, which can be used to build
embedded HTTP servers.
Contains all of the classes for creating user interfaces and for painting
graphics and images.
Provides the classes and interfaces for the security framework.
Contains the collections framework, some internationalization support classes,
a service loader, properties, random number generation, string parsing
and scanning classes, base64 encoding and decoding, a bit array, and
several miscellaneous utility classes.
Utility classes commonly useful in concurrent programming.
Provides classes for reading and writing the JAR (Java ARchive)
file format, which is based on the standard ZIP file format with an
optional manifest file.
Provides the open data types and Open MBean descriptor classes.
The scripting API consists of interfaces and classes that define
Java Scripting Engines and provides
a framework for their use in Java applications.
DOM-specific classes for the
javax.xml.crypto
package.-
Uses of Map.Entry in com.sun.net.httpserver
-
Uses of Map.Entry in java.awt
-
Uses of Map.Entry in java.security
-
Uses of Map.Entry in java.util
Modifier and TypeClassDescriptionstatic class
An Entry maintaining a key and a value.static class
An unmodifiable Entry maintaining a key and a value.Modifier and TypeMethodDescriptionNavigableMap.ceilingEntry
(K key) Returns a key-value mapping associated with the least key greater than or equal to the given key, ornull
if there is no such key.TreeMap.ceilingEntry
(K key) static <K,
V> Map.Entry<K, V> Returns a copy of the givenMap.Entry
.static <K,
V> Map.Entry<K, V> Map.entry
(K k, V v) Returns an unmodifiableMap.Entry
containing the given key and value.NavigableMap.firstEntry()
Returns a key-value mapping associated with the least key in this map, ornull
if the map is empty.TreeMap.firstEntry()
NavigableMap.floorEntry
(K key) Returns a key-value mapping associated with the greatest key less than or equal to the given key, ornull
if there is no such key.TreeMap.floorEntry
(K key) NavigableMap.higherEntry
(K key) Returns a key-value mapping associated with the least key strictly greater than the given key, ornull
if there is no such key.TreeMap.higherEntry
(K key) NavigableMap.lastEntry()
Returns a key-value mapping associated with the greatest key in this map, ornull
if the map is empty.TreeMap.lastEntry()
NavigableMap.lowerEntry
(K key) Returns a key-value mapping associated with the greatest key strictly less than the given key, ornull
if there is no such key.TreeMap.lowerEntry
(K key) NavigableMap.pollFirstEntry()
Removes and returns a key-value mapping associated with the least key in this map, ornull
if the map is empty.TreeMap.pollFirstEntry()
NavigableMap.pollLastEntry()
Removes and returns a key-value mapping associated with the greatest key in this map, ornull
if the map is empty.TreeMap.pollLastEntry()
Modifier and TypeMethodDescriptionstatic <K extends Comparable<? super K>,
V>
Comparator<Map.Entry<K,V>> Map.Entry.comparingByKey()
Returns a comparator that comparesMap.Entry
in natural order on key.static <K,
V> Comparator<Map.Entry<K, V>> Map.Entry.comparingByKey
(Comparator<? super K> cmp) Returns a comparator that comparesMap.Entry
by key using the givenComparator
.static <K,
V extends Comparable<? super V>>
Comparator<Map.Entry<K,V>> Map.Entry.comparingByValue()
Returns a comparator that comparesMap.Entry
in natural order on value.static <K,
V> Comparator<Map.Entry<K, V>> Map.Entry.comparingByValue
(Comparator<? super V> cmp) Returns a comparator that comparesMap.Entry
by value using the givenComparator
.EnumMap.entrySet()
Returns aSet
view of the mappings contained in this map.HashMap.entrySet()
Returns aSet
view of the mappings contained in this map.Hashtable.entrySet()
Returns aSet
view of the mappings contained in this map.IdentityHashMap.entrySet()
Returns aSet
view of the mappings contained in this map.LinkedHashMap.entrySet()
Returns aSet
view of the mappings contained in this map.Map.entrySet()
Returns aSet
view of the mappings contained in this map.SortedMap.entrySet()
Returns aSet
view of the mappings contained in this map.TreeMap.entrySet()
Returns aSet
view of the mappings contained in this map.WeakHashMap.entrySet()
Returns aSet
view of the mappings contained in this map.Modifier and TypeMethodDescriptionstatic <K,
V> Map.Entry<K, V> Returns a copy of the givenMap.Entry
.static <K,
V> Map<K, V> Returns an unmodifiable map containing keys and values extracted from the given entries.protected boolean
LinkedHashMap.removeEldestEntry
(Map.Entry<K, V> eldest) Returnstrue
if this map should remove its eldest entry.ModifierConstructorDescriptionSimpleEntry
(Map.Entry<? extends K, ? extends V> entry) Creates an entry representing the same mapping as the specified entry.SimpleImmutableEntry
(Map.Entry<? extends K, ? extends V> entry) Creates an entry representing the same mapping as the specified entry. -
Uses of Map.Entry in java.util.concurrent
Modifier and TypeMethodDescriptionConcurrentSkipListMap.ceilingEntry
(K key) Returns a key-value mapping associated with the least key greater than or equal to the given key, ornull
if there is no such entry.ConcurrentSkipListMap.firstEntry()
Returns a key-value mapping associated with the least key in this map, ornull
if the map is empty.ConcurrentSkipListMap.floorEntry
(K key) Returns a key-value mapping associated with the greatest key less than or equal to the given key, ornull
if there is no such key.ConcurrentSkipListMap.higherEntry
(K key) Returns a key-value mapping associated with the least key strictly greater than the given key, ornull
if there is no such key.ConcurrentSkipListMap.lastEntry()
Returns a key-value mapping associated with the greatest key in this map, ornull
if the map is empty.ConcurrentSkipListMap.lowerEntry
(K key) Returns a key-value mapping associated with the greatest key strictly less than the given key, ornull
if there is no such key.ConcurrentSkipListMap.pollFirstEntry()
Removes and returns a key-value mapping associated with the least key in this map, ornull
if the map is empty.ConcurrentSkipListMap.pollLastEntry()
Removes and returns a key-value mapping associated with the greatest key in this map, ornull
if the map is empty.ConcurrentHashMap.reduceEntries
(long parallelismThreshold, BiFunction<Map.Entry<K, V>, Map.Entry<K, V>, ? extends Map.Entry<K, V>> reducer) Returns the result of accumulating all entries using the given reducer to combine values, or null if none.Modifier and TypeMethodDescriptionConcurrentHashMap.entrySet()
Returns aSet
view of the mappings contained in this map.ConcurrentSkipListMap.entrySet()
Returns aSet
view of the mappings contained in this map.Modifier and TypeMethodDescriptionvoid
ConcurrentHashMap.forEachEntry
(long parallelismThreshold, Consumer<? super Map.Entry<K, V>> action) Performs the given action for each entry.<U> void
ConcurrentHashMap.forEachEntry
(long parallelismThreshold, Function<Map.Entry<K, V>, ? extends U> transformer, Consumer<? super U> action) Performs the given action for each non-null transformation of each entry.ConcurrentHashMap.reduceEntries
(long parallelismThreshold, BiFunction<Map.Entry<K, V>, Map.Entry<K, V>, ? extends Map.Entry<K, V>> reducer) Returns the result of accumulating all entries using the given reducer to combine values, or null if none.ConcurrentHashMap.reduceEntries
(long parallelismThreshold, BiFunction<Map.Entry<K, V>, Map.Entry<K, V>, ? extends Map.Entry<K, V>> reducer) Returns the result of accumulating all entries using the given reducer to combine values, or null if none.ConcurrentHashMap.reduceEntries
(long parallelismThreshold, BiFunction<Map.Entry<K, V>, Map.Entry<K, V>, ? extends Map.Entry<K, V>> reducer) Returns the result of accumulating all entries using the given reducer to combine values, or null if none.<U> U
ConcurrentHashMap.reduceEntries
(long parallelismThreshold, Function<Map.Entry<K, V>, ? extends U> transformer, BiFunction<? super U, ? super U, ? extends U> reducer) Returns the result of accumulating the given transformation of all entries using the given reducer to combine values, or null if none.double
ConcurrentHashMap.reduceEntriesToDouble
(long parallelismThreshold, ToDoubleFunction<Map.Entry<K, V>> transformer, double basis, DoubleBinaryOperator reducer) Returns the result of accumulating the given transformation of all entries using the given reducer to combine values, and the given basis as an identity value.int
ConcurrentHashMap.reduceEntriesToInt
(long parallelismThreshold, ToIntFunction<Map.Entry<K, V>> transformer, int basis, IntBinaryOperator reducer) Returns the result of accumulating the given transformation of all entries using the given reducer to combine values, and the given basis as an identity value.long
ConcurrentHashMap.reduceEntriesToLong
(long parallelismThreshold, ToLongFunction<Map.Entry<K, V>> transformer, long basis, LongBinaryOperator reducer) Returns the result of accumulating the given transformation of all entries using the given reducer to combine values, and the given basis as an identity value.<U> U
ConcurrentHashMap.searchEntries
(long parallelismThreshold, Function<Map.Entry<K, V>, ? extends U> searchFunction) Returns a non-null result from applying the given search function on each entry, or null if none. -
Uses of Map.Entry in java.util.jar
-
Uses of Map.Entry in javax.management.openmbean
-
Uses of Map.Entry in javax.script
-
Uses of Map.Entry in javax.xml.crypto.dom