CS-Notes/notes/设计模式 - 迭代器.md

97 lines
2.1 KiB
Java
Raw Normal View History

2019-11-02 22:11:39 +08:00
## 迭代器Iterator
### Intent
提供一种顺序访问聚合对象元素的方法并且不暴露聚合对象的内部表示
### Class Diagram
- Aggregate 是聚合类其中 createIterator() 方法可以产生一个 Iterator
2019-11-30 16:45:47 +08:00
- Iterator 主要定义了 hasNext() next() 方法
2019-11-02 22:11:39 +08:00
- Client 组合了 Aggregate为了迭代遍历 Aggregate也需要组合 Iterator
2019-11-30 16:45:47 +08:00
<div align="center"> <img src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/image-20191130164425351.png" alt="image-20191130164425351" style="zoom: 67%;" /> </div><br>
2019-11-02 22:11:39 +08:00
### Implementation
```java
public interface Aggregate {
Iterator createIterator();
}
```
```java
public class ConcreteAggregate implements Aggregate {
private Integer[] items;
public ConcreteAggregate() {
items = new Integer[10];
for (int i = 0; i < items.length; i++) {
items[i] = i;
}
}
@Override
public Iterator createIterator() {
return new ConcreteIterator<Integer>(items);
}
}
```
```java
public interface Iterator<Item> {
Item next();
boolean hasNext();
}
```
```java
public class ConcreteIterator<Item> implements Iterator {
private Item[] items;
private int position = 0;
public ConcreteIterator(Item[] items) {
this.items = items;
}
@Override
public Object next() {
return items[position++];
}
@Override
public boolean hasNext() {
return position < items.length;
}
}
```
```java
public class Client {
public static void main(String[] args) {
Aggregate aggregate = new ConcreteAggregate();
Iterator<Integer> iterator = aggregate.createIterator();
while (iterator.hasNext()) {
System.out.println(iterator.next());
}
}
}
```
### JDK
- [java.util.Iterator](http://docs.oracle.com/javase/8/docs/api/java/util/Iterator.html)
- [java.util.Enumeration](http://docs.oracle.com/javase/8/docs/api/java/util/Enumeration.html)
<div align="center"><img width="320px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/githubio/公众号二维码-2.png"></img></div>