Java中的 LinkedTransferQueue poll() 方法

Java .util.concurrent.LinkedTransferQueue.poll()方法是Java中的一个内置函数，如果队列非空，它会检索并删除队列的头部。

句法：

LinkedTransferQueue.poll()  

参数：该函数不接受任何参数。

返回值：如果队列非空，函数返回队列头，否则返回null。

下面的程序说明了 LinkedTransferQueue.poll() 方法：

方案一：

/* Java Program Demonstrate poll()
   method of LinkedTransferQueue */
  
import java.util.concurrent.LinkedTransferQueue;
  
class LinkedTransferQueuePollExample1 {
    public static void main(String[] args)
    {
        // Initializing the queue
        LinkedTransferQueue queue = 
                       new LinkedTransferQueue();
  
        // Adding elements to this queue
        for (char ch = 'A'; ch <= 'Z'; ch++) {
            queue.add(ch);
        }
  
        // Printing the head of the queue
        System.out.println("The head of the queue is " 
                                           + queue.poll());
  
        // Printing remaining elements of the queue
        System.out.println("The elements in the queue :");
        for (Character i : queue)
            System.out.print(i + " ");
    }
}

输出：

The head of the queue is A
The elements in the queue :
B C D E F G H I J K L M N O P Q R S T U V W X Y Z

方案二：

/* Java Program Demonstrate poll()
   method of LinkedTransferQueue */
  
import java.util.concurrent.LinkedTransferQueue;
  
class LinkedTransferQueuePollExample2 {
    public static void main(String[] args)
    {
        // Initializing the queue
        LinkedTransferQueue queue = 
                     new LinkedTransferQueue();
  
        // Adding elements to this queue
        for (int i = 10; i <= 50; i += 10)
            queue.add(i);
  
        // Printing the head of the queue
        System.out.println("The head of the queue is " 
                                           + queue.poll());
  
        // Printing remaining elements of the queue
        System.out.println("The elements in the queue :");
        for (Integer i : queue)
            System.out.print(i + " ");
    }
}

输出：

The head of the queue is 10
The elements in the queue :
20 30 40 50

参考：https: Java/util/concurrent/LinkedTransferQueue.html#poll()