用hutools查询树结构

本文介绍了如何在Java项目中利用Hutool库查询和操作树结构数据,包括导入Hutool依赖,定义实体类以及具体的代码实现过程。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

1.需导入依赖


   	<!--hutool工具-->
     <dependency>
         <groupId>cn.hutool</groupId>
         <artifactId>hutool-all</artifactId>
         <version>5.3.8</version>
     </dependency>
     <dependency>
         <groupId>commons-collections</groupId>
         <artifactId>commons-collections</artifactId>
         <version>3.2</version>
         <scope>compile</scope>
     </dependency>
     <dependency>
         <groupId>commons-beanutils</groupId>
         <artifactId>commons-beanutils</artifactId>
         <version>1.9.4</version>
         <scope>compile</scope>
     </dependency>

2.实体类

@AllArgsConstructor
@NoArgsConstructor
@Data
public class TreeDemo {
    private String id;
    private String columnName;
    private String parentId;
    private Double sortNum;

}

3. 代码实现

package com.xxxx.studyseckill.tree;


import cn.hutool.core.lang.tree.Tree;
import cn.hutool.core.lang.tree.TreeNode;
import cn.hutool.core.lang.tree.TreeNodeConfig;
import cn.hutool.core.lang.tree.TreeUtil;
import com.baomidou.mybatisplus.core.conditions.query.LambdaQueryWrapper;
import com.baomidou.mybatisplus.toolkit.CollectionUtils;
import com.xxxx.studyseckill.mapper.TreeDemoMapper;

import org.apache.commons.beanutils.BeanComparator;
import org.apache.commons.collections.ComparatorUtils;
import org.apache.commons.collections.comparators.ComparableComparator;
import org.thymeleaf.util.StringUtils;

import javax.annotation.Resource;
import java.util.*;
import java.util.stream.Collectors;

public class TestTree {

    @Resource
    private TreeDemoMapper treeDemoMapper;

    public List<Tree<String>> getTree(String parentId){
        List<Tree<String>> resultTree = new ArrayList<>();
        if(StringUtils.isEmpty(parentId)){
            parentId = "root";
        }
        List<TreeDemo> demoTreeList = this.getDemoByParentId(parentId,new ArrayList<>());

        //转换成树结点
        List<TreeNode<String>> treeNodeList = demoTreeList.stream().map(treeDemo -> {
            Map<String,Object> map = new HashMap<>();
            map.put("columnName",treeDemo.getColumnName());
            map.put("id",treeDemo.getId());
            map.put("sortNum",treeDemo.getSortNum());
            TreeNode<String> treeNode = new TreeNode<String>().setId(treeDemo.getId()).setParentId(treeDemo.getParentId()).setExtra(map);
            return treeNode;
        }).collect(Collectors.toList());
        //转换树形列表中字段名称
        TreeNodeConfig config = new TreeNodeConfig().setChildrenKey("children").setIdKey("id").setParentIdKey("parentId");
        //转换树结点到树形列表
        String rootTreeNode = "root";
        if(CollectionUtils.isNotEmpty(demoTreeList)){
            rootTreeNode = demoTreeList.get(0).getParentId();
        }
        List<Tree<String>> treeList = TreeUtil.build(treeNodeList,rootTreeNode,config,(node,tree)->{
            tree.setId(node.getId()).setParentId(node.getParentId());
            tree.putExtra("columnName",node.getExtra().get("columnName"));
            tree.putExtra("id",node.getExtra().get("id"));
            tree.putExtra("sortNum",node.getExtra().get("sortNum"));
        });
        //排序
        treeListSort(treeList);

        return treeList;
    }

   

    /**
     * 获取当前结点和子节点的值
     * @param parentId
     * @return
     */
    private List<TreeDemo> getDemoByParentId(String parentId,List<TreeDemo> treeDemoList) {
        //获取当前结点信息
        TreeDemo currentTreeDemo = treeDemoMapper.selectOne(new LambdaQueryWrapper<TreeDemo>().eq(TreeDemo::getId, parentId).last("limit 1"));
        if(Objects.nonNull(currentTreeDemo)){
            treeDemoList.add(currentTreeDemo);
        }
        //获取子节点信息
        List<TreeDemo> demoTreeList = this.treeDemoMapper.getTreeDemoByParentId(parentId);
        treeDemoList.addAll(demoTreeList);
        if(CollectionUtils.isNotEmpty(demoTreeList)){
            for (TreeDemo treeDemo : demoTreeList) {
                String id = treeDemo.getId();
                getDemoByParentId(id,treeDemoList);
            }
        } else {
            return demoTreeList;
        }
        //去除重复值
        LinkedHashSet<TreeDemo> hashSet = new LinkedHashSet<>(demoTreeList);
        ArrayList<TreeDemo> listWithoutDuplicates = new ArrayList<>(hashSet);

        return listWithoutDuplicates;
    }

 	/**
     * 对树集合升序排列
     * @param treeList
     */
    private void treeListSort(List<Tree<String>> treeList) {
        Comparator<?> instance = ComparableComparator.getInstance();
        instance = ComparatorUtils.nullLowComparator(instance);
        treeList.sort(new BeanComparator<>("sortNum",instance));
        treeList.forEach(e -> {
            List<Tree<String>> childrenList = e.getChildren();
            if(CollectionUtils.isNotEmpty(childrenList)){
                treeListSort(childrenList);
            }
        });
    }
}
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值