Java ConcurrentLinkedDeque Spliterator()方法及示例
ConcurrentLinkedDeque 的 spliterator() 方法在ConcurrentLinkedDeque的元素上返回一个Spliterator。返回的迭代器是弱一致性的。Spliterator可以在Java 8中与Streams一起使用。Spliterator也可以单独或批量地遍历元素。
语法
public Spliterator spliterator()
返回: 该方法在ConcurrentLinkedDeque的元素上返回一个Spliterator。
下面的程序说明了ConcurrentLinkedDeque的splitator()方法。
程序1 :
// Java Program to demonstrate spliterator()
// method of ConcurrentLinkedDeque
import java.util.concurrent.ConcurrentLinkedDeque;
import java.util.*;
public class GFG {
public static void main(String[] args)
{
// create object of ConcurrentLinkedDeque
ConcurrentLinkedDeque<Integer> CBD
= new ConcurrentLinkedDeque<Integer>();
// Add elements
CBD.add(22);
CBD.add(34);
CBD.add(45);
CBD.add(67);
// create Spliterator of Deque
// using spliterator() method
Spliterator<Integer> numbers
= CBD.spliterator();
// getExactSize of Spliterator
System.out.println("Size of Spliterator : "
+ numbers.estimateSize());
System.out.println("list of Numbers:");
// forEachRemaining method of Spliterator
numbers.forEachRemaining(
(n) -> System.out.println(n));
}
}
输出。
Size of Spliterator : 9223372036854775807
list of Numbers:
22
34
45
67
代码2
// Java Program to demonstrate spliterator()
// method of ConcurrentLinkedDeque
import java.util.concurrent.ConcurrentLinkedDeque;
import java.util.*;
public class GFG {
public static void main(String[] args)
{
// create object of ConcurrentLinkedDeque
ConcurrentLinkedDeque<String> CBD
= new ConcurrentLinkedDeque<String>();
// Add numbers to front of ConcurrentLinkedDeque
CBD.add("Geeks");
CBD.add("forGeeks");
CBD.add("A");
CBD.add("Computer");
CBD.add("Portal");
// create Spliterator of Deque
// using spliterator() method
Spliterator<String> numbers
= CBD.spliterator();
// getExactSize of Spliterator
System.out.println("Size of Spliterator : "
+ numbers.estimateSize());
System.out.println("list of Strings:");
// forEachRemaining method of Spliterator
numbers.forEachRemaining(
(n) -> System.out.println(n));
}
}
输出。
Size of Spliterator : 9223372036854775807
list of Strings:
Geeks
forGeeks
A
Computer
Portal