Uses of Interface
java.util.Map.Entry

Packages that use Map.Entry

Package	Description
java.util	Back 2 Browser Bytecode Translator Copyright (C) 2012 Jaroslav Tulach This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, version 2 of the License.
java.util.concurrent

Uses of Map.Entry in java.util

Classes in java.util that implement Map.Entry

Modifier and Type	Class and Description
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

Modifier and Type	Method and Description
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

Modifier and Type	Method and Description
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>>	SortedMap.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.
Set<Map.Entry<K,V>>	IdentityHashMap.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>>	HashMap.entrySet() Returns a Set view of the mappings contained in this map.
Set<Map.Entry<K,V>>	EnumMap.entrySet() Returns a Set view of the mappings contained in this map.
abstract Set<Map.Entry<K,V>>	AbstractMap.entrySet()

Methods in java.util with parameters of type Map.Entry

Modifier and Type	Method and Description
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

Constructor and Description
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 types with arguments of type Map.Entry

Modifier and Type	Method and Description
Set<Map.Entry<K,V>>	ConcurrentHashMap.entrySet()