ConcurrentLinkedDeque peek() method in Java with Example

The java.util.ConcurrentLinkedDeque.peek() method in Java is used to retrieve or fetch the element at the head of the Deque. The element retrieved does not get deleted or removed from the Deque instead the method just returns it. If no element is present in the deque then Null is returned.

Syntax:

Array_Deque.peek()

Parameters: The method does not take any parameter.

Return Value: The method returns the element at the head of the Deque.

Below programs illustrate the Java.util.ConcurrentLinkedDeque.peek() method:

Program 1:

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java code to illustrate peek()
  
import java.util.concurrent.*;
  
public class ConcurrentLinkedDequeDemo {
    public static void main(String args[])
    {
        // Creating an empty ConcurrentLinkedDeque
        ConcurrentLinkedDeque<String> de_que
            = new ConcurrentLinkedDeque<String>();
  
        // Use add() method to add elements into the Deque
        de_que.add("Welcome");
        de_que.add("To");
        de_que.add("Geeks");
        de_que.add("4");
        de_que.add("Geeks");
  
        // Displaying the ConcurrentLinkedDeque
        System.out.println("Initial ConcurrentLinkedDeque: "
                           + de_que);
  
        // Displaying the head
        System.out.println("The element at head is: "
                           + de_que.peek());
  
        // Displaying the ConcurrentLinkedDeque after operation
        System.out.println("Final ConcurrentLinkedDeque: "
                           + de_que);
    }
}

chevron_right


Output:

Initial ConcurrentLinkedDeque: [Welcome, To, Geeks, 4, Geeks]
The element at head is: Welcome
Final ConcurrentLinkedDeque: [Welcome, To, Geeks, 4, Geeks]

Program 2:

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java code to illustrate peek()
import java.util.concurrent.*;
  
public class ConcurrentLinkedDequeDemo {
    public static void main(String args[])
    {
        // Creating an empty ConcurrentLinkedDeque
        ConcurrentLinkedDeque<Integer> de_que
            = new ConcurrentLinkedDeque<Integer>();
  
        // Use add() method to add elements into the Deque
        de_que.add(10);
        de_que.add(15);
        de_que.add(30);
        de_que.add(20);
        de_que.add(5);
  
        // Displaying the ConcurrentLinkedDeque
        System.out.println("Initial ConcurrentLinkedDeque: "
                           + de_que);
  
        // Displaying the head
        System.out.println("The element at head is: "
                           + de_que.peek());
  
        // Displaying the ConcurrentLinkedDeque after operation
        System.out.println("Final ConcurrentLinkedDeque: "
                           + de_que);
    }
}

chevron_right


Output:

Initial ConcurrentLinkedDeque: [10, 15, 30, 20, 5]
The element at head is: 10
Final ConcurrentLinkedDeque: [10, 15, 30, 20, 5]

Program 3: For an empty deque:

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java code to illustrate peek()
import java.util.concurrent.*;
  
public class ConcurrentLinkedDequeDemo {
    public static void main(String args[])
    {
        // Creating an empty ConcurrentLinkedDeque
        ConcurrentLinkedDeque<Integer> de_que
            = new ConcurrentLinkedDeque<Integer>();
  
        // Displaying the ConcurrentLinkedDeque
        System.out.println("ConcurrentLinkedDeque: "
                           + de_que);
  
        // Displaying the head
        System.out.println("The element at head is: "
                           + de_que.peek());
    }
}

chevron_right


Output:

ConcurrentLinkedDeque: []
The element at head is: null


My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.