perf(metadata): optimize SortedStreamSetObjectsList using binary search

[ezylopx5]

Closes #3137

Problem

SortedStreamSetObjectsList maintains a sorted list but currently:

• Uses LinkedList, which has O(n) random access
• Uses linear scans for insertion and removal
• Contains explicit TODOs requesting binary search optimization

Solution

• Replace LinkedList with ArrayList for O(1) random access
• Use Collections.binarySearch() to find insertion/removal positions in O(log n)
• Handle duplicate orderId cases correctly
• Add tests covering edge cases

Testing

Added unit tests for:

• Binary search insertion at beginning, middle, end
• Removal from various positions
• Duplicate orderId handling
• Large list correctness (1000 elements)

Committer Checklist (excluded from commit message)

• Verify design and implementation
• Verify test coverage and CI build status
• Verify documentation (including upgrade notes)

[CLAassistant]

All committers have signed the CLA.

[superhx]

Sorry, I missed this PR. It looks like this issue has been fixed by #3215.