feat: 数据分组授权.

orion-ops-framework/orion-ops-framework-common/src/main/java/com/orion/ops/framework/common/entity/TreeNode.java

@@ -0,0 +1,49 @@
+package com.orion.ops.framework.common.entity;
+
+import java.util.List;
+
+/**
+ * 树节点
+ *
+ * @author Jiahang Li
+ * @version 1.0.0
+ * @since 2023/11/23 16:52
+ */
+public interface TreeNode<T extends TreeNode<T>> {
+
+    /**
+     * id
+     *
+     * @return id
+     */
+    Long getId();
+
+    /**
+     * parentId
+     *
+     * @return parentId
+     */
+    Long getParentId();
+
+    /**
+     * sort
+     *
+     * @return sort
+     */
+    Integer getSort();
+
+    /**
+     * children
+     *
+     * @return children
+     */
+    List<T> getChildren();
+
+    /**
+     * 设置 children
+     *
+     * @param children children
+     */
+    void setChildren(List<T> children);
+
+}

orion-ops-framework/orion-ops-framework-common/src/main/java/com/orion/ops/framework/common/utils/TreeUtils.java

@@ -0,0 +1,84 @@
+package com.orion.ops.framework.common.utils;
+
+import com.orion.lang.utils.collect.Lists;
+import com.orion.ops.framework.common.constant.Const;
+import com.orion.ops.framework.common.entity.TreeNode;
+
+import java.util.Comparator;
+import java.util.List;
+import java.util.stream.Collectors;
+
+/**
+ * 树工具类
+ *
+ * @author Jiahang Li
+ * @version 1.0.0
+ * @since 2023/11/23 16:52
+ */
+public class TreeUtils {
+
+    private TreeUtils() {
+    }
+
+    /**
+     * 获取节点以及父节点
+     *
+     * @param nodes  nodes
+     * @param idList idList
+     * @param result result
+     * @param <T>    T
+     */
+    public static <T extends TreeNode<T>> void getAllNodes(List<T> nodes,
+                                                           List<Long> idList,
+                                                           List<T> result) {
+        if (Lists.isEmpty(idList)) {
+            return;
+        }
+        // 获取当前节点的数据
+        List<T> currentNodes = nodes.stream()
+                .filter(s -> idList.contains(s.getId()))
+                .collect(Collectors.toList());
+        if (currentNodes.isEmpty()) {
+            return;
+        }
+        result.addAll(currentNodes);
+        // 获取父节点id
+        List<Long> parentIdList = currentNodes.stream()
+                .map(T::getParentId)
+                .distinct()
+                .collect(Collectors.toList());
+        // 如果为空 或者唯一的元素为 rootId 直接返回
+        if (parentIdList.isEmpty()
+                || parentIdList.size() == 1
+                || parentIdList.get(0).equals(Const.ROOT_PARENT_ID)) {
+            return;
+        }
+        // 递归
+        getAllNodes(nodes, parentIdList, result);
+    }
+
+    /**
+     * 构建树
+     *
+     * @param parentNode parentNode
+     * @param nodes      nodes
+     * @param <T>        T
+     */
+    public static <T extends TreeNode<T>> void buildGroupTree(T parentNode,
+                                                              List<T> nodes) {
+        // 获取子节点
+        List<T> childrenNodes = nodes.stream()
+                .filter(s -> parentNode.getId().equals(s.getParentId()))
+                .sorted(Comparator.comparing(T::getSort))
+                .collect(Collectors.toList());
+        if (childrenNodes.isEmpty()) {
+            return;
+        }
+        parentNode.setChildren(childrenNodes);
+        // 遍历子节点
+        for (T childrenNode : childrenNodes) {
+            buildGroupTree(childrenNode, nodes);
+        }
+    }
+
+}