LinkedBlockingDeque peek() method in Java

LinkedBlockingDeque peek() method in Java

Last Updated : 14 Sep, 2018

The peek() method of LinkedBlockingDeque returns the front element in the Deque container. It returns null if the container is empty. Syntax:

public E peek()

Parameters: This method does not accept any parameters. Returns: This method returns front element in the Deque container if the container is not empty. It returns false if the container is empty. Below programs illustrate peek() method of LinkedBlockingDeque: Program 1:

Java

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

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

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

    {

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

        // Add numbers to end of LinkedBlockingDeque
        LBD.add(7855642);
        LBD.add(35658786);
        LBD.add(5278367);
        LBD.add(74381793);

        // Print the queue
        System.out.println("Linked Blocking Deque: " + LBD);

        System.out.println("Front element in Deque: " + LBD.peek());
    }
}

Output:

Linked Blocking Deque: [7855642, 35658786, 5278367, 74381793]
Front element in Deque: 7855642

Program 2:

Java

// Java Program Demonstrate peek()
// method of LinkedBlockingDeque
// when Deque is empty

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

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

    {

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

        // Add numbers to end of LinkedBlockingDeque
        LBD.add(7855642);
        LBD.add(35658786);
        LBD.add(5278367);
        LBD.add(74381793);

        // Print the queue
        System.out.println("Linked Blocking Deque: " + LBD);

        // empty deque
        LBD.clear();

        System.out.println("Front element in Deque: " + LBD.peek());
    }
}

Output:

Linked Blocking Deque: [7855642, 35658786, 5278367, 74381793]
Front element in Deque: null

Reference: https://docs.oracle.com/javase/7/docs/api/java/util/concurrent/LinkedBlockingDeque.html#peek()

LinkedBlockingDeque peek() method in Java

G

gopaldave

Improve

Article Tags :

Practice Tags :

Similar Reads

LinkedBlockingDeque iterator() method in Java

The iterator() method of LinkedBlockingDeque returns an iterator over the elements in this deque in a proper sequence. The elements will be returned in order from first (head) to last (tail). The returned iterator is a "weakly consistent" iterator. Syntax: public Iterator iterator() Parameters: This

LinkedBlockingDeque peekLast() method in Java

The peekLast() method of LinkedBlockingDeque returns the last element in the Deque container, but does not deletes it. It returns null if the container is empty. Syntax: public E peekLast() Parameters: This method does not accept any parameters. Returns: This method returns last element in the Deque

LinkedBlockingDeque offer() method in Java

The offer(E e) method of LinkedBlockingDeque inserts the element passed in the parameter to the end of the Deque. If the container's capacity has exceeded, then it does not returns an exception as in case of add() and addFirst() function. Syntax: public boolean offer(E e) Parameters: This method acc

LinkedBlockingDeque element() method in Java

The element() method of LinkedBlockingDeque returns the element at the front the container. It does not deletes the element in the container. This method returns the head of the queue represented by this deque. Syntax: public void element() Parameters: This method does not accept any parameter. Retu

LinkedBlockingDeque addFirst() method in Java

The addFirst(E e) method of LinkedBlockingDeque inserts the element passed in the parameter to the front of the Deque if there is space. If the LinkedBlockingDeque is capacity restricted and no space is left for insertion, it returns an IllegalStateException. Syntax: public void addFirst(E e) Parame

LinkedBlockingDeque pop() method in Java

The pop() method of LinkedBlockingDeque pops an element from the stack represented by this deque. In other words, it removes and returns the first element of this deque. It returns null if the container is empty. Syntax: public E pop() Parameters: This method does not accept any parameters. Returns:

LinkedBlockingDeque getFirst() method in Java

The getFirst() method of LinkedBlockingDeque returns the front most element in the Deque container. If the LinkedBlockingDeque is empty, then on function call it returns a NoSuchElementException. Syntax: public E getLast() Parameters: This method does not accept any parameters. Returns: This method

LinkedBlockingDeque clear() method in Java

The clear() method of LinkedBlockingDeque erases all the elements that are present in the LinkedBlockingDeque container. The container becomes empty after the function is called. Syntax: public void clear() Parameters: This method does not accepts any parameters Returns: This method does not returns

LinkedBlockingDeque getLast() method in Java

The getLast() method of LinkedBlockingDeque returns the last element in the Deque container. If the LinkedBlockingDeque is empty, then on function call it returns a NoSuchElementException. Syntax: public E getLast() Parameters: This method does not accept any parameters. Returns: This method returns

LinkedBlockingDeque descendingIterator() method in Java

The descendingIterator() method of LinkedBlockingDeque returns an iterator over the elements in this deque in a reverse sequential order. The elements will be returned in order from last(tail) to first(head). The returned iterator is a "weakly consistent" iterator. Syntax: public Iterator descending