23种设计模式之迭代器模式(22)

  • 迭代器模式(Iterator),提供一种方法顺序访问一个聚合对象中各个元素,而又不暴露该对象的内部表示。
    在这里插入图片描述
/**
 * 迭代器抽象类
 * @date 2020/9/24
 */
public abstract class Iterator {
    public abstract Object first();
    public abstract Object next();
    public abstract Boolean isDone();
    public abstract Object currentItem();
}
/**
 * 创建迭代器
 * @date 2020/9/24
 */
public abstract class Aggregate {
    public abstract Iterator createIterator();
}
public class ConcreteAggregate extends Aggregate{
    private List<Object> items = new ArrayList<>();

    @Override public Iterator createIterator() {
        return new ConcreteIterator(this);
    }

    public int getCount() {
        return items.size();
    }

    public Object indexGet(int index){
        return items.indexOf(index);
    }

    public void add(Object obj){
        items.add(obj);
    }
}
/**
 * 具体迭代器A
 * @date 2020/9/24
 */
public class ConcreteIterator extends Iterator{
    private ConcreteAggregate aggregate;
    private int current = 0;

    public ConcreteIterator(ConcreteAggregate aggregate) {
        this.aggregate = aggregate;
    }

    @Override public Object first() {
        return aggregate.indexGet(0);
    }

    @Override public Object next() {
        Object ret = null;
        current++;
        if (current < aggregate.getCount()) {
            ret = aggregate.indexGet(current);
        }
        return ret;
    }

    @Override public Boolean isDone() {
        return current >= aggregate.getCount() ? true : false;
    }

    @Override public Object currentItem() {
        return this.current;
    }
}
/**
 * 具体迭代器B
 * @date 2020/9/24
 */
public class ConcreteIteratorDesc extends Iterator{
    private ConcreteAggregate aggregate;
    private int current = 0;

    public ConcreteIteratorDesc(ConcreteAggregate aggregate) {
        this.aggregate = aggregate;
        current = aggregate.getCount()-1;
    }

    @Override public Object first() {
        return aggregate.indexGet(aggregate.getCount()-1);
    }

    @Override public Object next() {
        Object ret = null;
        current--;
        if (current >= 0) {
            ret = aggregate.indexGet(current);
        }
        return ret;
    }

    @Override public Boolean isDone() {
        return current < 0 ? true : false;
    }

    @Override public Object currentItem() {
        return this.current;
    }
}
public class IteratorMain {
    public static void main(String[] args) {
        final ConcreteAggregate a = new ConcreteAggregate();
        a.add("大鸟");
        a.add("小菜");
        a.add("行李");
        a.add("老外");
        a.add("公交内部员工");
        a.add("小偷");

//        final Iterator i = new ConcreteIterator(a);
        final Iterator i = new ConcreteIteratorDesc(a);
        final Object item = i.first();
        while(!i.isDone()) {
            System.out.println(i.currentItem()+"请买车票");
            i.next();
        }
    }
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值