迭代器模式

public class Client {
    public static void main(String[] args) {
        /*
        迭代器模式
         */
        Aggregate aggregate = new ConcreteAggregate();
        aggregate.add("《操作系统》");
        aggregate.add("《程序设计》");
        aggregate.add("《设计模式》");
        aggregate.add("《数据结构》");
        aggregate.add("《计算机组成原理》");

        Iterator iterator = aggregate.getIterator();
        while (iterator.hasNext()) {
            System.out.println(iterator.next().toString() + "\t");
        }
        System.out.println("\nFirst:" + iterator.first().toString());
        System.out.println("\nFirst:" + iterator.currentItem().toString());
    }
}
public interface Aggregate {
    void add(Object object);

    void remove(Object object);

    Iterator getIterator();
}
public interface Iterator {
    Object first();

    Object next();

    boolean hasNext();

    Object currentItem();
}
import java.util.ArrayList;
import java.util.List;

public class ConcreteAggregate implements Aggregate {
    private List<Object> list = new ArrayList<>();

    @Override
    public void add(Object object) {
        list.add(object);
    }

    @Override
    public void remove(Object object) {
        list.remove(object);
    }

    @Override
    public Iterator getIterator() {
        return (new ConcreteIterator(list));
    }
}
import java.util.List;

public class ConcreteIterator implements Iterator {
    private List<Object> list;
    private int index = -1;

    public ConcreteIterator(List<Object> list) {
        this.list = list;
    }


    @Override
    public Object first() {
        index = 0;
        return list.get(index);
    }

    @Override
    public Object next() {
        Object object = null;
        if (this.hasNext()) {
            object = list.get(++index);
        }
        return object;
    }

    @Override
    public boolean hasNext() {
        return index < list.size() - 1;
    }

    @Override
    public Object currentItem() {
        return list.get(index);
    }
}

import java.util.Collection;
import java.util.HashSet;

public class test{
    public static void main(String[] args) {
        Collection<String> list = new HashSet<>();
        list.add("《操作系统》");
        list.add("《程序设计》");
        list.add("《设计模式》");
        list.add("《数据结构》");
        list.add("《计算机组成原理》");

        for (String s : list) {
            System.out.println(s);
        }
    }
}
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值