享元模式

最新推荐文章于 2025-05-31 21:05:50 发布

敲着敲着头发没了

最新推荐文章于 2025-05-31 21:05:50 发布

阅读量84

点赞数

文章标签：设计模式

本文链接：https://blog.youkuaiyun.com/weixin_46170033/article/details/107574765

版权

本文介绍了一种使用享元模式优化树对象创建和管理的方法。通过享元模式，可以减少内存中树对象的重复实例，提高资源利用效率。文章详细展示了树对象、树节点对象及树工厂的具体实现，并通过一个测试类演示了如何利用享元模式来创建和复用树对象。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

享元模式

树对象

public class Tree{
    private final String name;
    private final String data;

    public Tree(String name, String data) {
        this.name = name;
        this.data = data;
    }

    public String getName() {
        return name;
    }
    public String getData() {
        return data;
    }
}

树节点对象

public class TreeNode{
    private int x;
    private int y;
    private Tree tree;

    public TreeNode(int x, int y, Tree tree) {
        this.x = x;
        this.y = y;
        this.tree = tree;
    }

    public int getX() {
        return x;
    }

    public void setX(int x) {
        this.x = x;
    }

    public  int getY() {
        return y;
    }

    public void setY(int y) {
        this.y = y;
    }

    public Tree getTree() {
        return tree;
    }

    public void setTree(Tree tree) {
        this.tree = tree;
    }
}

树工厂

public class TreeFactory{
    private static Map<String,Tree> map = new ConcurrentHashMap<>();
    public static Tree getTree(String name,String date){
        if (map.containsKey(name)){
            return map.get(name);
        }
        Tree tree = new Tree(name,date);
        map.put(name,tree);
        return tree;
    }
}

测试类

public class FlyWeightTest {
    public static void main(String[] args) {
        TreeNode treeNode0 = new TreeNode(0, 4,TreeFactory.getTree("xxx","xxxx"));
        System.out.println(treeNode0.getTree().hashCode());//1163157884
        TreeNode treeNode1 = new TreeNode(1, 4,TreeFactory.getTree("xxx","xxxx"));
        System.out.println(treeNode1.getTree().hashCode());//1163157884
        TreeNode treeNode2 = new TreeNode(2, 4,TreeFactory.getTree("xxxy","xxxx"));
        System.out.println(treeNode2.getTree().hashCode());//1956725890
    }
}