iterator设计模式(迭代模式)

1、迭代模式主要实现的就是容器与遍历的分离解耦，为容器提供了一个统一遍历的接口，开发人员调用容器遍历的时候不需要知道容器内部如何实现，只需要调用相应的接口就可以，不至于暴漏内部细节。符合单一职责原则的设计方法。

2、uml图如下

3、java代码实现如下

public class FclListIterator<T> implements Iterator<T> {
private FclList<T> fclList;
private int index = 0;
private int size = 0;


public FclListIterator(FclList<T> fclList) {
this.fclList = fclList;
size = fclList.size();
}


public int getSize() {
return size;
}


public boolean hasNext() {
if (index < size) {
return true;
}
return false;
}


public T next() {
T t = fclList.get(index);
index++;
return t;
}
}

public class FclList<T> implements Iterable<T> {
private List<T> list;


public int size() {
return list.size();
}


public FclList() {
list = new ArrayList<T>();
}


public void add(T t) {
list.add(t);
}


public T get(int i) {
return list.get(i);
}


public Iterator<T> iterator() {
return new FclListIterator(this);
}
}

public interface Iterable<T> {
public Iterator<T> iterator();
}

public interface Iterator<T> {
public boolean hasNext();
public T next();
}

public class Book {
private String name;


public String getName() {
return name;
}


public void setName(String name) {
this.name = name;
}
}

public class Main {
public static void main(String[] args) {
FclList<Book> fclList = new FclList<Book>();
Book book = new Book();
book.setName("a");
fclList.add(book);
Book book1 = new Book();
book1.setName("b");
fclList.add(book1);

Iterator<Book> iterator = fclList.iterator();
while(iterator.hasNext()){
Book book2 = iterator.next();
System.out.println(book2.getName());
}
}
}