APP人员管理树形结构

aijinhui

2023-11-06 a11b250c8d091b382a083012e4575ffdf53f0677

 ruoyi-system/src/main/java/com/ruoyi/system/service/impl/SysDeptServiceImpl.java

@@ -4,10 +4,10 @@
import java.util.stream.Collectors;

import com.baomidou.mybatisplus.core.conditions.query.QueryWrapper;
import com.ruoyi.common.core.domain.*;
import org.springframework.stereotype.Service;
import com.ruoyi.common.annotation.DataScope;
import com.ruoyi.common.constant.UserConstants;
import com.ruoyi.common.core.domain.TreeSelect;
import com.ruoyi.common.core.domain.entity.SysDept;
import com.ruoyi.common.core.domain.entity.SysRole;
import com.ruoyi.common.core.domain.entity.SysUser;
@@ -351,5 +351,136 @@
        return deptList;
    }

    @Override
    public List<SysDept> all() {
        return deptMapper.selectList(null);
    }

    @Override
    public List<SysDept> allByUser(List<Long> deptList) {
        QueryWrapper<SysDept> queryWrapper = new QueryWrapper();
        queryWrapper.in("dept_id",deptList).eq("del_flag","0");
        return deptMapper.selectList(queryWrapper);
    }

    @Override
    public List<TreeDeptWell> wellTree(List<TreeDeptWell> depts) {
        List<TreeDeptWell> deptTrees = buildDeptWellTree(depts);
        return deptTrees;
//        return deptTrees.stream().map(TreeSelectWell::new).collect(Collectors.toList());
    }

    @Override
    public List<TreeDeptWell> buildDeptWellTree(List<TreeDeptWell> depts)
    {
        List<TreeDeptWell> returnList = new ArrayList<TreeDeptWell>();
        List<Long> tempList = depts.stream().map(TreeDeptWell::getDeptId).collect(Collectors.toList());
        for (TreeDeptWell dept : depts)
        {
            // 如果是顶级节点, 遍历该父节点的所有子节点
            if (!tempList.contains(dept.getParentId()))
            {
                recursionFnWell(depts, dept);
                returnList.add(dept);
            }
        }
        if (returnList.isEmpty())
        {
            returnList = depts;
        }
        return returnList;
    }

    private void recursionFnWell(List<TreeDeptWell> list, TreeDeptWell t)
    {
        // 得到子节点列表
        if(t.getId() == null){
            List<TreeDeptWell> childList = getChildListWell(list, t);
            t.setChildren(childList);
            for (TreeDeptWell tChild : childList)
            {
                if (hasChildWell(list, tChild))
                {
                    recursionFnWell(list, tChild);
                }
            }
        }
    }

    private List<TreeDeptWell> getChildListWell(List<TreeDeptWell> list, TreeDeptWell t)
    {
        List<TreeDeptWell> tlist = new ArrayList<TreeDeptWell>();
        Iterator<TreeDeptWell> it = list.iterator();
        while (it.hasNext())
        {
            TreeDeptWell n = (TreeDeptWell) it.next();
            if (StringUtils.isNotNull(n.getParentId()) && n.getParentId().longValue() == t.getDeptId().longValue())
            {
                tlist.add(n);
            }
        }
        return tlist;
    }

    private boolean hasChildWell(List<TreeDeptWell> list, TreeDeptWell t)
    {
        return getChildListWell(list, t).size() > 0;
    }



    @Override
    public List<DeptUserTree> deptUserTree(List<DeptUserTree> depts)
    {
        List<DeptUserTree> returnList = new ArrayList<>();
        List<Long> tempList = depts.stream().map(DeptUserTree::getDeptId).collect(Collectors.toList());
        for (DeptUserTree dept : depts)
        {
            // 如果是顶级节点, 遍历该父节点的所有子节点
            if (!tempList.contains(dept.getParentId()))
            {
                recursionFnDeptUserTree(depts, dept);
                returnList.add(dept);
            }
        }
        if (returnList.isEmpty())
        {
            returnList = depts;
        }
        return returnList;
    }

    private void recursionFnDeptUserTree(List<DeptUserTree> list, DeptUserTree t)
    {
        // 得到子节点列表
        if(t.getUserId()==null){
            List<DeptUserTree> childList = getChildListDeptUserTree(list, t);
            t.setChildren(childList);
            for (DeptUserTree tChild : childList) {
                if (hasChildDeptUserTree(list, tChild)) {
                    recursionFnDeptUserTree(list, tChild);
                }
            }
        }
    }

    private List<DeptUserTree> getChildListDeptUserTree(List<DeptUserTree> list, DeptUserTree t)
    {
        List<DeptUserTree> tlist = new ArrayList<>();
        Iterator<DeptUserTree> it = list.iterator();
        while (it.hasNext())
        {
            DeptUserTree n = (DeptUserTree) it.next();
            if (StringUtils.isNotNull(n.getParentId()) && n.getParentId().longValue() == t.getDeptId().longValue())
            {
                tlist.add(n);
            }
        }
        return tlist;
    }

    private boolean hasChildDeptUserTree(List<DeptUserTree> list, DeptUserTree t)
    {
        return getChildListDeptUserTree(list, t).size() > 0;
    }
}