Java中的 LinkedTransferQueue spliterator() 方法

Java .util.concurrent.LinkedTransferQueue.spliterator()方法是Java中的一个内置函数，它在此队列的元素之间返回一个弱统一的 Spliterator。

句法：

LinkedTransferQueue.spliterator()  

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

返回值：该函数在此队列的元素之间返回一个 Spliterator。

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

方案一：

// Java Program Demonstrate Spliterator()
// method of LinkedTransferQueue 
  
import java.util.Spliterator;
import java.util.concurrent.LinkedTransferQueue;
  
class LinkedTransferQueueSpliteratorExample1 {
    public static void main(String[] args)
    {
        // Initializing the queue
        LinkedTransferQueue queue = 
                   new LinkedTransferQueue();
  
        // Adding elements to this queue
        queue.add("Gfg");
        queue.add("is");
        queue.add("best!!");
  
        // spliterator split and iterate
        // the split parts in parallel
        Spliterator str = queue.spliterator();
  
        // performs the action for each remaining element
        str.forEachRemaining(
            (n) -> {
                String lc = n.toUpperCase();
                System.out.println(" Lower case = " + n);
                System.out.println(" Upper case = " + lc);
                System.out.println();
            });
    }
}

输出：

Lower case = Gfg
 Upper case = GFG

 Lower case = is
 Upper case = IS

 Lower case = best!!
 Upper case = BEST!!

方案二：

// Java Program Demonstrate Spliterator()
// method of LinkedTransferQueue 
  
import java.util.Spliterator;
import java.util.concurrent.LinkedTransferQueue;
  
class LinkedTransferQueueSpliteratorExample2 {
    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 elements in the queue
        System.out.print("The elements in the queue are : ");
  
        // spliterator  split and iterate
        // the split parts in parallel
        Spliterator str = queue.spliterator();
  
        // if element exists tryAdvance() will perform action
        while (str.tryAdvance((n) -> System.out.print(n + " ")))
            ;
    }
}

输出：

The elements in the queue are : A 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