(Java)迭代器的简易实现

Java源代码：

import java.util.*;

public class IteratorDemo {

    public static void main(String[] args){





        List<String> arrList = new ArrayList<String>();

        for(int i = 0; i<5;i++){

            arrList.add(Integer.valueOf(i).toString());
        }

        Iterator<String> arrIt = arrList.iterator();

        while(arrIt.hasNext())
        {
            System.out.println(arrIt.next());
        }






        List<Integer> linkedList = new LinkedList<Integer>();

        for(int i = 0; i<5; i++){

            linkedList.add(Integer.valueOf(i));
        }

        Iterator<Integer> linkedListIt = linkedList.iterator();

        while(linkedListIt.hasNext()){

            System.out.println(linkedListIt.next());
        }









        Set<Float> set = new TreeSet<Float>();

        for(int i = 0; i <5; i++){
            set.add(Float.valueOf(i));
        }

        Iterator<Float> setIt = set.iterator();

        while(setIt.hasNext()){

            System.out.println(setIt.next());
        }










        linkedListIt = linkedList.iterator();

        while(linkedListIt.hasNext()){

            System.out.println(linkedListIt.next());

        }
    }

}

找出上述迭代器的使用规律