HashSet iterator() Method in Java
The Java.util.HashSet.iterator() method is used to return an iterator of the same elements as the hash set. The elements are returned in random order from what present in the hash set.
Syntax:
Iterator iterate_value = Hash_Set.iterator();
Parameters: The function does not take any parameter.
Return Value: The method iterates over the elements of the hash set and returns the values(iterators).
Below program illustrate the Java.util.HashSet.iterator() method:
// Java code to illustrate iterator() import java.util.*; import java.util.HashSet; public class HashSetDemo { public static void main(String args[]) { // Creating an empty HashSet HashSet<String> set = new HashSet<String>(); // Use add() method to add elements into the Set set.add( "Welcome" ); set.add( "To" ); set.add( "Geeks" ); set.add( "4" ); set.add( "Geeks" ); // Displaying the HashSet System.out.println( "HashSet: " + set); // Creating an iterator Iterator value = set.iterator(); // Displaying the values after iterating through the set System.out.println( "The iterator values are: " ); while (value.hasNext()) { System.out.println(value.next()); } } } |
HashSet: [4, Geeks, Welcome, To] The iterator values are: 4 Geeks Welcome To
Recommended Posts:
- HashSet add() Method in Java
- HashSet contains() Method in Java
- HashSet retainAll() method in Java with Example
- HashSet remove() Method in Java
- HashSet size() Method in Java
- HashSet toArray(T[]) method in Java with Example
- HashSet removeAll() method in Java with Example
- HashSet isEmpty() Method in Java
- HashSet spliterator() method in Java
- HashSet equals() method in Java with Example
- HashSet hashCode() method in Java with Example
- HashSet containsAll() method in Java with Example
- HashSet toString() method in Java with Example
- HashSet clone() Method in Java
- HashSet clear() Method in Java
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.