Método ConcurrentLinkedDeque pop() en Java con ejemplos

El método Java.util.ConcurrentLinkedDeque.pop() en Java se usa para extraer un elemento de ConcurrentLinkedDeque. El elemento se extrae de la parte superior de ConcurrentLinkedDeque y se elimina del mismo.
Sintaxis: 
 

ConcurrentLinkedDeque.pop()

Parámetros: El método no toma ningún parámetro.
Valor devuelto: este método devuelve el elemento presente en la parte superior de ConcurrentLinkedDeque y luego lo elimina.
Excepciones: el método arroja EmptyConcurrentLinkedDequeException si ConcurrentLinkedDeque está vacío.
Los siguientes programas ilustran el método Java.util.ConcurrentLinkedDeque.pop():
Programa 1:
 

// Java code to illustrate pop()
 
import java.util.*;
import java.util.concurrent.*;
 
public class ConcurrentLinkedDequeDemo {
    public static void main(String args[])
    {
        // Creating an empty ConcurrentLinkedDeque
        ConcurrentLinkedDeque<String> CLD
            = new ConcurrentLinkedDeque<String>();
 
        // Use add() method to add elements
        CLD.push("Welcome");
        CLD.push("To");
        CLD.push("Geeks");
        CLD.push("For");
        CLD.push("Geeks");
 
        // Displaying the ConcurrentLinkedDeque
        System.out.println("Initial ConcurrentLinkedDeque: "
                           + CLD);
 
        // Removing elements using pop() method
        System.out.println("Popped element: " + CLD.pop());
        System.out.println("Popped element: " + CLD.pop());
 
        // Displaying the ConcurrentLinkedDeque after pop operation
        System.out.println("ConcurrentLinkedDeque after pop operation "
                           + CLD);
    }
}

Producción:

Initial ConcurrentLinkedDeque: [Geeks, For, Geeks, To, Welcome]
Popped element: Geeks
Popped element: For
ConcurrentLinkedDeque after pop operation [Geeks, To, Welcome]

Programa 2:
 

// Java code to illustrate pop()
 
import java.util.*;
import java.util.concurrent.*;
 
public class ConcurrentLinkedDequeDemo {
    public static void main(String args[])
    {
        // Creating an empty ConcurrentLinkedDeque
        ConcurrentLinkedDeque<Integer> CLD
            = new ConcurrentLinkedDeque<Integer>();
 
        // Use add() method to add elements
        CLD.push(10);
        CLD.push(15);
        CLD.push(30);
        CLD.push(20);
        CLD.push(5);
 
        // Displaying the ConcurrentLinkedDeque
        System.out.println("Initial ConcurrentLinkedDeque: "
                           + CLD);
 
        // Removing elements using pop() method
        System.out.println("Popped element: " + CLD.pop());
        System.out.println("Popped element: " + CLD.pop());
 
        // Displaying the ConcurrentLinkedDeque after pop operation
        System.out.println("ConcurrentLinkedDeque after pop operation "
                           + CLD);
    }
}

Initial ConcurrentLinkedDeque: [5, 20, 30, 15, 10]
Popped element: 5
Popped element: 20
ConcurrentLinkedDeque after pop operation [30, 15, 10]