设计模式10-迭代器模式

1.场景问题解决

1.1 场景描述

两个菜馆合并后的菜单问题. 一个蛋糕店,一个小餐厅,原本各自有各自的菜单,一个为List,一个为Array,合并后出一份菜单.

1.2 OO设计

  • MenuItem
public class MenuItem {
	private String name,description;
	private boolean vegetable;
	private float price;
	public MenuItem(String name,String description,boolean vegetable,float price)
	{
		this.name=name;
		this.description=description;
		this.vegetable=vegetable;
		this.price=price;
		
	}
	public String getName()
	{
		return name;
	}
	public String getDescription()
	{
		return description;
	}
	public float getPrice()
	{
		return price;
	}
	public boolean  isVegetable()
	{
		return vegetable;
	}
}
  • CakeHouseMenu(蛋糕店,List),DinerMenu(小餐厅,Array),
public class CakeHouseMenu {
	private ArrayList<MenuItem> menuItems;

	public CakeHouseMenu() {
		menuItems = new ArrayList<MenuItem>();
		
		addItem("KFC Cake Breakfast","boiled eggs&toast&cabbage",true,3.99f);
		addItem("MDL Cake Breakfast","fried eggs&toast",false,3.59f);
		addItem("Stawberry Cake","fresh stawberry",true,3.29f);
		addItem("Regular Cake Breakfast","toast&sausage",true,2.59f);
	}

	private void addItem(String name, String description, boolean vegetable,
			float price) {
		MenuItem menuItem = new MenuItem(name, description, vegetable, price);
		menuItems.add(menuItem);
	}
	public ArrayList<MenuItem> getMenuItems() {
		return menuItems;
	}
}




public class DinerMenu {
	private final static int Max_Items=5;
	public int numberOfItems=0;
	private MenuItem[] menuItems;
	
	public DinerMenu()
	{
		menuItems=new MenuItem[Max_Items] ;
		addItem("vegetable Blt","bacon&lettuce&tomato&cabbage",true,3.58f);
		addItem("Blt","bacon&lettuce&tomato",false,3.00f);
		addItem("bean soup","bean&potato salad",true,3.28f);
		addItem("hotdog","onions&cheese&bread",false,3.05f);
	}
	private void addItem(String name, String description, boolean vegetable,
			float price) {
		MenuItem menuItem = new MenuItem(name, description, vegetable, price);
		if(numberOfItems>=Max_Items)
		{
			System.err.println("sorry,menu is full!can not add another item");
		}else{
			menuItems[numberOfItems]=menuItem;
			numberOfItems++;
		}
	}
	
	public MenuItem[] getMenuItems() {
		return menuItems;
	}
}


  • MergeMenu 合并后的菜单
public class MergeMenu {
	private CakeHouseMenu mCakeHouseMenu;
	private DinerMenu mDinerMenu;
	private ArrayList<MenuItem> cakeitems;
	private MenuItem[] dineritems;

	public MergeMenu() {
		mCakeHouseMenu = new CakeHouseMenu();
		cakeitems = mCakeHouseMenu.getMenuItems();

		mDinerMenu = new DinerMenu();
		dineritems = mDinerMenu.getMenuItems();
	}

	public void printMenu() {
		MenuItem menuItem;
		for (int i = 0, len = cakeitems.size(); i < len; i++) {
			menuItem = cakeitems.get(i);
			System.out.println(menuItem.getName() + "***"
					+menuItem.getPrice()+"***"+ menuItem.getDescription());
		}
		for (int i = 0, len = mDinerMenu.numberOfItems; i < len; i++) {
			menuItem = dineritems[i];
			System.out.println(menuItem.getName() + "***"
					+menuItem.getPrice()+"***"+ menuItem.getDescription());
		}
	}
  • 合并菜单测试类
public class TestMergeMenu1 {
	public static void main(String[] args) {
		MergeMenu mergeMenu=new MergeMenu();
		mergeMenu.printMenu();
	}
}

1.3 需求变动

如果加入新的餐厅,或者菜单的数据接口有变动,那么就会要修改合并菜单类. 违背了对修改关闭的原则.

2.用设计模式改进

2.1 分析

2.2 重新设计

对接口开发,让类之间的耦合度降低.

2.3 源码

  • MenuItem 菜单实例对象
public class MenuItem {
	private String name,description;
	private boolean vegetable;
	private float price;
	public MenuItem(String name,String description,boolean vegetable,float price)
	{
		this.name=name;
		this.description=description;
		this.vegetable=vegetable;
		this.price=price;
		
	}
	public String getName()
	{
		return name;
	}
	public String getDescription()
	{
		return description;
	}
	public float getPrice()
	{
		return price;
	}
	public boolean  isVegetable()
	{
		return vegetable;
	}
}

