/*
|
* Copyright [2020-2030] [https://www.stylefeng.cn]
|
*
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
* you may not use this file except in compliance with the License.
|
* You may obtain a copy of the License at
|
*
|
* http://www.apache.org/licenses/LICENSE-2.0
|
*
|
* Unless required by applicable law or agreed to in writing, software
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
* See the License for the specific language governing permissions and
|
* limitations under the License.
|
*
|
* Guns采用APACHE LICENSE 2.0开源协议，您在使用过程中，需要注意以下几点：
|
*
|
* 1.请不要删除和修改根目录下的LICENSE文件。
|
* 2.请不要删除和修改Guns源码头部的版权声明。
|
* 3.请保留源码和相关描述文件的项目出处，作者声明等。
|
* 4.分发源码时候，请注明软件出处 https://gitee.com/stylefeng/guns
|
* 5.在修改包名，模块名称，项目代码等时，请注明软件出处 https://gitee.com/stylefeng/guns
|
* 6.若您的项目无法满足以上几点，可申请商业授权
|
*/
|
package cn.stylefeng.roses.kernel.rule.tree.factory;
|
|
import cn.stylefeng.roses.kernel.rule.tree.factory.base.AbstractTreeBuildFactory;
|
import cn.stylefeng.roses.kernel.rule.tree.factory.base.AbstractTreeNode;
|
import lombok.Data;
|
|
import java.util.ArrayList;
|
import java.util.List;
|
|
/**
|
* 默认递归工具类，用于遍历有父子关系的节点，例如菜单树，字典树等等
|
*
|
* @author fengshuonan
|
* @date 2018/7/25 下午5:59
|
*/
|
@Data
|
public class DefaultTreeBuildFactory<T extends AbstractTreeNode> implements AbstractTreeBuildFactory<T> {
|
|
/**
|
* 顶级节点的父节点id(默认-1)
|
*/
|
private String rootParentId = "-1";
|
|
public DefaultTreeBuildFactory() {
|
|
}
|
|
public DefaultTreeBuildFactory(String rootParentId) {
|
this.rootParentId = rootParentId;
|
}
|
|
@Override
|
public List<T> doTreeBuild(List<T> nodes) {
|
|
// 将每个节点的构造一个子树
|
for (T treeNode : nodes) {
|
this.buildChildNodes(nodes, treeNode, new ArrayList<>());
|
}
|
|
// 只保留上级是根节点的节点，也就是只留下所有一级节点
|
ArrayList<T> results = new ArrayList<>();
|
for (T node : nodes) {
|
if (node.getNodeParentId().equals(rootParentId)) {
|
results.add(node);
|
}
|
}
|
|
return results;
|
}
|
|
/**
|
* 查询子节点的集合
|
*
|
* @param totalNodes 所有节点的集合
|
* @param node 被查询节点的id
|
* @param childNodeLists 被查询节点的子节点集合
|
*/
|
private void buildChildNodes(List<T> totalNodes, T node, List<T> childNodeLists) {
|
if (totalNodes == null || node == null) {
|
return;
|
}
|
|
List<T> nodeSubLists = getSubChildsLevelOne(totalNodes, node);
|
|
if (nodeSubLists.size() == 0) {
|
|
} else {
|
for (T nodeSubList : nodeSubLists) {
|
buildChildNodes(totalNodes, nodeSubList, new ArrayList<>());
|
}
|
}
|
|
childNodeLists.addAll(nodeSubLists);
|
node.setChildrenNodes(childNodeLists);
|
}
|
|
/**
|
* 获取子一级节点的集合
|
*
|
* @param list 所有节点的集合
|
* @param node 被查询节点的model
|
* @author fengshuonan
|
*/
|
private List<T> getSubChildsLevelOne(List<T> list, T node) {
|
List<T> nodeList = new ArrayList<>();
|
for (T nodeItem : list) {
|
if (nodeItem.getNodeParentId().equals(node.getNodeId())) {
|
nodeList.add(nodeItem);
|
}
|
}
|
return nodeList;
|
}
|
|
}
|
