zhengchenyu commented on PR #5975:
URL: https://github.com/apache/hadoop/pull/5975#issuecomment-1692675962
> ```
> List<Container> transferredContainers =
getScheduler().getTransferredContainers(applicationAttemptId);
> if (!transferredContainers.isEmpty()) {
> response.setContainersFromPreviousAttempts(transferredContainers);
>
rmContext.getNMTokenSecretManager().clearNodeSetForAttempt(applicationAttemptId);
> }
> ```
>
> **In this code, the main operations are retrieving transferred containers,
updating the response, and clearing the node set. All of these operations are
O(1), and they are not nested or iterated over a collection. Therefore, the
overall time complexity of this code is O(1).**
@whoami-anoint
Do you mean the complexity of this code is not O(1) after this PR?
I think the complexity of this code still is O(1) after this PR.
--
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.
To unsubscribe, e-mail: [email protected]
For queries about this service, please contact Infrastructure at:
[email protected]
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
