Iterator patten 读书笔记

本文介绍了一种设计模式——迭代器模式的应用案例。通过该模式,可以实现对集合对象的顺序访问,同时隐藏其内部实现细节。文章展示了如何利用迭代器模式简化不同菜单类别的遍历过程。
提供 一种方法 顺序访问 一个聚和 对象中的各个元素,而又不暴露其内部的表示或实现。
迭代器模式让我们能游走于聚合内的每一个元素,而又不暴露其内部的表示。把游走的任务放在迭代器上,而不是聚合上。这样简化了聚合的接口和实现,也让责任各得其所。
1.迭代器允许访问聚合的元素,而不需要暴露它的内部结构。
2.迭代器将遍历聚合的工作封装进一个对象中。
3.当使用迭代器的时候,我们依赖聚合提供遍历。
4.迭代器提供了一个通用的接口,让我们遍历聚合项,当我们编码使用聚合的项时,就可以使用多太机制。
[img]http://blufiles.storage.live.com/y1pZ1u4rC44uCiuMXdBX3toI0OfxjDxutU3LR9_SWwHy7SaUQ5N7kgs4G6WyWQ8bn3iuJybsl-tjmw[/img]
package pattern;
import java.util.ArrayList;
import java.util.Calendar;
import com.sun.org.apache.xalan.internal.xsltc.runtime.Hashtable;
public class MenuTestDrive {
public static void main(String[] args) {
PancakeHouseMenu pancakeHouseMenu = new PancakeHouseMenu();
DinerMenu dinerMenu = new DinerMenu();
CafeMenu cafeMenu = new CafeMenu();
Waitress waitress = new Waitress(pancakeHouseMenu, dinerMenu,cafeMenu);
waitress.printMenu();
}
}
class MenuItem {
String name;
String description;
boolean vegetarian;
double price;
public MenuItem(String name, String description, boolean vegetarian,
double price) {
this.name = name;
this.description = description;
this.vegetarian = vegetarian;
this.price = price;
}
public String getName() {
return name;
}
public String getDescription() {
return description;
}
public boolean isVegetarian() {
return vegetarian;
}
public double getPrice() {
return price;
}
}
interface Menu{
public Iterator creatIterator();
}
class PancakeHouseMenu implements Menu {
ArrayList<MenuItem> menuItems=new ArrayList<MenuItem>();
public PancakeHouseMenu() {
menuItems = new ArrayList<MenuItem>();
addItem("K&B'S Pancake Breakfast",
"Pancakes with scrambled eggs,and toast", true, 2.99);
addItem("Regular Pancake Breakfast",
"Pancakes with fried eggs,and sausage", true, 2.99);
addItem("BlueBerry Pancakes ", "Pancakes made with fresh blueberries",
true, 3.49);
addItem("Waffles",
"Waffles with your choice of blueberries or strawberries",
true, 3.59);
}
public void addItem(String name, String description, boolean vegetarian,
double price) {
MenuItem menuItem = new MenuItem(name, description, vegetarian, price);
menuItems.add(menuItem);
}
public Iterator creatIterator() {
return new PancakeHouseMenuIterator(menuItems);
}
}
class DinerMenu implements Menu{
static final int MAX_ITEMS = 6;
int numberOfItems = 0;
MenuItem[] menuItems= new MenuItem[MAX_ITEMS];
public DinerMenu() {
addItem("Vegetarian BLT",
"(Fakin') Bacon with lettuce & tomato on whole wheat", true,
2.99);
addItem("BLT", " Bacon with lettuce & tomato on whole wheat", true,
2.99);
addItem("Soup of the day",
"Soup of the day,with a side of potato salad", true, 2.99);
addItem("Hotdog",
"A hot dog, with saurkraut,relish,onions,topped with cheese",
true, 2.99);
}
public void addItem(String name, String description, boolean vegetarian,
double price) {
MenuItem menuItem = new MenuItem(name, description, vegetarian, price);
if (numberOfItems >= MAX_ITEMS) {
System.err.println("Sorry menu is full ,can not add item to menu!");
} else {
menuItems[numberOfItems] = menuItem;
numberOfItems = numberOfItems + 1;
}
}
public Iterator creatIterator() {
return new DinerMenuIterator(menuItems);
}
}
class CafeMenu implements Menu{
Hashtable menuItems=new Hashtable();
int position=0;
public CafeMenu(){
addItem("Vegegie Burger and Air Fries",
"Veggie burger on a whole wheat bun,lettuce,tomato,and fries", true,
3.99);
addItem("Soup of the day", "A cup of the soup of the day,with a side salad", true,
2.99);
addItem("Burrito",
"A large burrito , with whole pinto beans,salsa,guacamole", true, 2.99);

}
public void addItem(String name, String description, boolean vegetarian,
double price) {
MenuItem menuItem = new MenuItem(name, description, vegetarian, price);
menuItems.put(position, menuItem);
position++;
}
public Iterator creatIterator() {
return new CafeMenuIterator(menuItems);
}
}
interface Iterator {
boolean hasNext();
Object next();
void remove(int i);
}
class DinerMenuIterator implements Iterator {
MenuItem[] items;
int position = 0;
public DinerMenuIterator(MenuItem[] items) {
this.items = items;
}
public boolean hasNext() {
if (position >= items.length || items[position] == null) {
return false;
} else
return true;
}
public Object next() {
MenuItem menuItem = items[position];
position = position + 1;
return menuItem;
}
public void remove(int i){
if(i>=items.length || items[i] == null){
System.err.println("err");
}else{
for(int n=i;n<items.length-1;n++){
items[n]=items[n+1];
}
}
}
}
class PancakeHouseMenuIterator implements Iterator {
ArrayList<MenuItem> items;
int position = 0;
public PancakeHouseMenuIterator(ArrayList<MenuItem> items) {
this.items = items;
}
public boolean hasNext() {
if (position >= items.size()) {
return false;
} else
return true;
}
public Object next() {
MenuItem menuItem = (MenuItem) items.get(position);
position = position + 1;
return menuItem;
}
@Override
public void remove(int i) {
items.remove(i);
}
}
class CafeMenuIterator implements Iterator {
Hashtable items;
int position = 0;
public CafeMenuIterator(Hashtable items) {
this.items = items;
}
public boolean hasNext() {
if (position >= items.size()) {
return false;
} else
return true;
}
public Object next() {
MenuItem menuItem = (MenuItem) items.get(position);
position++;
return menuItem;
}
@Override
public void remove(int i) {
items.remove(i);
}
}

