HashSet spliterator() method in Java
The spliterator() method of HashSet returns a Spliterator with the same elements as HashSet. The returned Spliterator is late-binding and fail-fast Spliterator. A late-binding Spliterator binds to the source of elements means HashSet at the point of first traversal, first split, or first query for estimated size, rather than at the time the Spliterator is created. It can be used with Streams in Java 8. Also it can traverse elements individually and in bulk too. Spliterator is better way to traverse over element because it provides more control on elements.
Syntax:
public Spliterator<E> spliterator()
Returns: This method returns a Spliterator over the elements in HashSet.
Below programs illustrate spliterator() method of HashSet:
Example 1: To demonstrate spliterator() method on HashSet which contains a set of Numbers.
import java.util.*;
public class GFG {
public static void main(String[] args)
{
HashSet<Integer> Numbers = new HashSet<Integer>();
Numbers.add( 23 );
Numbers.add( 32 );
Numbers.add( 45 );
Numbers.add( 63 );
Spliterator<Integer> numbers = Numbers.spliterator();
System.out.println( "list of Numbers:" );
numbers.forEachRemaining((n) -> System.out.println(n));
}
}
|
Output:
list of Numbers:
32
23
45
63
Example 2: To demonstrate spliterator() method on HashSet which contains set of Students Names.
import java.util.*;
public class GFG {
public static void main(String[] args)
{
HashSet<String> students = new HashSet<String>();
students.add( "Ram" );
students.add( "Mohan" );
students.add( "Sohan" );
students.add( "Rabi" );
Spliterator<String> names = students.spliterator();
System.out.println( "list of Students:" );
names.forEachRemaining(
(n) -> System.out.println( "Student Name: " + n));
}
}
|
Output:
list of Students:
Student Name: Rabi
Student Name: Mohan
Student Name: Sohan
Student Name: Ram
Reference: https://docs.oracle.com/javase/8/docs/api/java/util/HashSet.html#spliterator–
Last Updated :
10 Dec, 2018
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...