Overview | Package | Class | Use | Tree | Deprecated | Index | Help
| Java™ Platform Standard Ed. 6
PREV NEXT | FRAMES NO FRAMES

## Uses of Interface
java.util.Map.Entry

Packages that use Map.Entry
java.awt | Contains all of the classes for creating user interfaces and for painting graphics and images.
java.security | Provides the classes and interfaces for the security framework.
java.util | Contains the collections framework, legacy collection classes, event model, date and time facilities, internationalization, and miscellaneous utility classes (a string tokenizer, a random-number generator, and a bit array).
java.util.concurrent | Utility classes commonly useful in concurrent programming.
java.util.jar | 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.
javax.management.openmbean | Provides the open data types and Open MBean descriptor classes.
javax.script | The scripting API consists of interfaces and classes that define Java TM Scripting Engines and provides a framework for their use in Java applications.

Uses of Map.Entry in java.awt

Methods in java.awt that return types with arguments of type Map.Entry
`Set<Map.Entry<Object,Object>>` | `RenderingHints.entrySet()` Returns a `Set` view of the mappings contained in this `RenderingHints`.

Uses of Map.Entry in java.security

Methods in java.security that return types with arguments of type Map.Entry
`Set<Map.Entry<Object,Object>>` | `Provider.entrySet()` Returns an unmodifiable Set view of the property entries contained in this Provider.

Uses of Map.Entry in java.util

Classes in java.util that implement Map.Entry
`static class` | `AbstractMap.SimpleEntry<K,V>` An Entry maintaining a key and a value.
`static class` | `AbstractMap.SimpleImmutableEntry<K,V>` An Entry maintaining an immutable key and value.

Methods in java.util that return Map.Entry
`Map.Entry<K,V>` | `TreeMap.ceilingEntry(K key)`
`Map.Entry<K,V>` | `NavigableMap.ceilingEntry(K key)` Returns a key-value mapping associated with the least key greater than or equal to the given key, or `null` if there is no such key.
`Map.Entry<K,V>` | `TreeMap.firstEntry()`
`Map.Entry<K,V>` | `NavigableMap.firstEntry()` Returns a key-value mapping associated with the least key in this map, or `null` if the map is empty.
`Map.Entry<K,V>` | `TreeMap.floorEntry(K key)`
`Map.Entry<K,V>` | `NavigableMap.floorEntry(K key)` Returns a key-value mapping associated with the greatest key less than or equal to the given key, or `null` if there is no such key.
`Map.Entry<K,V>` | `TreeMap.higherEntry(K key)`
`Map.Entry<K,V>` | `NavigableMap.higherEntry(K key)` Returns a key-value mapping associated with the least key strictly greater than the given key, or `null` if there is no such key.
`Map.Entry<K,V>` | `TreeMap.lastEntry()`
`Map.Entry<K,V>` | `NavigableMap.lastEntry()` Returns a key-value mapping associated with the greatest key in this map, or `null` if the map is empty.
`Map.Entry<K,V>` | `TreeMap.lowerEntry(K key)`
`Map.Entry<K,V>` | `NavigableMap.lowerEntry(K key)` Returns a key-value mapping associated with the greatest key strictly less than the given key, or `null` if there is no such key.
`Map.Entry<K,V>` | `TreeMap.pollFirstEntry()`
`Map.Entry<K,V>` | `NavigableMap.pollFirstEntry()` Removes and returns a key-value mapping associated with the least key in this map, or `null` if the map is empty.
`Map.Entry<K,V>` | `TreeMap.pollLastEntry()`
`Map.Entry<K,V>` | `NavigableMap.pollLastEntry()` Removes and returns a key-value mapping associated with the greatest key in this map, or `null` if the map is empty.

