Skip to content

Improve type safety of CollectionUtils.toTreeSet #16306

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
skt-shinyruo wants to merge 1 commit into
base: 3.3
Choose a base branch
from
+46 −1
Open

Improve type safety of CollectionUtils.toTreeSet #16306

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
11 changes: 10 additions & 1 deletion dubbo-common/src/main/java/org/apache/dubbo/common/utils/CollectionUtils.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -419,7 +419,7 @@ public static <T> T first(List<T> values) {
return values.get(0);
}

public static <T> Set<T> toTreeSet(Set<T> set) {
public static <T extends Comparable<? super T>> Set<T> toTreeSet(Set<T> set) {
if (isEmpty(set)) {
return set;
}
Expand All @@ -429,6 +429,15 @@ public static <T> Set<T> toTreeSet(Set<T> set) {
return set;
}

public static <T> Set<T> toTreeSet(Set<T> set, Comparator<? super T> comparator) {
if (set == null) {
Copy link
Copy Markdown
Member

@RainYuY RainYuY Jun 3, 2026

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Why did it become null instead of checking for empty?

return set;
}
Set<T> treeSet = new TreeSet<>(comparator);
treeSet.addAll(set);
return treeSet;
}

public static <T> Set<T> newHashSet(int expectedSize) {
return new HashSet<>(capacity(expectedSize));
}
Expand Down
36 changes: 36 additions & 0 deletions dubbo-common/src/test/java/org/apache/dubbo/common/utils/CollectionUtilsTest.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -21,12 +21,14 @@
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedHashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.TreeSet;

import org.junit.jupiter.api.Assertions;
import org.junit.jupiter.api.Test;
Expand Down Expand Up @@ -255,6 +257,27 @@ void sortShouldSupportComparableSuperType() {
assertEquals("b", sorted.get(1).getName());
}

@Test
void toTreeSetShouldSupportExplicitComparator() {
Set<PriorityItem> items = new LinkedHashSet<>(Arrays.asList(new PriorityItem(3), new PriorityItem(1)));

Set<PriorityItem> sorted = CollectionUtils.toTreeSet(items, Comparator.comparingInt(PriorityItem::getPriority));

List<PriorityItem> sortedList = new ArrayList<>(sorted);
assertEquals(1, sortedList.get(0).getPriority());
assertEquals(3, sortedList.get(1).getPriority());
}

@Test
void toTreeSetShouldPreserveComparatorForEmptyInput() {
Comparator<PriorityItem> comparator = Comparator.comparingInt(PriorityItem::getPriority);

Set<PriorityItem> sorted = CollectionUtils.toTreeSet(new LinkedHashSet<>(), comparator);

assertTrue(sorted instanceof TreeSet);
Assertions.assertSame(comparator, ((TreeSet<PriorityItem>) sorted).comparator());
}

private static class Person implements Comparable<Person> {

private final String name;
Expand All @@ -279,4 +302,17 @@ private Student(String name) {
super(name);
}
}

private static class PriorityItem {

private final int priority;

private PriorityItem(int priority) {
this.priority = priority;
}

private int getPriority() {
return priority;
}
}
}
Loading