- Java.util Package Classes
- Java.util - Home
- Java.util - ArrayDeque
- Java.util - ArrayList
- Java.util - Arrays
- Java.util - BitSet
- Java.util - Calendar
- Java.util - Collections
- Java.util - Currency
- Java.util - Date
- Java.util - Dictionary
- Java.util - EnumMap
- Java.util - EnumSet
- Java.util - Formatter
- Java.util - GregorianCalendar
- Java.util - HashMap
- Java.util - HashSet
- Java.util - Hashtable
- Java.util - IdentityHashMap
- Java.util - LinkedHashMap
- Java.util - LinkedHashSet
- Java.util - LinkedList
- Java.util - ListResourceBundle
- Java.util - Locale
- Java.util - Observable
- Java.util - PriorityQueue
- Java.util - Properties
- Java.util - PropertyPermission
- Java.util - PropertyResourceBundle
- Java.util - Random
- Java.util - ResourceBundle
- Java.util - ResourceBundle.Control
- Java.util - Scanner
- Java.util - ServiceLoader
- Java.util - SimpleTimeZone
- Java.util - Stack
- Java.util - StringTokenizer
- Java.util - Timer
- Java.util - TimerTask
- Java.util - TimeZone
- Java.util - TreeMap
- Java.util - TreeSet
- Java.util - UUID
- Java.util - Vector
- Java.util - WeakHashMap
- Java.util Package Extras
- Java.util - Interfaces
- Java.util - Exceptions
- Java.util - Enumerations
- Java.util Useful Resources
- Java.util - Useful Resources
- Java.util - Discussion
java.util.WeakHashMap.entrySet() Method
Description
The entrySet() method is used to return a collection view of the mappings contained in this map. Each element in the returned collection is a Map.Entry. The collection is backed by the map, so changes to the map are reflected in the collection and reverse.
Declaration
Following is the declaration for java.util.WeakHashMap.entrySet() method.
public Set<Map.Entry<K,V>> entrySet()
Parameters
NA
Return Value
The method call returns a collection view of the mappings contained in this map.
Exception
NA
Example
The following example shows the usage of java.util.WeakHashMap.entrySet() method.
package com.tutorialspoint; import java.util.Map; import java.util.Set; import java.util.WeakHashMap; public class WeakHashMapDemo { public static void main(String[] args) { Map<String, String> weakHashMap = new WeakHashMap<String, String>(); // put keys and values in the Map weakHashMap.put("1", "first"); weakHashMap.put("2", "two"); weakHashMap.put("3", "three"); // printing the Map System.out.println("Map: "+weakHashMap); // returns a Set view of the Map Set set = weakHashMap.entrySet(); // printing the set System.out.println("Set: "+set); // change Map value System.out.println("Changing map"); weakHashMap.put("3", "new value"); // print Map and set System.out.println("Changed Map: "+weakHashMap); System.out.println("Changed Set: "+set); } }
Let us compile and run the above program, this will produce the following result.
Map: {1=first, 2=two, 3=three} Set: [1=first, 2=two, 3=three] Changing map Changed Map: {1=first, 2=two, 3=new value} Changed Set: [1=first, 2=two, 3=new value]
java_util_weakhashmap.htm
Advertisements