85 lines
2.0 KiB
Java
85 lines
2.0 KiB
Java
/**
|
|
* Copyright (c) 2018-2028, Chill Zhuang 庄骞 (smallchill@163.com).
|
|
* <p>
|
|
* Licensed under the GNU LESSER GENERAL PUBLIC LICENSE 3.0;
|
|
* you may not use this file except in compliance with the License.
|
|
* You may obtain a copy of the License at
|
|
* <p>
|
|
* http://www.gnu.org/licenses/lgpl.html
|
|
* <p>
|
|
* 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.
|
|
*/
|
|
package org.springblade.core.tool.node;
|
|
|
|
import com.google.common.collect.ImmutableMap;
|
|
import com.google.common.collect.Maps;
|
|
import org.springblade.core.tool.utils.StringPool;
|
|
|
|
import java.util.ArrayList;
|
|
import java.util.List;
|
|
import java.util.Map;
|
|
|
|
/**
|
|
* 森林管理类
|
|
*
|
|
* @author smallchill
|
|
*/
|
|
public class ForestNodeManager<T extends INode<T>> {
|
|
|
|
/**
|
|
* 森林的所有节点
|
|
*/
|
|
private final ImmutableMap<Long, T> nodeMap;
|
|
|
|
/**
|
|
* 森林的父节点ID
|
|
*/
|
|
private final Map<Long, Object> parentIdMap = Maps.newHashMap();
|
|
|
|
public ForestNodeManager(List<T> nodes) {
|
|
nodeMap = Maps.uniqueIndex(nodes, INode::getId);
|
|
}
|
|
|
|
/**
|
|
* 根据节点ID获取一个节点
|
|
*
|
|
* @param id 节点ID
|
|
* @return 对应的节点对象
|
|
*/
|
|
public INode<T> getTreeNodeAt(Long id) {
|
|
if (nodeMap.containsKey(id)) {
|
|
return nodeMap.get(id);
|
|
}
|
|
return null;
|
|
}
|
|
|
|
/**
|
|
* 增加父节点ID
|
|
*
|
|
* @param parentId 父节点ID
|
|
*/
|
|
public void addParentId(Long parentId) {
|
|
parentIdMap.put(parentId, StringPool.EMPTY);
|
|
}
|
|
|
|
/**
|
|
* 获取树的根节点(一个森林对应多颗树)
|
|
*
|
|
* @return 树的根节点集合
|
|
*/
|
|
public List<T> getRoot() {
|
|
List<T> roots = new ArrayList<>();
|
|
nodeMap.forEach((key, node) -> {
|
|
if (node.getParentId() == 0 || parentIdMap.containsKey(node.getId())) {
|
|
roots.add(node);
|
|
}
|
|
});
|
|
return roots;
|
|
}
|
|
|
|
}
|