344 lines
9.7 KiB
PHP
344 lines
9.7 KiB
PHP
<?php
|
|
// +----------------------------------------------------------------------
|
|
// | likeadmin快速开发前后端分离管理后台（PHP版）
|
|
// +----------------------------------------------------------------------
|
|
// | 欢迎阅读学习系统程序代码，建议反馈是我们前进的动力
|
|
// | 开源版本可自由商用，可去除界面版权logo
|
|
// | gitee下载：https://gitee.com/likeshop_gitee/likeadmin
|
|
// | github下载：https://github.com/likeshop-github/likeadmin
|
|
// | 访问官网：https://www.likeadmin.cn
|
|
// | likeadmin团队 版权所有 拥有最终解释权
|
|
// +----------------------------------------------------------------------
|
|
// | author: likeadminTeam
|
|
// +----------------------------------------------------------------------
|
|
|
|
namespace app\adminapi\logic\dept;
|
|
|
|
use app\common\logic\BaseLogic;
|
|
use app\common\model\auth\Admin;
|
|
use app\common\model\auth\AdminDept;
|
|
use app\common\model\dept\Dept;
|
|
|
|
|
|
/**
|
|
* 部门管理逻辑
|
|
* Class DeptLogic
|
|
* @package app\adminapi\logic\dept
|
|
*/
|
|
class DeptLogic extends BaseLogic
|
|
{
|
|
|
|
/**
|
|
* @notes 部门列表
|
|
* @param $params
|
|
* @return array
|
|
* @throws \think\db\exception\DataNotFoundException
|
|
* @throws \think\db\exception\DbException
|
|
* @throws \think\db\exception\ModelNotFoundException
|
|
* @author 段誉
|
|
* @date 2022/5/30 15:44
|
|
*/
|
|
public static function lists($params)
|
|
{
|
|
$where = [];
|
|
if (!empty($params['name'])) {
|
|
$where[] = ['name', 'like', '%' . $params['name'] . '%'];
|
|
}
|
|
if (isset($params['status']) && $params['status'] != '') {
|
|
$where[] = ['status', '=', $params['status']];
|
|
}
|
|
$lists = Dept::where($where)
|
|
->append(['status_desc'])
|
|
->order(['sort' => 'desc', 'id' => 'desc'])
|
|
->select()
|
|
->toArray();
|
|
|
|
$totalsWithSubtree = self::deptAdminCountTotalsWithSubtree();
|
|
foreach ($lists as &$row) {
|
|
$row['admin_count'] = $totalsWithSubtree[(int) $row['id']] ?? 0;
|
|
}
|
|
unset($row);
|
|
|
|
$pid = 0;
|
|
if (!empty($lists)) {
|
|
$pid = min(array_column($lists, 'pid'));
|
|
}
|
|
return self::getTree($lists, $pid);
|
|
}
|
|
|
|
/**
|
|
* 每个部门人数（直属 + 所有下级部门），基于全表部门树汇总；管理员来自 admin_dept，排除已删除账号
|
|
*
|
|
* @return array<int, int> dept_id => count
|
|
*/
|
|
private static function deptAdminCountTotalsWithSubtree(): array
|
|
{
|
|
$treeRows = Dept::field(['id', 'pid'])->select()->toArray();
|
|
if ($treeRows === []) {
|
|
return [];
|
|
}
|
|
$allIds = array_map('intval', array_column($treeRows, 'id'));
|
|
$directMap = self::fetchDirectAdminCountMap($allIds);
|
|
|
|
$childrenByPid = [];
|
|
foreach ($treeRows as $r) {
|
|
$pid = (int) $r['pid'];
|
|
$id = (int) $r['id'];
|
|
if (!isset($childrenByPid[$pid])) {
|
|
$childrenByPid[$pid] = [];
|
|
}
|
|
$childrenByPid[$pid][] = $id;
|
|
}
|
|
|
|
$memo = [];
|
|
$dfs = function (int $id) use (&$dfs, $childrenByPid, $directMap, &$memo): int {
|
|
if (array_key_exists($id, $memo)) {
|
|
return $memo[$id];
|
|
}
|
|
$sum = $directMap[$id] ?? 0;
|
|
foreach ($childrenByPid[$id] ?? [] as $cid) {
|
|
$sum += $dfs((int) $cid);
|
|
}
|
|
$memo[$id] = $sum;
|
|
|
|
return $sum;
|
|
};
|
|
|
|
$out = [];
|
|
foreach ($allIds as $id) {
|
|
$out[$id] = $dfs($id);
|
|
}
|
|
|
|
return $out;
|
|
}
|
|
|
|
/**
|
|
* 各部门直属管理员人数
|
|
*
|
|
* @param array<int, int> $deptIds
|
|
* @return array<int, int>
|
|
*/
|
|
private static function fetchDirectAdminCountMap(array $deptIds): array
|
|
{
|
|
if ($deptIds === []) {
|
|
return [];
|
|
}
|
|
$adminTable = (new Admin())->getTable();
|
|
$rows = AdminDept::alias('ad')
|
|
->join($adminTable . ' a', 'a.id = ad.admin_id')
|
|
->whereNull('a.delete_time')
|
|
->whereIn('ad.dept_id', $deptIds)
|
|
->field('ad.dept_id, COUNT(*) AS admin_count')
|
|
->group('ad.dept_id')
|
|
->select()
|
|
->toArray();
|
|
$map = [];
|
|
foreach ($rows as $r) {
|
|
$map[(int) $r['dept_id']] = (int) $r['admin_count'];
|
|
}
|
|
|
|
return $map;
|
|
}
|
|
|
|
/**
|
|
* @notes 列表树状结构
|
|
* @param $array
|
|
* @param int $pid
|
|
* @param int $level
|
|
* @return array
|
|
* @author 段誉
|
|
* @date 2022/5/30 15:44
|
|
*/
|
|
public static function getTree($array, $pid = 0, $level = 0)
|
|
{
|
|
$list = [];
|
|
foreach ($array as $key => $item) {
|
|
if ($item['pid'] == $pid) {
|
|
$item['level'] = $level;
|
|
$item['children'] = self::getTree($array, $item['id'], $level + 1);
|
|
$list[] = $item;
|
|
}
|
|
}
|
|
return $list;
|
|
}
|
|
|
|
|
|
/**
|
|
* @notes 上级部门
|
|
* @return array
|
|
* @throws \think\db\exception\DataNotFoundException
|
|
* @throws \think\db\exception\DbException
|
|
* @throws \think\db\exception\ModelNotFoundException
|
|
* @author 段誉
|
|
* @date 2022/5/26 18:36
|
|
*/
|
|
public static function leaderDept()
|
|
{
|
|
$lists = Dept::field(['id', 'name'])->where(['status' => 1])
|
|
->order(['sort' => 'desc', 'id' => 'desc'])
|
|
->select()
|
|
->toArray();
|
|
return $lists;
|
|
}
|
|
|
|
|
|
/**
|
|
* @notes 添加部门
|
|
* @param array $params
|
|
* @author 段誉
|
|
* @date 2022/5/25 18:20
|
|
*/
|
|
public static function add(array $params)
|
|
{
|
|
Dept::create([
|
|
'pid' => $params['pid'],
|
|
'name' => $params['name'],
|
|
'leader' => $params['leader'] ?? '',
|
|
'mobile' => $params['mobile'] ?? '',
|
|
'status' => $params['status'],
|
|
'sort' => $params['sort'] ?? 0
|
|
]);
|
|
}
|
|
|
|
|
|
/**
|
|
* @notes 编辑部门
|
|
* @param array $params
|
|
* @return bool
|
|
* @author 段誉
|
|
* @date 2022/5/25 18:39
|
|
*/
|
|
public static function edit(array $params): bool
|
|
{
|
|
try {
|
|
$pid = $params['pid'];
|
|
$oldDeptData = Dept::findOrEmpty($params['id']);
|
|
if ($oldDeptData['pid'] == 0) {
|
|
$pid = 0;
|
|
}
|
|
|
|
Dept::update([
|
|
'id' => $params['id'],
|
|
'pid' => $pid,
|
|
'name' => $params['name'],
|
|
'leader' => $params['leader'] ?? '',
|
|
'mobile' => $params['mobile'] ?? '',
|
|
'status' => $params['status'],
|
|
'sort' => $params['sort'] ?? 0
|
|
]);
|
|
return true;
|
|
} catch (\Exception $e) {
|
|
self::setError($e->getMessage());
|
|
return false;
|
|
}
|
|
}
|
|
|
|
|
|
/**
|
|
* @notes 删除部门
|
|
* @param array $params
|
|
* @author 段誉
|
|
* @date 2022/5/25 18:40
|
|
*/
|
|
public static function delete(array $params)
|
|
{
|
|
Dept::destroy($params['id']);
|
|
}
|
|
|
|
|
|
/**
|
|
* @notes 获取部门详情
|
|
* @param $params
|
|
* @return array
|
|
* @author 段誉
|
|
* @date 2022/5/25 18:40
|
|
*/
|
|
public static function detail($params): array
|
|
{
|
|
return Dept::findOrEmpty($params['id'])->toArray();
|
|
}
|
|
|
|
|
|
/**
|
|
* @notes 部门数据
|
|
* @return array
|
|
* @throws \think\db\exception\DataNotFoundException
|
|
* @throws \think\db\exception\DbException
|
|
* @throws \think\db\exception\ModelNotFoundException
|
|
* @author 段誉
|
|
* @date 2022/10/13 10:19
|
|
*/
|
|
public static function getAllData()
|
|
{
|
|
// 与业绩看板等统计口径一致：含全部未软删部门（不再仅限 status=启用），
|
|
// 避免外链 assistant_dept_id 在树下拉中不存在导致 TreeSelect 初始化异常。
|
|
$data = Dept::order(['sort' => 'desc', 'id' => 'desc'])
|
|
->select()
|
|
->toArray();
|
|
|
|
if ($data === []) {
|
|
return [];
|
|
}
|
|
|
|
$pid = min(array_column($data, 'pid'));
|
|
return self::getTree($data, $pid);
|
|
}
|
|
|
|
/**
|
|
* 指定部门及其全部下级部门 id（含自身）。筛选时选父级可匹配子级下成员（admin_dept.dept_id）。
|
|
*
|
|
* @return array<int>
|
|
*/
|
|
public static function getSelfAndDescendantIds(int $rootDeptId): array
|
|
{
|
|
if ($rootDeptId <= 0) {
|
|
return [];
|
|
}
|
|
$rows = Dept::field(['id', 'pid'])->select()->toArray();
|
|
if ($rows === []) {
|
|
return [$rootDeptId];
|
|
}
|
|
$validIds = [];
|
|
foreach ($rows as $r) {
|
|
$id = (int) ($r['id'] ?? 0);
|
|
if ($id > 0) {
|
|
$validIds[$id] = true;
|
|
}
|
|
}
|
|
if (!isset($validIds[$rootDeptId])) {
|
|
return [$rootDeptId];
|
|
}
|
|
$childrenByPid = [];
|
|
foreach ($rows as $r) {
|
|
$pid = (int) ($r['pid'] ?? 0);
|
|
$id = (int) ($r['id'] ?? 0);
|
|
if ($id <= 0) {
|
|
continue;
|
|
}
|
|
if (!isset($childrenByPid[$pid])) {
|
|
$childrenByPid[$pid] = [];
|
|
}
|
|
$childrenByPid[$pid][] = $id;
|
|
}
|
|
$out = [];
|
|
$queue = [$rootDeptId];
|
|
$seen = [];
|
|
while ($queue !== []) {
|
|
$id = array_shift($queue);
|
|
if (isset($seen[$id])) {
|
|
continue;
|
|
}
|
|
$seen[$id] = true;
|
|
$out[] = $id;
|
|
foreach ($childrenByPid[$id] ?? [] as $cid) {
|
|
$cid = (int) $cid;
|
|
if ($cid > 0 && !isset($seen[$cid])) {
|
|
$queue[] = $cid;
|
|
}
|
|
}
|
|
}
|
|
|
|
return $out;
|
|
}
|
|
|
|
} |