  • 迭代器接口 Iterator
public interface Iterator {
	public boolean hasNext();
	public Object next();
}

  • CakeHouseMenu(蛋糕店,List),DinerMenu(小餐厅,Array),

public class CakeHouseMenu {
	private ArrayList<MenuItem> menuItems;

	public CakeHouseMenu() {
		menuItems = new ArrayList<MenuItem>();
		addItem("KFC Cake Breakfast","boiled eggs&toast&cabbage",true,3.99f);
		addItem("MDL Cake Breakfast","fried eggs&toast",false,3.59f);
		addItem("Stawberry Cake","fresh stawberry",true,3.29f);
		addItem("Regular Cake Breakfast","toast&sausage",true,2.59f);
	}

	private void addItem(String name, String description, boolean vegetable,
			float price) {
		MenuItem menuItem = new MenuItem(name, description, vegetable, price);
		menuItems.add(menuItem);
	}
	

	public Iterator getIterator(){
		return new CakeHouseIterator() ;
	}
	
	class CakeHouseIterator implements  Iterator{
		private int position=0;
		public CakeHouseIterator(){
			  position=0;

		}
		 	@Override
		public boolean hasNext() {
		if(position<menuItems.size()){
			return true;
		}
		return false;
		}

		@Override
		public Object next() {
			MenuItem menuItem =menuItems.get(position);
			position++;
			return menuItem;
		}
	 };
}





public class DinerMenu {
	private final static int Max_Items = 5;
	private int numberOfItems = 0;
	private MenuItem[] menuItems;

	public DinerMenu() {
		menuItems = new MenuItem[Max_Items];
		addItem("vegetable Blt", "bacon&lettuce&tomato&cabbage", true, 3.58f);
		addItem("Blt", "bacon&lettuce&tomato", false, 3.00f);
		addItem("bean soup", "bean&potato salad", true, 3.28f);
		addItem("hotdog", "onions&cheese&bread", false, 3.05f);

	}

	private void addItem(String name, String description, boolean vegetable,
			float price) {
		MenuItem menuItem = new MenuItem(name, description, vegetable, price);
		if (numberOfItems >= Max_Items) {
			System.err.println("sorry,menu is full!can not add another item");
		} else {
			menuItems[numberOfItems] = menuItem;
			numberOfItems++;
		}

	}

	public Iterator getIterator() {
		return new DinerIterator();
	}

	class DinerIterator implements Iterator {
		private int position;
		public DinerIterator() {
			position = 0;
		}
		@Override
		public boolean hasNext() {
			if (position < numberOfItems) {
				return true;
			}
			return false;
		}

		@Override
		public Object next() {
			MenuItem menuItem = menuItems[position];
			position++;
			return menuItem;
		}
	};
}
  • MergeMenu(合并后的菜单)

public class MergeMenu {
	private ArrayList<Iterator> iterators=new ArrayList<Iterator>();
	public MergeMenu() {
	}
	public void addIterator(Iterator iterator){
		iterators.add(iterator);
		
	}
	public void printMenu() {
		Iterator iterator;
		MenuItem menuItem;
		for (int i = 0, len = iterators.size(); i < len; i++) {
			iterator = iterators.get(i);
			while(iterator.hasNext()){
				menuItem=(MenuItem)	iterator.next();
				System.out.println(menuItem.getName() + "***"
						+menuItem.getPrice()+"***"+ menuItem.getDescription());
			}
		}
	}
}

  • TestMergeMenu2 测试类
public class TestMergeMenu2 {
	public static void main(String[] args) {
		MergeMenu mergeMenu=new MergeMenu();
		CakeHouseMenu mCakeHouseMenu = new CakeHouseMenu();
		DinerMenu	mDinerMenu = new DinerMenu();

		mergeMenu.addIterator(mCakeHouseMenu.getIterator());
		mergeMenu.addIterator(mDinerMenu.getIterator());
		mergeMenu.printMenu();
	}
}

3.设计模式总结

3.1 定义

迭代器模式: 提供一种方法顺序访问一个聚合对象中的各个对象.

原有的聚合对象可以独立扩容,并且以后新的聚合对象可以轻松加入,满足以后的扩容性.

单一职责原则: 一个类应该只有一个引起变化的原因

3.2 分析思路

4. 设计模式使用场景及注意

4.1 java内置迭代器

