opendev/gerrit
Code Issues Proposed changes

Merge branch 'stable'

Browse Source 
* stable:
  Fix Levenshtein distance when sorting ref regexes
This commit is contained in:
Shawn O. Pearce 2010-08-04 15:59:21 -07:00
commit 91c1532130
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
gerrit-server/src/main/java/com/google/gerrit/server/project/RefControl.java
View File

@ -362,7 +362,7 @@ public class RefControl {
private final Comparator<String> BY_MOST_SPECIFIC_SORT =
new Comparator<String>() {
public int compare(final String pattern1, final String pattern2) {
int cmp = distance(pattern2) - distance(pattern1);
int cmp = distance(pattern1) - distance(pattern2);
if (cmp == 0) {
boolean p1_finite = finite(pattern1);
boolean p2_finite = finite(pattern2);