HashTable forEach() method in Java with Examples
The forEach(BiConsumer) method of Hashtable class perform the BiConsumer operation on each entry of hashtable until all entries have been processed or the action throws an exception.
The BiConsumer operation is a function operation of key-value pair of hashtable performed in the order of iteration. Method traverses each element of Hashtable until all elements have been processed by the method or an exception occurs. Exceptions thrown by the Operation are passed to the caller.
Syntax:
public void
forEach(BiConsumer<? super K, ? super V> action)
Parameters: This method takes a parameter name BiConsumer which represents the action to be performed for each element.
Returns: This method returns nothing.
Exception: This method throws:
- NullPointerException: if the specified action is null.
Below programs illustrate the forEach(BiConsumer) method:
Program 1:
Java
import java.util.*;
public class GFG {
public static void main(String[] args)
{
Map<String, Integer>
table = new Hashtable<>();
table.put("Pen", 10 );
table.put("Book", 500 );
table.put("Clothes", 400 );
table.put("Mobile", 5000 );
table.put("Booklet", 2500 );
table.forEach((k, v) -> {
v = v + 100 ;
table.replace(k, v);
});
table.forEach(
(k, v) -> System.out.println("Key : " + k + ", Value : " + v));
}
}
|
Output:
Key : Booklet, Value : 2600
Key : Clothes, Value : 500
Key : Mobile, Value : 5100
Key : Pen, Value : 110
Key : Book, Value : 600
Program 2: To Show NullPointerException
Java
import java.util.*;
public class GFG {
public static void main(String[] args)
{
Map<Integer, String>
table = new Hashtable<>();
table.put( 1 , "100RS");
table.put( 2 , "500RS");
table.put( 3 , "1000RS");
try {
table.forEach((k, v) -> {
v = v + 100 ;
table.put( null , v);
});
}
catch (Exception e) {
System.out.println("Exception: " + e);
}
}
}
|
Output:
Exception: java.lang.NullPointerException
References: https://docs.oracle.com/javase/8/docs/api/java/util/Hashtable.html#forEach-java.util.function.BiConsumer-
Last Updated :
05 Jun, 2023
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...