[Improvement] refactor getPartitionRange to calculate range directly

[advancedxy]

Code of Conduct

• I agree to follow this project's Code of Conduct

Search before asking

• I have searched in the issues and found no similar issues.

What would you like to be improved?

ShuffleStorageUtils.getPartitionRange is not performant...

It could be calculated directly in O(1).. However current impl is about O(n) where n is the number of partition ranges. when partition range size =1, n is corresponding to partition numbers.

How should we improve?

refactor ShuffleStorageUtils.getPartitionRange to calculate range directly.

Are you willing to submit PR?

• Yes I am willing to submit a PR!

[advancedxy]

Related context: #424 (comment)

I would leave it open until next week, so someone who want to make a contribution, can start with this small improvement.

[a-li]

Hey I’m looking to contribute to Uniffle and would like to try to do this task.

[advancedxy]

@a-li thanks, I’ve assigned it to you