RetroSearch Browse

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://www.geeksforgeeks.org/java/linkedblockingdeque-foreach-method-in-java-with-examples/ below:

LinkedBlockingDeque forEach() method in Java with Examples

Last Updated : 11 Jul, 2025

The

forEach()

method of

LinkedBlockingDeque

performs the given action for each element of the Iterable until all elements have been processed or the action throws an exception.

Syntax:

public void forEach(Consumer<E> action)

Parameters:

This method takes a parameter action which represents the action to be performed for each element.

Return Value:

This method does not returns anything.

Exceptions:

This method throws

NullPointerException

if the specified action is null. Below program illustrates the forEach() function of LinkedBlockingDeque class:

Example: Java


 // Java Program Demonstrate forEach()
// method of LinkedBlockingDeque

import java.util.concurrent.LinkedBlockingDeque;
import java.util.*;

public class GFG {
    public static void main(String[] args)
        throws IllegalStateException
    {

        // create object of LinkedBlockingDeque
        LinkedBlockingDeque<Integer> LBD
            = new LinkedBlockingDeque<Integer>();

        // Add numbers to end of LinkedBlockingDeque
        LBD.add(11);
        LBD.add(22);
        LBD.add(33);
        LBD.add(44);
        LBD.add(55);
        LBD.add(66);
        LBD.add(77);

        // print deque
        System.out.println("Linked Blocking Deque: "
                           + LBD);

        System.out.println("Traversing this Deque: ");

        // Traverse this queue using forEach() method
        LBD.forEach((n) -> System.out.println(n));
    }
}

Output:

Linked Blocking Deque: [11, 22, 33, 44, 55, 66, 77]
Traversing this Deque: 
11
22
33
44
55
66
77

Example: 2 Java


 // Java Program Demonstrate forEach()
// method of LinkedBlockingDeque

import java.util.concurrent.LinkedBlockingDeque;
import java.util.*;

public class GFG {
    public static void main(String[] args)
        throws IllegalStateException
    {

        // create object of LinkedBlockingDeque
        LinkedBlockingDeque<String> LBD
            = new LinkedBlockingDeque<String>();

        // Add elements to end of LinkedBlockingDeque
        LBD.add("GeeksforGeeks");
        LBD.add("Gfg");
        LBD.add("Geeks");
        LBD.add("Computer");
        LBD.add("Science");
        LBD.add("Portal");

        // print deque
        System.out.println("Linked Blocking Deque: "
                           + LBD);

        System.out.println("Traversing this deque: ");

        // Traverse this deque using forEach() method
        LBD.forEach((n) -> System.out.println(n));
    }
}

Output:

Linked Blocking Deque: [GeeksforGeeks, Gfg, Geeks, Computer, Science, Portal]
Traversing this deque: 
GeeksforGeeks
Gfg
Geeks
Computer
Science
Portal

Reference: https://docs.oracle.com/javase/9/docs/api/java/util/concurrent/LinkedBlockingDeque.html#forEach-java.util.function.Consumer-

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4