迭代子模式

22 篇文章 0 订阅
22 篇文章 0 订阅

一种方法顺序访问一个聚合对象中各个元素, 而又无须暴露该对象的内部表示。分为:宽接口聚集,又叫做白盒聚合;窄接口聚合,又叫做黑盒聚合;区别在于白盒聚合向外部提供了操作聚合元素的方法。

白盒聚合

/**
 *  * 外部迭代接口
 */
public interface Iterator {
    boolean hasNext();

    String next();
}

public interface Aggregate {
    Iterator getIterator();
}

public class FruitIterator implements Iterator {

    private int size;
    private int index;
    private FruitAggregate fruitAggregate;

    public FruitIterator(FruitAggregate fruitAggregate) {
        this.size = fruitAggregate.getSize();
        this.index = 0;
        this.fruitAggregate = fruitAggregate;
    }

    @Override
    public boolean hasNext() {
        return index < size;
    }

    @Override
    public String next() {
        return fruitAggregate.getFruit(index++);
    }
}

public class FruitAggregate implements Aggregate {

    private List<String> fruits;

    public FruitAggregate(List<String> fruits) {
        this.fruits = fruits;
    }

    @Override
    public Iterator getIterator() {
        return new FruitIterator(this);
    }

    // 以下是对外提供的操作聚合元素的方法
    public int getSize() {
        return fruits.size();
    }

    public String getFruit(int index) {
        return fruits.get(index);
    }
}

@Test
public void WhiteIteratorTest() {
    String[] fruitArray = {"apple", "banana", "strawberry"};
    List<String> fruits = new ArrayList<String>(Arrays.asList(fruitArray));
    FruitAggregate fruitAggregate = new FruitAggregate(fruits);
    Iterator iterator = fruitAggregate.getIterator();
    while (iterator.hasNext()) {
        System.out.println(iterator.next());
    }
}

黑盒聚合

public class FruitAggregate implements Aggregate {

    private List<String> fruits;

    public FruitAggregate(List<String> fruits) {
        this.fruits = fruits;
    }

    @Override
    public Iterator getIterator() {
        return new FruitIterator();
    }

    // 内部类
    private class FruitIterator implements Iterator {

        private int size;
        private int index;

        public FruitIterator() {
            this.size = fruits.size();
            this.index = 0;
        }

        @Override
        public boolean hasNext() {
            return index < size;
        }

        @Override
        public String next() {
            return fruits.get(index++);
        }
    }
}

@Test
public void WhiteIteratorTest() {
    String[] fruitArray = {"apple", "banana", "strawberry"};
    List<String> fruits = new ArrayList<String>(Arrays.asList(fruitArray));
    FruitAggregate fruitAggregate = new FruitAggregate(fruits);
    Iterator iterator = fruitAggregate.getIterator();
    while (iterator.hasNext()) {
        System.out.println(iterator.next());
    }
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值