ConcurrentLinkedDeque pop()方法在Java中的示例

Java.util.ConcurrentLinkedDeque.pop() 方法在Java中用于从ConcurrentLinkedDeque中弹出元素。该元素从ConcurrentLinkedDeque的顶部弹出，并从该队列中删除。

语法：

ConcurrentLinkedDeque.pop()

参数： 该方法不需要任何参数。

返回值： 此方法返回位于ConcurrentLinkedDeque顶部的元素，然后将其删除。

异常： 如果ConcurrentLinkedDeque为空，则抛出 EmptyConcurrentLinkedDequeException 。

下面的程序说明了Java.util.ConcurrentLinkedDeque.pop()方法：

程序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);
    }
}

输出：

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

程序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]