迭代器模式的作用,是為不同的容器提供統一的遍歷方式——使用者不必關心底層是數組、鏈表還是哈希結構,只需反覆調用 hasNext() 與 next()。本文以 Java 集合為原型,從零模擬一遍它的原理。
package com.njupt.zhb.learn.iterator;
public interface Collection {
void add(Object o);
int size();
Iterator iterator();
}
注意第三個方法:容器只負責「生產」迭代器,不負責遍歷細節。
package com.njupt.zhb.learn.iterator;
public interface Iterator {
Object next();
boolean hasNext();
}
用數組存數據,容量不夠時自動翻倍擴容;迭代器以內部類形式實現,各自持有獨立的游標:
package com.njupt.zhb.learn.iterator;
import com.njupt.zhb.learn.iterator.Collection;
public class ArrayList implements Collection {
Object[] objects = new Object[10];
int index = 0;
public void add(Object o) {
if(index == objects.length) {
Object[] newObjects = new Object[objects.length * 2];
System.arraycopy(objects, 0, newObjects, 0, objects.length);
objects = newObjects;
}
objects[index] = o;
index ++;
}
public int size() {
return index;
}
public Iterator iterator() {
return new ArrayListIterator();
}
private class ArrayListIterator implements Iterator {
private int currentIndex = 0;
@Override
public boolean hasNext() {
if(currentIndex >= index) return false;
else return true;
}
@Override
public Object next() {
Object o = objects[currentIndex];
currentIndex ++;
return o;
}
}
}
兩個細節值得留意:游標 currentIndex 是迭代器自己的成員,所以同一容器可以同時有多個迭代器互不干擾;內部類能直接訪問外部類的 index 與 objects,無需暴露私有字段。
package com.njupt.zhb.learn.iterator;
import com.njupt.zhb.learn.iterator.ArrayList;
public class TestMain {
public static void main(String[] args) {
Collection c = new ArrayList();
for(int i=0; i<15; i++) {
c.add("string "+i);
}
System.out.println(c.size());
Iterator it = c.iterator();
while(it.hasNext()) {
Object o = it.next();
System.out.println(o.toString() + " ");
}
}
}
15
string 0
string 1
string 2
string 3
string 4
string 5
string 6
string 7
string 8
string 9
string 10
string 11
string 12
string 13
string 14