Skip to content

Commit ecb1dc6

Browse files
authored
Merge pull request #300 from TaskFlow-CLAP/CLAP-266
CLAP-266 작업보드 수정 api 잘못된 request 매핑 오류 수정
2 parents e37c176 + fe31d10 commit ecb1dc6

File tree

3 files changed

+11
-12
lines changed

3 files changed

+11
-12
lines changed

src/main/java/clap/server/application/mapper/NotificationMapper.java

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -17,6 +17,7 @@ public static FindNotificationListResponse toFindNoticeListResponse(Notification
1717
notification.getReceiver().getMemberId(),
1818
notification.getTask().getTitle(),
1919
notification.getMessage() != null ? notification.getMessage() : null,
20+
notification.isRead(),
2021
notification.getCreatedAt()
2122
);
2223
}

src/main/java/clap/server/application/service/task/UpdateTaskBoardService.java

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -7,11 +7,11 @@
77
import clap.server.application.port.inbound.task.UpdateTaskBoardUsecase;
88
import clap.server.application.port.inbound.task.UpdateTaskOrderAndStatusUsecase;
99
import clap.server.application.port.outbound.task.LoadTaskPort;
10-
import clap.server.domain.policy.task.TaskOrderCalculationPolicy;
11-
import clap.server.domain.policy.task.ProcessorValidationPolicy;
1210
import clap.server.common.annotation.architecture.ApplicationService;
1311
import clap.server.domain.model.member.Member;
1412
import clap.server.domain.model.task.Task;
13+
import clap.server.domain.policy.task.ProcessorValidationPolicy;
14+
import clap.server.domain.policy.task.TaskOrderCalculationPolicy;
1515
import clap.server.domain.policy.task.TaskPolicyConstants;
1616
import clap.server.exception.ApplicationException;
1717
import clap.server.exception.code.TaskErrorCode;
@@ -51,15 +51,15 @@ public void updateTaskOrder(Long processorId, UpdateTaskOrderRequest request) {
5151

5252
// 가장 상위로 이동
5353
if (request.prevTaskId() == 0) {
54-
Task nextTask = findByIdAndStatus(request.targetTaskId(), targetTask.getTaskStatus());
54+
Task nextTask = findByIdAndStatus(request.nextTaskId(), targetTask.getTaskStatus());
5555
// 해당 상태에서 바로 앞에 있는 작업 찾기
5656
Task prevTask = loadTaskPort.findPrevOrderTaskByProcessorIdAndStatus(processorId, targetTask.getTaskStatus(), nextTask.getProcessorOrder()).orElse(null);
5757
long newOrder = taskOrderCalculationPolicy.calculateOrderForTop(targetTask, nextTask);
5858
updateNewTaskOrder(targetTask, newOrder);
5959
}
6060
// 가장 하위로 이동
6161
else if (request.nextTaskId() == 0) {
62-
Task prevTask = findByIdAndStatus(request.targetTaskId(), targetTask.getTaskStatus());
62+
Task prevTask = findByIdAndStatus(request.prevTaskId(), targetTask.getTaskStatus());
6363
// 해당 상태에서 바로 뒤에 있는 작업 찾기
6464
Task nextTask = loadTaskPort.findNextOrderTaskByProcessorIdAndStatus(processorId, targetTask.getTaskStatus(), prevTask.getProcessorOrder()).orElse(null);
6565
long newOrder = taskOrderCalculationPolicy.calculateOrderForBottom(prevTask, nextTask);
@@ -99,13 +99,13 @@ public void updateTaskOrderAndStatus(Long processorId, UpdateTaskOrderRequest re
9999
processorValidationPolicy.validateProcessor(processorId, targetTask);
100100

101101
if (request.prevTaskId() == 0) {
102-
Task nextTask = findByIdAndStatus(request.targetTaskId(), targetStatus);
102+
Task nextTask = findByIdAndStatus(request.nextTaskId(), targetStatus);
103103
// 해당 상태에서 바로 앞 있는 작업 찾기
104104
Task prevTask = loadTaskPort.findPrevOrderTaskByProcessorIdAndStatus(processorId, targetStatus, nextTask.getProcessorOrder()).orElse(null);
105105
long newOrder = taskOrderCalculationPolicy.calculateOrderForTop(prevTask,nextTask);
106106
updateNewTaskOrderAndStatus(targetStatus, targetTask, newOrder);
107107
} else if (request.nextTaskId() == 0) {
108-
Task prevTask = findByIdAndStatus(request.targetTaskId(), targetStatus);
108+
Task prevTask = findByIdAndStatus(request.prevTaskId(), targetStatus);
109109
// 해당 상태에서 바로 뒤에 있는 작업 찾기
110110
Task nextTask = loadTaskPort.findNextOrderTaskByProcessorIdAndStatus(processorId, targetStatus, prevTask.getProcessorOrder()).orElse(null);
111111
long newOrder = taskOrderCalculationPolicy.calculateOrderForBottom(prevTask, nextTask);

src/main/java/clap/server/domain/policy/task/TaskOrderCalculationPolicy.java

Lines changed: 4 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -12,18 +12,16 @@ public class TaskOrderCalculationPolicy {
1212

1313
public long calculateOrderForTop(Task prevTask, Task nextTask) {
1414
Long prevTaskOrder = prevTask == null ? null : prevTask.getProcessorOrder();
15-
if (prevTaskOrder == null){
15+
if (prevTaskOrder == null) {
1616
return nextTask.getProcessorOrder() - DEFAULT_PROCESSOR_ORDER_GAP;
17-
}
18-
return calculateNewProcessorOrder(prevTaskOrder, nextTask.getProcessorOrder());
17+
} else return calculateNewProcessorOrder(prevTaskOrder, nextTask.getProcessorOrder());
1918
}
2019

2120
public long calculateOrderForBottom(Task prevTask, Task nextTask) {
2221
Long nextTaskOrder = nextTask == null ? null : nextTask.getProcessorOrder();
23-
if (nextTaskOrder == null){
22+
if (nextTaskOrder == null) {
2423
return prevTask.getProcessorOrder() + DEFAULT_PROCESSOR_ORDER_GAP;
25-
}
26-
return calculateNewProcessorOrder(prevTask.getProcessorOrder(), nextTaskOrder);
24+
} else return calculateNewProcessorOrder(prevTask.getProcessorOrder(), nextTaskOrder);
2725
}
2826

2927
public long calculateNewProcessorOrder(Long prevTaskOrder, Long nextTaskOrder) {

0 commit comments

Comments
 (0)