Methods in java.util that return types with arguments of type Map.Entry
`Set<Map.Entry<K,V>>` | `EnumMap.entrySet()` Returns a `Set` view of the mappings contained in this map.
`Set<Map.Entry<K,V>>` | `WeakHashMap.entrySet()` Returns a `Set` view of the mappings contained in this map.
`Set<Map.Entry<K,V>>` | `TreeMap.entrySet()` Returns a `Set` view of the mappings contained in this map.
`Set<Map.Entry<K,V>>` | `IdentityHashMap.entrySet()` Returns a `Set` view of the mappings contained in this map.
`Set<Map.Entry<K,V>>` | `SortedMap.entrySet()` Returns a `Set` view of the mappings contained in this map.
`abstract Set<Map.Entry<K,V>>` | `AbstractMap.entrySet()`
`Set<Map.Entry<K,V>>` | `HashMap.entrySet()` Returns a `Set` view of the mappings contained in this map.
`Set<Map.Entry<K,V>>` | `Hashtable.entrySet()` Returns a `Set` view of the mappings contained in this map.
`Set<Map.Entry<K,V>>` | `Map.entrySet()` Returns a `Set` view of the mappings contained in this map.

Methods in java.util with parameters of type Map.Entry
`protected boolean` | `LinkedHashMap.removeEldestEntry(Map.Entry<K,V> eldest)` Returns `true` if this map should remove its eldest entry.

Constructors in java.util with parameters of type Map.Entry
`AbstractMap.SimpleEntry(Map.Entry<? extends K,? extends V> entry)` Creates an entry representing the same mapping as the specified entry.
`AbstractMap.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

Methods in java.util.concurrent that return Map.Entry
`Map.Entry<K,V>` | `ConcurrentSkipListMap.ceilingEntry(K key)` Returns a key-value mapping associated with the least key greater than or equal to the given key, or `null` if there is no such entry.
`Map.Entry<K,V>` | `ConcurrentSkipListMap.firstEntry()` Returns a key-value mapping associated with the least key in this map, or `null` if the map is empty.
`Map.Entry<K,V>` | `ConcurrentSkipListMap.floorEntry(K key)` Returns a key-value mapping associated with the greatest key less than or equal to the given key, or `null` if there is no such key.
`Map.Entry<K,V>` | `ConcurrentSkipListMap.higherEntry(K key)` Returns a key-value mapping associated with the least key strictly greater than the given key, or `null` if there is no such key.
`Map.Entry<K,V>` | `ConcurrentSkipListMap.lastEntry()` Returns a key-value mapping associated with the greatest key in this map, or `null` if the map is empty.
`Map.Entry<K,V>` | `ConcurrentSkipListMap.lowerEntry(K key)` Returns a key-value mapping associated with the greatest key strictly less than the given key, or `null` if there is no such key.
`Map.Entry<K,V>` | `ConcurrentSkipListMap.pollFirstEntry()` Removes and returns a key-value mapping associated with the least key in this map, or `null` if the map is empty.
`Map.Entry<K,V>` | `ConcurrentSkipListMap.pollLastEntry()` Removes and returns a key-value mapping associated with the greatest key in this map, or `null` if the map is empty.

Methods in java.util.concurrent that return types with arguments of type Map.Entry
`Set<Map.Entry<K,V>>` | `ConcurrentSkipListMap.entrySet()` Returns a `Set` view of the mappings contained in this map.
`Set<Map.Entry<K,V>>` | `ConcurrentHashMap.entrySet()` Returns a `Set` view of the mappings contained in this map.

Uses of Map.Entry in java.util.jar

Methods in java.util.jar that return types with arguments of type Map.Entry
`Set<Map.Entry<Object,Object>>` | `Attributes.entrySet()` Returns a Collection view of the attribute name-value mappings contained in this Map.

Uses of Map.Entry in javax.management.openmbean

Methods in javax.management.openmbean that return types with arguments of type Map.Entry
`Set<Map.Entry<Object,Object>>` | `TabularDataSupport.entrySet()` Returns a collection view of the index to row mappings contained in this `TabularDataSupport` instance.

Uses of Map.Entry in javax.script

Methods in javax.script that return types with arguments of type Map.Entry
`Set<Map.Entry<String,Object>>` | `SimpleBindings.entrySet()` Returns a `Set` view of the mappings contained in this map.

Overview | Package | Class | Use | Tree | Deprecated | Index | Help
| Java™ Platform Standard Ed. 6
PREV NEXT | FRAMES NO FRAMES

Submit a bug or feature
For further API reference and developer documentation, see Java SE Developer Documentation. That documentation contains more detailed, developer-targeted descriptions, with conceptual overviews, definitions of terms, workarounds, and working code examples.

Copyright © 1993, 2011, Oracle and/or its affiliates. All rights reserved.