MDS/openide
1
0
Fork 0
mirror of https://gitflic.ru/project/openide/openide.git synced 2026-09-27 10:03:11 +07:00
Code Issues Packages Projects Releases Wiki Activity

faster item sorting in goto popups

Browse Source
This commit is contained in:
peter
2013-06-27 18:38:26 +02:00
parent 463014e9c6
commit 35db883b8a
1 changed files with 16 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files
platform/lang-impl/src/com/intellij/ide/util/gotoByName/DefaultChooseByNameItemProvider.java
+16 -6
View File
@@ -33,6 +33,7 @@ import com.intellij.util.SmartList;
import com.intellij.util.containers.ContainerUtil;
import com.intellij.util.text.Matcher;
import gnu.trove.THashSet;
import gnu.trove.TObjectIntHashMap;
import org.jetbrains.annotations.NotNull;
import org.jetbrains.annotations.Nullable;
@@ -125,18 +126,27 @@ public class DefaultChooseByNameItemProvider implements ChooseByNameItemProvider
protected void sortNamesList(@NotNull String namePattern, @NotNull List<String> namesList) {
final MinusculeMatcher matcher = buildPatternMatcher(namePattern, NameUtil.MatchingCaseSensitivity.NONE);
final Set<String> startMatches = ContainerUtil.newHashSet();
final TObjectIntHashMap<String> matchingDegrees = new TObjectIntHashMap<String>();
for (String name : namesList) {
if (matcher.isStartMatch(name)) {
startMatches.add(name);
}
matchingDegrees.put(name, matcher.matchingDegree(name));
}
// Here we sort using namePattern to have similar logic with empty qualified patten case
Collections.sort(namesList, new Comparator<String>() {
@Override
public int compare(String o1, String o2) {
boolean start1 = matcher.isStartMatch(o1);
boolean start2 = matcher.isStartMatch(o2);
boolean start1 = startMatches.contains(o1);
boolean start2 = startMatches.contains(o2);
if (start1 != start2) return start1 ? -1 : 1;
int degree1 = matcher.matchingDegree(o2);
int degree2 = matcher.matchingDegree(o1);
if (degree1 < degree2) return -1;
if (degree1 > degree2) return 1;
int degree1 = matchingDegrees.get(o1);
int degree2 = matchingDegrees.get(o2);
if (degree2 < degree1) return -1;
if (degree2 > degree1) return 1;
return o1.compareToIgnoreCase(o2);
}