树形结构通用方法

最新推荐文章于 2022-04-25 08:29:27 发布

july_young

最新推荐文章于 2022-04-25 08:29:27 发布

阅读量297

点赞数 1

分类专栏： java

本文链接：https://blog.csdn.net/july_young/article/details/89402380

版权

java 专栏收录该内容

73 篇文章 0 订阅

订阅专栏

public class TreeUtil2<T extends TreeFeature> {

    private TreeUtil2() {

    }

    public static TreeUtil2 getInstance() {

        return new TreeUtil2();
    }

    public Set<Node<T>> getTree(List<? extends T> list, Long parentId) {
        if (list.size() == 0) {
            return null;
        }

        List<? extends T> children = list.stream().filter(x -> ((T) x).getPid().equals(parentId)).collect(Collectors.toList());
        List<? extends T> successor = list.stream().filter(x -> !((T) x).getId().equals(parentId)).collect(Collectors.toList());


        Set<Node<T>> set = new TreeSet<>();
        for (T t : children) {

            Node<T> node = new Node<T>();
            node.setData(t);
            set.add(node);
            Set<Node<T>> tree = getTree(successor, t.getId());
            if (tree != null) {
                node.setSNodes(tree);
            }
        }
        return set;
    }

    public void getChildren(List<? extends T> list, List<? super T> target, Long id) {

        List<? extends T> children = list.stream().filter(x -> id.equals(x.getPid())).collect(Collectors.toList());
        List<? extends T> other = list.stream().filter(x -> !id.equals(x.getPid())).collect(Collectors.toList());

        if (CollectionUtils.isEmpty(children)) {
            return;
        }

        target.addAll(children);

        for (T group : children) {

            getChildren(other, target, group.getId());
        }
    }

    public void getChildren(Node<? extends T> node, List<? super T> target) {

        target.add(node.getData());

        Set<? extends Node<? extends T>> sNodes = node.getSNodes();

        for (Node<? extends T> n : sNodes) {

            getChildren(n, target);
        }
    }

    public void getParents(List<? extends T> list, List<? super T> target, Long currentPos) {

        Optional<? extends T> first = list.stream().filter(x -> ((T) x).getId().equals(currentPos)).findFirst();

        if (first.isPresent()) {
            T t = first.get();
            target.add(t);
            getParents(list, target, first.get().getPid());
        }
    }

    public boolean belong(Long child, Long ancestor, List<T> list) {

        List<T> target = new LinkedList<>();

        getParents(list, target, child);

        boolean b=target.stream().filter(x -> x.getId().equals(ancestor)).findFirst().isPresent();

        return b;
    }

    public boolean contains(Long ancestor, Long child, List<T> list) {

        List<T> target = new LinkedList<>();

        getChildren(list, target, ancestor);

        boolean b=target.stream().filter(x -> x.getId().equals(child)).findFirst().isPresent();

        return b;
    }
}

public class Node<T extends Comparable> implements Comparable {
    /**
     * 存放的数据
     */
    private T data;
    /**
     * 存放的子节点引用
     */
    private Set<Node<T>> sNodes;

}