  • MenuItem 菜单实例对象
public class MenuItem {
	private String name,description;
	private boolean vegetable;
	private float price;
	public MenuItem(String name,String description,boolean vegetable,float price)
	{
		this.name=name;
		this.description=description;
		this.vegetable=vegetable;
		this.price=price;
		
	}
	public String getName()
	{
		return name;
	}
	public String getDescription()
	{
		return description;
	}
	public float getPrice()
	{
		return price;
	}
	public boolean  isVegetable()
	{
		return vegetable;
	}
}

  • CakeHouseMenu(蛋糕店,List),DinerMenu(小餐厅,Array), ,新增CafeMenu(咖啡馆HashTable)
public class CakeHouseMenu {
	private ArrayList<MenuItem> menuItems;
	private int position=0;
	public CakeHouseMenu() {
		menuItems = new ArrayList<MenuItem>();
		
		addItem("KFC Cake Breakfast","boiled eggs&toast&cabbage",true,3.99f);
		addItem("MDL Cake Breakfast","fried eggs&toast",false,3.59f);
		addItem("Stawberry Cake","fresh stawberry",true,3.29f);
		addItem("Regular Cake Breakfast","toast&sausage",true,2.59f);
	}

	private void addItem(String name, String description, boolean vegetable,
			float price) {
		MenuItem menuItem = new MenuItem(name, description, vegetable, price);
		menuItems.add(menuItem);
	}

	
	public Iterator getIterator(){
		return menuItems.iterator();
	}
}



public class DinerMenu {
	private final static int Max_Items = 5;
	private int numberOfItems = 0;
	private MenuItem[] menuItems;
	
	public DinerMenu() {
		menuItems = new MenuItem[Max_Items];
		addItem("vegetable Blt", "bacon&lettuce&tomato&cabbage", true, 3.58f);
		addItem("Blt", "bacon&lettuce&tomato", false, 3.00f);
		addItem("bean soup", "bean&potato salad", true, 3.28f);
		addItem("hotdog", "onions&cheese&bread", false, 3.05f);

	}

	private void addItem(String name, String description, boolean vegetable,
			float price) {
		MenuItem menuItem = new MenuItem(name, description, vegetable, price);
		if (numberOfItems >= Max_Items) {
			System.err.println("sorry,menu is full!can not add another item");
		} else {
			menuItems[numberOfItems] = menuItem;
			numberOfItems++;
		}
	}

	public Iterator getIterator() {
		return new DinerIterator();
	}

	class DinerIterator implements Iterator {
		private int position = 0;

		@Override
		public boolean hasNext() {
			if (position < numberOfItems) {
				return true;
			}
			position = 0;
			return false;
		}

		@Override
		public Object next() {
			MenuItem menuItem = menuItems[position];
			position++;
			return menuItem;
		}

		@Override
		public void remove() {
		}
	}
}


public class CafeMenu {
	private Hashtable<String,MenuItem> menuItems=new Hashtable<String,MenuItem>();

	public CafeMenu(){
		addItem("Moca Burger","moca&bruger&tomato",true,3.56f);
		addItem("Soup Latte","Latte&salad&soup",true,3.26f);
		addItem("Burrito","bacon&toamto&beans",false,3.96f);
	}

	private void addItem(String name, String description, boolean vegetable,
			float price) {
		MenuItem menuItem = new MenuItem(name, description, vegetable, price);
		menuItems.put(name, menuItem);
	}
	
	
	public Iterator getIterator(){
		return menuItems.values().iterator();
	}
}

  • MergeMenu合并菜单
public class MergeMenu {
	private ArrayList<Iterator> iterators=new ArrayList<Iterator>();

	public MergeMenu() {
	}
	public void addIterator(Iterator iterator){
		iterators.add(iterator);
	}
	public void printMenu() {
		Iterator iterator;
		MenuItem menuItem;
		for (int i = 0, len = iterators.size(); i < len; i++) {
			iterator = iterators.get(i);
			while(iterator.hasNext()){
				menuItem=(MenuItem)	iterator.next();
				System.out.println(menuItem.getName() + "***"
						+menuItem.getPrice()+"***"+ menuItem.getDescription());
			}
		}
	}
}

  • 测试类
public class TestMergeMenu3 {
	public static void main(String[] args) {
		MergeMenu mergeMenu=new MergeMenu();
		CakeHouseMenu mCakeHouseMenu = new CakeHouseMenu();
		DinerMenu	mDinerMenu = new DinerMenu();
		CafeMenu mCafeMenu=new CafeMenu();
		
		mergeMenu.addIterator(mCakeHouseMenu.getIterator());
		mergeMenu.addIterator(mDinerMenu.getIterator());
		mergeMenu.addIterator(mCafeMenu.getIterator());
		mergeMenu.printMenu();
	}
}

5.参考文章

内容总计于HeadFirst设计模式及相关视频

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值