How can Iterator can using in set(java)?

my question was why does iterator work on set?

Here is my example code,

public class Staticex {


    public static void main(String[] args) {
        HashSet set = new HashSet();

        set.add(1);
        set.add(2);
        set.add(3);
        set.add(4);
        set.add(5);

        Iterator iter = set.iterator();
        while (iter.hasNext()) {
            System.out.println(iter.next());
        }
    }
}

I understand, set is unordered, In contrast List

So, How can get the values ​​one by one through an iterator?

Is iterator changing set into like list which ordered data structure?

>Solution :

How can Iterator can using in set?

Like you are using it.

How can get the values ​​one by one through an iterator?

Your code is doing that.

Is iterator changing set into like list which ordered data structure?

No.

The thing that you are missing is what "unordered" means. It means that the order in which the (set’s) elements are returned is not predictable¹, and not specified in the javadocs. However each element will be returned once and (since the elements of a set are unique!) only once for the iteration.

^{1 – Actually, this is not strictly true. If you have enough information about the element class, the element values, how they were created and how / when they were added to the HashSet, AND you analyze the specific HashSet implementation … it is possible that you CAN predict what the iteration order is going to be. For example if you create a HashSet<Integer> and add 1, 2, 3, 4, … to it, you will see a clear (and repeatable) pattern when you iterate the elements. This is in part due to the way that Integer.hashCode() is specified.}