KAFKA-15139:Optimize the performance of Set.removeAll(List) in MirrorCheckpointConnector

[hudeqi]

Motivation

This PR is inspired by #13913 (comment)

This is the hint of removeAll method in Set:
This implementation determines which is the smaller of this set and the specified collection, by invoking the size method on each. If this set has fewer elements, then the implementation iterates over this set, checking each element returned by the iterator in turn to see if it is contained in the specified collection. If it is so contained, it is removed from this set with the iterator's remove method. If the specified collection has fewer elements, then the implementation iterates over the specified collection, removing from this set each element returned by the iterator, using this set's remove method.

That's said, assume that M is the number of elements in the set and N is the number of elements in the List, if the type of the specified collection is List, and M<=N, then the time complexity of removeAll is O(MN) (because the time complexity of searching in List is O(N)), on the contrary, if N<M, it will search in Set, the time complexity is O(N).

In MirrorCheckpointConnector, refreshConsumerGroups method is repeatedly called in a daemon thread. There are two removeAll in this method. From a logical point of view, when this method is called in one round, when the number of groups in the source cluster simply increases or decreases, the two removeAll execution strategies will always hit the O(MN) situation mentioned above.

Solution

Therefore, it is better to change all the variables here to Set type to avoid this "low performance".

This PR has passed the unit test.

[hudeqi]

This PR is inspired by your suggestion, please help to review it when you have time, thank you. @C0urante

[gharris1727]

LGTM

[hudeqi]

and this, thanks. @C0urante

[C0urante]

@hudeqi I think @gharris1727 can merge this now :)

[gharris1727]

Flaky test failures in the Mirror suite appear unrelated, and the tests pass locally. Merging.