java树结构工具-TreeUtil（注解的方式实现）

树结构工具-TreeUtil（注解的方式实现）

将有树结构的集合封装为树结构

使用步骤：

1. 添加依赖

      
        com.github.appundefined
        treeUtils
        1.0.1-RELEASE
    

2. 在需要转换为树结构的对象字段上添加核心注解3个

@TreeElement(name = "id")          
private String id;                 
@TreeElement(name = "pid")         
private String pid;                            
@TreeElement(name = "children")   
private List<Object> children = new ArrayList<>();（注：没有List集合需要添加一个）

3. 调用

List trees = TreeUtils.ListToTree(objects);

4. 源码地址

https://github.com/AppUndefined/javaUtils.git

5. 源码

一个注解：TreeElement

package com.github.appundefined.tree;

import java.lang.annotation.*;

@Target(value= {ElementType.FIELD})
@Documented
@Retention(value = RetentionPolicy.RUNTIME)
public @interface TreeElement {
    String name();
}

一个注解：TreeTreeUtils

package com.github.appundefined.tree;

import java.lang.reflect.Field;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;

public class TreeUtils {
    /**
     * Root node value
     */
    static String rootNode = "0";
    /**
     * Primary key id
     */
    static String id = "id";
    /**
     * Parent node id
     */
    static String pid = "pid";
    /**
     * Child node collection
     */
    static String children = "children";

    /**
     * Convert List to List Tree
     * @param trees t
     * @param  t
     * @return result
     * @throws IllegalAccessException result
     */
    public  static   <T>  List<T>   ListToTree(List<T> trees) throws IllegalAccessException {
         //Root node collection
        List<T> rootList = new ArrayList<T>();
        HashMap<Object, List<T>> pidAndTrees= new HashMap<>();
        for (final T t : trees) {
            Object value = getValue(t, pid);
            if(value!=null){
                if(pidAndTrees.get(value)!=null) {
                    pidAndTrees.get(value).add(t);
                }else{
                    pidAndTrees.put(value,new ArrayList<T>(){{this.add(t);}});
                }
                if(rootNode.equals(value)) {
                    rootList.add(t);
                }
            }
        }
        buildChilTree(rootList,pidAndTrees);
        return rootList;
    }

    /**
     * Get the field value corresponding to the specified annotation value of the object
     * @param t
     * @param key
     * @param 
     * @return
     * @throws IllegalAccessException
     */
    private static   <T>  Object getValue(T t,String key) throws IllegalAccessException {
        Field[] fields = t.getClass().getDeclaredFields();
        for (Field field : fields) {
            field.setAccessible(true);
            TreeElement treeElement = field.getAnnotation(TreeElement.class);
            if(treeElement!=null){
                String name = treeElement.name();
                if(key.equals(name)){
                    Object o = field.get(t);
                    return o;
                }
            }
        }
        return null;
    }

    /**
     * Recursive construction
     * @param currentTrees
     * @param trees
     * @param 
     * @throws IllegalAccessException
     */
    private static  <T> void  buildChilTree(List<T> currentTrees,    HashMap<Object, List<T>>  trees) throws IllegalAccessException {
        for (T t : currentTrees) {
            Object currentId = getValue(t, id);
            //Data exists with current id as pid
            if(trees.get(currentId)!=null){
                List list = (List) getValue(t, children);
                list.addAll(trees.get(currentId));
                buildChilTree(trees.get(currentId),trees);
            }
        }

    }

}