1.定义
迭代器模式:提供一种方法顺序访问一个聚合对象中的各个元素,而又不暴露其内部的表示。 把在元素之间游走的责任交给迭代器,而不是聚合对象,这不仅简化了聚合的接口和实现,也让聚合更专注在它所应该专注的事情上,让责任者各得其所。
2.结构类图
3.代码实现
聚合接口:
public interface Aggregate {
void add(Object obj);
void remove(Object obj);
Iterator iterator();
}
具体的聚合接口实现:
import java.util.ArrayList;
import java.util.List;
public class ConcreteAggregate implements Aggregate {
List list = new ArrayList();
@Override
public void add(Object obj) {
list.add(obj);
}
@Override
public void remove(Object obj) {
list.remove(obj);
}
@Override
public Iterator iterator() {
return new ConcreteIterator(list);
}
}
迭代器接口:
public interface Iterator {
boolean hasNext();
Object next();
}
具体的迭代器接口实现:
import java.util.ArrayList;
import java.util.List;
import java.util.NoSuchElementException;
public class ConcreteIterator implements Iterator{
private List list = new ArrayList();
private int cursor = 0;
public ConcreteIterator(List list) {
this.list = list;
}
@Override
public boolean hasNext() {
if(cursor == list.size()){
return false;
}
return true;
}
@Override
public Object next() {
if(cursor > list.size()){
throw new NoSuchElementException();
}
return list.get(cursor++);
}
}
client类(在这里是个测试类):
public class Client {
public static void main(String[] args) {
Aggregate aggregate = new ConcreteAggregate();
aggregate.add("123");
aggregate.add("456");
aggregate.add("789");
aggregate.remove("123");
Iterator iterator = aggregate.iterator();
while (iterator.hasNext()){
System.out.println(iterator.next());
}
}
}