获取组织架构

app/controller/api/store/merchant/Taskorderguquan.php

@@ -16,6 +16,54 @@ class Taskorderguquan
 
     public function assignment()
     {
+        try {
+            // 1. 获取所有用户数据（按level_id正序排序保证父级在前）
+            $users = Db::name('user')
+                ->where('is_del', '=', 0)
+                ->where('status', '=', 1)
+                ->where('user_group', '>=', 2)
+                ->order('level_id', 'asc')
+                ->field('uid,account,nickname,level_id,is_del,status,user_group')
+                ->select()
+                ->toArray();
+
+            // 2. 构建以UID为键的映射表
+            $userMap = [];
+            foreach ($users as $user) {
+                $user['children'] = []; // 初始化子节点
+                $userMap[$user['uid']] = [
+                    '用户ID' => $user['uid'],
+                    '用户账号' => $user['account'],
+                    '用户昵称' => $user['nickname'],
+                    '用户身份' => $user['user_group'],
+                    '上级用户ID' => $user['level_id'],
+                    '直属下级用户人数' => 0,
+                    '直属下级用户列表' => $user['children'],
+                ];
+            }
+
+            // 3. 递归构建树形结构
+            $tree = [];
+            foreach ($userMap as $uid => &$user) {
+                $parentId = $user['上级用户ID'];
+
+                if ($parentId == 0) {
+                    // 顶级节点直接加入树
+                    $tree[] = &$user;
+                } elseif (isset($userMap[$parentId])) {
+                    // 非顶级节点加入父节点的children
+                    $userMap[$parentId]['直属下级用户列表'][] = &$user;
+                    $userMap[$parentId]['直属下级用户人数']++;
+                }
+            }
+            unset($user); // 销毁引用
+
+            return json($tree);
+        } catch (\Exception $e) {
+            // 记录错误日志
+            return json(['code' => 0, 'msg' => '树结构生成失败']);
+        }
+
         /**
          * 8000元补贴下面人员
          * 13231658486周行体1000