《設計模式之美》(三:結構型模式)

結構型模式:解耦不同功能

  1. 代理模式
    • 實現方式:實現同一個接口(加上組合),或者繼承
    • 動態代理:在代理類比較多的情況下,可以通過動態代理,在程序運行的時候動態創建代理類
    • 應用場景:監控、鑑權、統計、限流
public interface PlayGame {
    void play();
}

public class LiLiPalyGame implements PlayGame{
    @Override
    public void play() {
        System.out.println("yin yin yin");
    }
}

public class PlayGameProxy implements PlayGame{
    private LiLiPalyGame liLiPalyGame;


    public PlayGameProxy() {
        liLiPalyGame = new LiLiPalyGame();

    }

    @Override
    public void play() {
        System.out.println("pre");
        liLiPalyGame.play();
        System.out.println("after");
    }
}

public class PlayGameDynamicProxy {

    public Object createProxy(Object object){
        DynamicProxy dynamicProxy = new DynamicProxy(object);
        Object instance = Proxy.newProxyInstance(object.getClass().getClassLoader(), object.getClass().getInterfaces(), dynamicProxy);
        return instance;
    }

    public class  DynamicProxy implements InvocationHandler{
        private Object proxies;
        public DynamicProxy(Object obj) {
            proxies = obj;
        }

        @Override
        public Object invoke(Object o, Method method, Object[] objects) throws Throwable {
            System.out.println("before");
            method.invoke(proxies,objects);
            System.out.println("after");
            return null;
        }
    }


}


    PlayGameProxy playGameProxy = new PlayGameProxy();
        playGameProxy.play();

        PlayGameDynamicProxy playGameDynamicProxy = new PlayGameDynamicProxy();
        PlayGame playGame = (PlayGame) playGameDynamicProxy.createProxy(new LiLiPalyGame());
        playGame.play()
技術方案:
jdk
javasist
cglib
javasist&cglib通過添加依賴,性能相似
  1. 裝飾器模式
    和代理模式相似,都是組合代替繼承,不同點在於,代理模式添加不相關的功能,裝飾模式是擴展功能
eg:java的輸入輸出流,就是基於裝飾器模式
帶緩存的輸入流
InputStream in = new FileInputStream("路徑")
InputStrean bin = new BufferInputStream(in);
byte[] data = new byte[128]
while(bin.read(data) != -1){
}

  1. 適配器模式
    偏向於"事後補救","插頭裝換"
public interface ITarget {
    void f1();
    void f2();
    void f3();
}

public  class Adaptee {
    void fa(){}
    void fb(){}
    void fc(){}
}

//繼承模式
public class Adaptor extends Adaptee implements ITarget {
    @Override
    public void f1() {
        super.fa();
    }

    @Override
    public void f2() {
        super.fb();
    }

    @Override
    public void f3() {
    super.fc();
    }
}

//泛型話組合模式 Android 的ListView 和ListAdapter關係
public class Adaptor2<T extends Adaptee> implements ITarget{
    private T adaptee;

    public Adaptor2(T adaptee) {
        this.adaptee = adaptee;
    }

    @Override
    public void f1() {
        adaptee.fa();
    }

    @Override
    public void f2() {
        adaptee.fb();
    }

    @Override
    public void f3() {
        adaptee.fc();
    }
}
  1. 門面模式
    目的:讓調用者易調用
eg
解決性能問題,依次調三個接口合併成一個接口
解決分佈式事務
  1. 組合模式
    場景:適合樹形的數據結構
    實現:繼承同一父類
public abstract class FileSystemNode {
    private String path;

    public FileSystemNode(String path) {
        this.path = path;
    }

    public abstract int countNumOfFiles();
    public abstract long countSizeOfFiles();

    public String getPath() {
        return path;
    }
}

public class File extends FileSystemNode {
    public File(String path) {
        super(path);
    }

    @Override
    public int countNumOfFiles() {
        return 1;
    }

    @Override
    public long countSizeOfFiles() {
        java.io.File file = new java.io.File(getPath());
        if (!file.exists()) return 0;
        return file.length();
    }
}


public class Directory extends FileSystemNode {

    public Directory(String path) {
        super(path);

    }

    private List<FileSystemNode> subNodes = new ArrayList<>();
    @Override
    public int countNumOfFiles() {

        int fileNum = 0;
        for (int i = 0; i < subNodes.size(); i++) {
            long l = subNodes.get(i).countNumOfFiles();
            fileNum +=l;
        }
        return fileNum;
    }

    @Override
    public long countSizeOfFiles() {
        int fileSize = 0;
        for (int i = 0; i < subNodes.size(); i++) {
            long l = subNodes.get(i).countSizeOfFiles();
            fileSize +=l;
        }
        return fileSize;
    }

    public void addSubNode(FileSystemNode fileSystemNode){
        subNodes.add(fileSystemNode);
    }

    public void removeNode(FileSystemNode fileSystemNode){
        int i = 0 ;
        for (;i < subNodes.size();i++){
            if (fileSystemNode.getPath().equalsIgnoreCase(subNodes.get(i).getPath())){
                break;
            }
        }
        if (i < subNodes.size()){
            subNodes.remove(fileSystemNode);
        }
    }
}

public static void main(String[] args){
        /**
         * /
         * /tml/
         * /tml/1.txt
         * /tml/book/
         * /tml/book/designModel.txt
         * /tml/book/Java.txt
         * /wc/
         * /wc/2.txt
         * /wc/movie/
         * /wc/movie/helloWorld.mp4
         * /wc/movie/helloJava.mp4
         */
        Directory fileSystemTree = new Directory("/");

        Directory tmlDirectory = new Directory("/tml");
        Directory wcDirectory = new Directory("/wc");
        fileSystemTree.addSubNode(tmlDirectory);
        fileSystemTree.addSubNode(wcDirectory);

        File file1 = new File("/tml/1.txt");
        Directory node_tmlDirectory = new Directory("/tml/book/");
        Directory node_wcDirectory = new Directory("/wc/movie/");
        File file2 = new File("/wc/2.txt");
        tmlDirectory.addSubNode(file1);
        tmlDirectory.addSubNode(node_tmlDirectory);
        wcDirectory.addSubNode(node_wcDirectory);
        wcDirectory.addSubNode(file2);

        File designModelFile = new File("/tml/book/designModel.txt");
        File JavaFile = new File("/tml/book/Java.txt");
        File helloWorldFile = new File("/wc/movie/helloWorld.mp4");
        File helloJavaFile = new File("/wc/movie/helloJava.mp4");
        node_tmlDirectory.addSubNode(designModelFile);
        node_tmlDirectory.addSubNode(JavaFile);
        node_wcDirectory.addSubNode(helloWorldFile);
        node_wcDirectory.addSubNode(helloJavaFile);
        int fileNum = fileSystemTree.countNumOfFiles();
        long fileSize = fileSystemTree.countSizeOfFiles();
        System.out.println("fileNum: "+fileNum+" fileSize: "+fileSize);
    }
  1. 享元模式
    理解:複用,節省內存
    實現:利用工廠模式,Map或List緩存創建好的對象,用的時候直接從緩存讀取
    實例:象棋;Word文字格式
    區別:vs多例 享元是爲了節省內存,緩存是爲了節省時間
Integer
Integer i1 = 56;
Integer i2 = 56;
Integer i3 = new Integer(56);
Integer i4 = 128;
Integer i5 = 128;

i1 == i2 true
i2 == i3 false
i4 == i5 false
緩存-128~127
 
String 同理
  1. 橋接模式
發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.
相關文章