设计模式-迭代器模式

设计模式-迭代器模式

基本介绍

  1. 迭代器模式(Iterator Pattern)是常用设计模式,属于行为模式
  2. 如果我们的集合元素是不同方式实现的,有数组,还有java的集合类,或者还有其他方式,当客户端要遍历这些元素的时候就要使用多种遍历方式,而且还会暴露元素的内部结构,可以考虑使用迭代器模式来解决。
  3. 迭代器模式,提供一个遍历集合元素的统一接口,用一致的方法遍历集合元素,不需要知道集合对象的底层表示,即:不暴露其内部结构

迭代器模式的注意事项和细节

  1. 优点
    (1) 提供一个统一的方法遍历对象,客户端不用再考虑聚合的类型,使用一种方法就可以遍历对象了
    (2) 隐藏了聚合的内部结构,客户端要遍历聚合的时候只能取到迭代器,而不会知道聚合的具体组合
    (3) 提供了一个设计思想,就是一个类应该只有一个引起变化的原因(叫做单一职责原则)。在聚合类中,我们把迭代器分开,就是要把管理对象集合和遍历对象集合的责任分开,这样一来集合改变的话,只影响到聚合对象。而如果遍历方式改变的话,只影响到迭代器
    (4) 当要展示一组相似对象,或者遍历一组相同对象时使用,可以使用迭代器模式
  2. 缺点
    (1 )每个聚合对象都要一个迭代器,会生成多个迭代器不好管理

代码实现

//系
public class Department {

	String name;
	
	String desc;

	public Department() {
	}

	public Department(String name, String desc) {
		this.name = name;
		this.desc = desc;
	}

	public String getName() {
		return name;
	}

	public void setName(String name) {
		this.name = name;
	}

	public String getDesc() {
		return desc;
	}

	public void setDesc(String desc) {
		this.desc = desc;
	}

	@Override
	public String toString() {
		return "Department [name=" + name + ", desc=" + desc + "]";
	}

}

//学院接口
public interface College {

	String getName();
	
	void addDepartment(String name, String desc);
	
	public Iterator createIterator();
}

//计算机学院
public class ComputerCollege implements College {

	Department[] departments;
	
	int numberOfDepartment = 0;
	
	
	
	public ComputerCollege() {
		this.departments = new Department[5];
		addDepartment("1", "1");
		addDepartment("2", "2");
		addDepartment("3", "3");
		addDepartment("4", "4");
		addDepartment("5", "5");
	}

	@Override
	public String getName() {
		return "计算机学院";
	}

	@Override
	public void addDepartment(String name, String desc) {
		Department department = new Department(name, desc);
		departments[numberOfDepartment] = department;
		numberOfDepartment++;
	}

	@Override
	public Iterator createIterator() {
		return new ComputerCollegeIterator(departments);
	}

	@Override
	public String toString() {
		return "ComputerCollege [departments=" + Arrays.toString(departments) + ", numberOfDepartment="
				+ numberOfDepartment + "]";
	}
}

//计算机学院的迭代器
public class ComputerCollegeIterator implements Iterator {

	//这里我们需要知道Department是以怎样的方式存放
	Department[] departments;
	int position = 0;
	
	
	public ComputerCollegeIterator(Department[] departments) {
		this.departments = departments;
	}

	@Override
	public boolean hasNext() {
		if (position >= departments.length || departments[position] == null) {
			return false;
		}
		return true;
	}

	@Override
	public Object next() {
		Department department = departments[position];
		position++;
		return department;
	}
	
	//默认空实现
	public void remove() {
		
	}
}

//信息学院
public class InfoCollege implements College {

	List<Department> departments;
	
	int numberOfDepartment = 0;
	
	public InfoCollege() {
		this.departments = new ArrayList<>(5);
		addDepartment("1", "1");
		addDepartment("2", "2");
		addDepartment("3", "3");
		addDepartment("4", "4");
		addDepartment("5", "5");
	}

	@Override
	public String getName() {
		return "信息学院";
	}

	@Override
	public void addDepartment(String name, String desc) {
		Department department = new Department(name, desc);
		departments.add(department);
		numberOfDepartment++;
	}

	@Override
	public Iterator createIterator() {
		return new InfoCollegeIterator(departments);
	}

	@Override
	public String toString() {
		return "InfoCollege [departments=" + departments + ", numberOfDepartment=" + numberOfDepartment + "]";
	}
}

//信息学院迭代器
public class InfoCollegeIterator implements Iterator {

	//这里我们需要知道Department是以怎样的方式存放
	List<Department> departments;
	int position = 0;
	
	

	public InfoCollegeIterator(List<Department> departments) {
		super();
		this.departments = departments;
	}

	@Override
	public boolean hasNext() {
		if (position >= departments.size() || departments.get(position) == null) {
			return false;
		}
		return true;
	}

	@Override
	public Object next() {
		Department department = departments.get(position);
		position++;
		return department;
	}
	
	//默认空实现
	public void remove() {
		
	}

}

//指挥类
public class OutputImpl {
	
	//学院集合
	List<College> collegeList;

	public OutputImpl(List<College> collegeList) {
		this.collegeList = collegeList;
	}
	
	public void print() {
		Iterator<College> iterator = collegeList.iterator();
		while (iterator.hasNext()) {
			College next = iterator.next();
			System.out.println(next.getName());
			Iterator createIterator = next.createIterator();
			print2(createIterator);
		}
	}
	
	public void print2(Iterator<College> iterator) {
		while (iterator.hasNext()) {
			System.out.println(iterator.next());
		}
	}

}

//客户端
public class Client {
	
	public static void main(String[] args) {
		
		List<College> list = new ArrayList<>();
		ComputerCollege computerCollege = new ComputerCollege();
		InfoCollege infoCollege = new InfoCollege();
		list.add(computerCollege);
		list.add(infoCollege);
		OutputImpl outputImpl = new OutputImpl(list);
		outputImpl.print();
	}
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值