class AlternatingDinerMenuIterator implements Iterator{
MenuItem[] items;
int position;
public AlternatingDinerMenuIterator(MenuItem[] items){
this.items=items;
Calendar rightNow=Calendar.getInstance();
position =rightNow.get(Calendar.DAY_OF_WEEK)%2;
}
public boolean hasNext(){
if(position>=items.length||items[position]==null){
return false;
}else{
return true;
}
}
public Object next(){
MenuItem menuItem=items[position];
position=position+2;
return menuItem;
}
public void remove(int i){
throw new UnsupportedOperationException("Alternating Diner Menu Iterator does not support remove()");
}
}
class Waitress {
Menu pancakeHouseMenu;
Menu dinerMenu;
CafeMenu cafeMenu;
public Waitress(Menu pancakeHouseMenu, Menu dinerMenu,CafeMenu cafeMenu) {
this.pancakeHouseMenu = pancakeHouseMenu;
this.dinerMenu = dinerMenu;
this.cafeMenu= cafeMenu;
}
public void printMenu() {
Iterator PancakeHouseMenuIterator = pancakeHouseMenu
.creatIterator();
Iterator dinerMenuIterator = dinerMenu.creatIterator();
Iterator cafeMenuIterator=cafeMenu.creatIterator();
System.out.println("MENU\n------\nBREAKFAST");
printMenu(PancakeHouseMenuIterator);
System.out.println("\nLUNCH");
printMenu(dinerMenuIterator);
System.out.println("\nDINNER");
printMenu(cafeMenuIterator);
}
private void printMenu(Iterator iterator) {
while (iterator.hasNext()) {
MenuItem menuItem = (MenuItem) iterator.next();
System.out.print(menuItem.getName() + ",");
System.out.print(menuItem.getPrice() + "--");
System.out.println(menuItem.getDescription());
}
}
}
内容概要:本文详细介绍了“秒杀商城”微服务架构的设计与实战全过程,涵盖系统从需求分析、服务拆分、技术选型到核心功能开发、分布式事务处理、容器化部署及监控链路追踪的完整流程。重点解决了高并发场景下的超卖问题,采用Redis预减库存、消息队列削峰、数据库乐观锁等手段保障数据一致性,并通过Nacos实现服务注册发现与配置管理,利用Seata处理跨服务分布式事务,结合RabbitMQ实现异步下单,提升系统吞吐能力。同时,项目支持Docker Compose快速部署和Kubernetes生产级编排,集成Sleuth+Zipkin链路追踪与Prometheus+Grafana监控体系,构建可观测性强的微服务系统。; 适合人群:具备Java基础和Spring Boot开发经验,熟悉微服务基本概念的中高级研发人员,尤其是希望深入理解高并发系统设计、分布式事务、服务治理等核心技术的开发者;适合工作2-5年、有志于转型微服务或提升架构能力的工程师; 使用场景及目标:①学习如何基于Spring Cloud Alibaba构建完整的微服务项目;②掌握秒杀场景下高并发、超卖控制、异步化、削峰填谷等关键技术方案;③实践分布式事务(Seata)、服务熔断降级、链路追踪、统一配置中心等企业级中间件的应用;④完成从本地开发到容器化部署的全流程落地; 阅读建议:建议按照文档提供的七个阶段循序渐进地动手实践,重点关注秒杀流程设计、服务间通信机制、分布式事务实现和系统性能优化部分,结合代码调试与监控工具深入理解各组件协作原理,真正掌握高并发微服务系统的构建能力。
评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
红包 添加红包
表情包 插入表情
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值