DepartmentController.php 3.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141
  1. <?php
  2. namespace App\Http\Controllers\API;
  3. use App\Http\Controllers\Controller;
  4. use App\Http\Requests\API\Department\CreateOrUpdateRequest;
  5. use App\Http\Resources\API\DepartmentResource;
  6. use App\Models\Department;
  7. use App\Models\User;
  8. use Illuminate\Http\Request;
  9. use Illuminate\Support\Facades\Auth;
  10. class DepartmentController extends Controller
  11. {
  12. public function index(Request $request)
  13. {
  14. return $this->getDepartments($request);
  15. }
  16. public function publicSearch(Request $request)
  17. {
  18. return $this->getDepartments($request);
  19. }
  20. protected function getDepartments(Request $request)
  21. {
  22. $sort = $request->input('sort', 'desc');
  23. $pageSize = $request->get('page_size') ?? 10;
  24. $departments = Department::filter($request->all())->orderBy('created_at', $sort)->paginate($pageSize);
  25. $departmentTree = !empty(make_tree($departments->toArray()['data'])) ? make_tree($departments->toArray()['data']) : $departments->toArray()['data'];
  26. $page = $departments->currentPage();
  27. $newId = ($page - 1) * $pageSize+1;
  28. make_tree_display_id($departmentTree,$newId,$newId);
  29. return [
  30. 'data' => $departmentTree,
  31. 'total' => $departments->total(),
  32. ];
  33. }
  34. public function store(CreateOrUpdateRequest $request)
  35. {
  36. $department=new Department();
  37. $department->mergeFillable([
  38. 'company_id'
  39. ]);
  40. $department->fill([
  41. ...$request->all(),
  42. 'company_id' => Auth::user()->company_id,
  43. ]);
  44. $department->save();
  45. return $this->created();
  46. }
  47. public function show(string $id)
  48. {
  49. $department=Department::query()->findOrFail($id);
  50. return new DepartmentResource($department);
  51. }
  52. public function update(CreateOrUpdateRequest $request,string $id)
  53. {
  54. $department=Department::findOrFail($id);
  55. $department->fill($request->all());
  56. $department->save();
  57. return $this->noContent();
  58. }
  59. public function destroy(string $id)
  60. {
  61. $department = Department::findOrFail($id);
  62. if(!empty($department->children()->first())){
  63. throw new \Exception("Please remove the sub-level departments.");
  64. }
  65. $department->delete();
  66. return $this->noContent();
  67. }
  68. public function departmentUserIndex(){
  69. //封装部门
  70. $departments=Department::query()->get(['id','name','parent_id'])->each(function ($departments){
  71. $departments->new_id='department'.$departments->id;
  72. $departments->new_parent_id='department'.$departments->parent_id;
  73. $departments->type='department';
  74. })->toArray();
  75. //封装用户
  76. $users=User::query()->where('company_id',Auth::user()->company_id)->get(['id','name','department_id'])->each(function ($users){
  77. $users->new_id='user'.$users->id;
  78. $users->new_parent_id='department'.$users->department_id;
  79. $users->type='user';
  80. })->toArray();
  81. $departmentTree=$this->makeUserTree(array_merge($departments, $users));
  82. return $this->success([
  83. 'data' => $departmentTree
  84. ]);
  85. }
  86. protected function makeUserTree(array $departmentUsers, $parentId = 'department0') {
  87. $tree = [];
  88. if (empty($departmentUsers)) {
  89. return $tree;
  90. }
  91. $newList = [];
  92. foreach ($departmentUsers as $k => $v) {
  93. $newList[$v['new_id']] = $v;
  94. }
  95. foreach ($newList as $value) {
  96. if ($parentId == $value['new_parent_id']) {
  97. $tree[] = &$newList[$value['new_id']];
  98. }elseif (isset($newList[$value['new_parent_id']])) {
  99. $newList[$value['new_parent_id']]['children'][] = &$newList[$value['new_id']];
  100. }
  101. }
  102. return $tree;
  103. }
  104. }