com.livk.commons.util.TreeNode Maven / Gradle / Ivy

Show more of this group Show more artifacts with this name
Show all versions of spring-extension-commons Show documentation
spring commons packages
The newest version!
/*
 * Copyright 2021-2024 spring-boot-extension the original author or authors.
 *
 * 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
 *
 *       https://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.
 */

package com.livk.commons.util;

import com.fasterxml.jackson.annotation.JsonInclude;
import lombok.AllArgsConstructor;
import lombok.Data;
import lombok.NoArgsConstructor;
import lombok.experimental.Accessors;
import lombok.extern.slf4j.Slf4j;
import org.springframework.util.CollectionUtils;

import java.util.ArrayList;
import java.util.List;

/**
 * 
 * 树形检点,无法出现相同的ID节点
 * 
 *
 * @param  树形节点ID相关type
 * @param  树形节点数据相关type
 * @author livk
 */
@Slf4j
@Data
@Accessors(chain = true)
@NoArgsConstructor
@AllArgsConstructor
@JsonInclude(JsonInclude.Include.NON_NULL)
public class TreeNode {

	private I id;

	private T node;

	private I pid;

	private List> children;

	/**
	 * 创建一个root树形节点
	 * @param  树形节点ID相关type
	 * @param  树形节点数据相关type
	 * @param id id
	 * @param node node
	 * @return tree node
	 */
	public static  TreeNode createRoot(I id, T node) {
		return new TreeNode<>(id, node, null, new ArrayList<>());
	}

	/**
	 * 添加一个子节点,出现相同ID则无法添加
	 * @param treeNo TreeNode
	 * @return boolean
	 */
	public boolean addChild(TreeNode treeNo) {
		if (this.findById(treeNo.id) != null) {
			log.info("出现相同节点 id:{}", treeNo.id);
			return false;
		}
		TreeNode parent = this.findById(treeNo.pid);
		if (parent == null) {
			return false;
		}
		if (CollectionUtils.isEmpty(parent.children)) {
			parent.children = new ArrayList<>();
		}
		return parent.children.add(treeNo);
	}

	/**
	 * 设置子节点,会根据父子关系进行自动匹配
	 * @param nodes TreeNode List
	 */
	public void setChildren(List> nodes) {
		List> treeNodeList = nodes.stream().filter(node -> id.equals(node.pid)).toList();
		if (!CollectionUtils.isEmpty(treeNodeList)) {
			children = new ArrayList<>();
			children.addAll(treeNodeList);
			children.forEach(child -> child.setChildren(nodes));
		}
	}

	/**
	 * 根据ID查找一个节点
	 * @param id id
	 * @return tree node
	 */
	public TreeNode findById(I id) {
		if (this.id.equals(id)) {
			return this;
		}
		if (!CollectionUtils.isEmpty(children)) {
			for (TreeNode child : children) {
				TreeNode treeNo = child.findById(id);
				if (treeNo != null) {
					return treeNo;
				}
			}
		}
		return null;
	}

}