算法和数据结构分开__访问者模式___Visitor

package com.ding.shejimoshi.Visitor;

abstract class Visitor {

public abstract void visitConcreteElementA(ConcreteElementA concreteElementA);
public abstract void visitConcreteElementB(ConcreteElementB concreteElementB);


}
package com.ding.shejimoshi.Visitor;

public class ConcreteVisitor1 extends Visitor{

public void visitConcreteElementA(ConcreteElementA concreteElementA){

System.out.println(concreteElementA.getClass()+"被"+this.getClass()+"访问");
}
public void visitConcreteElementB(ConcreteElementB concreteElementB){

System.out.println(concreteElementB.getClass()+"被"+this.getClass()+"访问");
}
}
package com.ding.shejimoshi.Visitor;

public class ConcreteVisitor2 extends Visitor{
public void visitConcreteElementA(ConcreteElementA concreteElementA){

System.out.println(concreteElementA.getClass()+"被"+this.getClass()+"访问");
}
public void visitConcreteElementB(ConcreteElementB concreteElementB){

System.out.println(concreteElementB.getClass()+"被"+this.getClass()+"访问");
}
}
package com.ding.shejimoshi.Visitor;

abstract class Element {
public abstract void accept(Visitor visitor);
}
package com.ding.shejimoshi.Visitor;

public class ConcreteElementA extends Element{

public void accept(Visitor visitor){
visitor.visitConcreteElementA(this);
}
}
package com.ding.shejimoshi.Visitor;

public class ConcreteElementB extends Element{

public void accept(Visitor visitor){
visitor.visitConcreteElementB(this);
}
}
package com.ding.shejimoshi.Visitor;

import java.util.ArrayList;
import java.util.List;

public class ObjectStructure {
private List<Element> elements=new ArrayList<Element>();

public void attace(Element element){
elements.add(element);
}
public void detach(Element element){
elements.remove(element);
}

public void accept(Visitor visitor){
for(Element s :elements){
s.accept(visitor);
}

}

}
package com.ding.shejimoshi.Visitor;

public class Main {


public static void main(String [] args){

ObjectStructure o=new ObjectStructure();

o.attace(new ConcreteElementA());
o.attace(new ConcreteElementB());
ConcreteVisitor1 v1=new ConcreteVisitor1();
ConcreteVisitor2 v2=new ConcreteVisitor2();
o.accept(v1);
o.accept(v2);
}
}

----------------------------------------------------------------------------------------------------

class com.ding.shejimoshi.Visitor.ConcreteElementA被class com.ding.shejimoshi.Visitor.ConcreteVisitor1访问
class com.ding.shejimoshi.Visitor.ConcreteElementB被class com.ding.shejimoshi.Visitor.ConcreteVisitor1访问
class com.ding.shejimoshi.Visitor.ConcreteElementA被class com.ding.shejimoshi.Visitor.ConcreteVisitor2访问
class com.ding.shejimoshi.Visitor.ConcreteElementB被class com.ding.shejimoshi.Visitor.ConcreteVisitor2访问
-------------------------------------------------------------------------------------------------------


访问者模式 优点 数据结构和算法分开

缺点 不要增加新的数据结构

-----------------------------------------------------------------------------------------------------------

private List<Element> elements=new ArrayList<Element>();

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值