Java LinkedTransferQueue spliterator()用法及代码示例

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

用法:

LinkedTransferQueue.spliterator()

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

返回值：该函数在此队列的各个元素之间返回一个分隔符。

以下示例程序旨在说明LinkedTransferQueue.spliterator()方法：

示例1:

// 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<String> queue =  
                   new LinkedTransferQueue<String>(); 
  
        // Adding elements to this queue 
        queue.add("Gfg"); 
        queue.add("is"); 
        queue.add("best!!"); 
  
        // spliterator split and iterate 
        // the split parts in parallel 
        Spliterator<String> 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!!

示例2:

// 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<Character> queue = 
                  new LinkedTransferQueue<Character>(); 
  
        // 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<Character> 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

相关用法

注：本文由纯净天空筛选整理自rupesh_rao大神的英文原创作品 LinkedTransferQueue spliterator() method in Java。非经特殊声明，原始代码版权归原作者所有，本译文未经允许或授权，请勿转载或复制。