如何在不同的时间按不同的参数对列表进行排序

run*_*ros 94 java sorting

我有一个以Person多个属性命名的类,例如:

public class Person {
    private int id;
    private String name, address;
    // Many more properties.
}
Run Code Online (Sandbox Code Playgroud)

很多Person对象存储在一个ArrayList<Person>.我想通过多个排序参数对此列表进行排序,并且不时有所不同.例如,我可能有一次想要按name升序然后address降序排序,而另一次只能通过id降序排序.

而且我不想创建自己的排序方法(即,我想使用Collections.sort(personList, someComparator).实现这一目标的最优雅的解决方案是什么?

Yis*_*hai 193

我认为你的枚举方法基本上是合理的,但是switch语句确实需要一种更面向对象的方法.考虑:

enum PersonComparator implements Comparator<Person> {
    ID_SORT {
        public int compare(Person o1, Person o2) {
            return Integer.valueOf(o1.getId()).compareTo(o2.getId());
        }},
    NAME_SORT {
        public int compare(Person o1, Person o2) {
            return o1.getFullName().compareTo(o2.getFullName());
        }};

    public static Comparator<Person> decending(final Comparator<Person> other) {
        return new Comparator<Person>() {
            public int compare(Person o1, Person o2) {
                return -1 * other.compare(o1, o2);
            }
        };
    }

    public static Comparator<Person> getComparator(final PersonComparator... multipleOptions) {
        return new Comparator<Person>() {
            public int compare(Person o1, Person o2) {
                for (PersonComparator option : multipleOptions) {
                    int result = option.compare(o1, o2);
                    if (result != 0) {
                        return result;
                    }
                }
                return 0;
            }
        };
    }
}
Run Code Online (Sandbox Code Playgroud)

用法示例(使用静态导入).

public static void main(String[] args) {
    List<Person> list = null;
    Collections.sort(list, decending(getComparator(NAME_SORT, ID_SORT)));
}
Run Code Online (Sandbox Code Playgroud)

  • +1智能使用枚举.我喜欢你用枚举的优雅组合,"降序"和"复合".我想缺少空值处理,但很容易添加"降序"相同的方式. (12认同)
  • 请注意,从Java 8开始,您可以使用`comparator.reversed()`进行降序,并且可以使用`comparator1.thenComparing(comparator2)`来链接比较器. (5认同)

Tad*_*pec 26

你可以为你想要排序的每个属性创建比较器,然后尝试"比较器链接":-)像这样:

public class ChainedComparator<T> implements Comparator<T> {
    private List<Comparator<T>> simpleComparators; 
    public ChainedComparator(Comparator<T>... simpleComparators) {
        this.simpleComparators = Arrays.asList(simpleComparators);
    }
    public int compare(T o1, T o2) {
        for (Comparator<T> comparator : simpleComparators) {
            int result = comparator.compare(o1, o2);
            if (result != 0) {
                return result;
            }
        }
        return 0;
    }
}
Run Code Online (Sandbox Code Playgroud)


run*_*ros 16

一种方法是创建一个Comparator将要排序的属性列表作为参数,如此示例所示.

public class Person {
    private int id;
    private String name, address;

    public static Comparator<Person> getComparator(SortParameter... sortParameters) {
        return new PersonComparator(sortParameters);
    }

    public enum SortParameter {
        ID_ASCENDING, ID_DESCENDING, NAME_ASCENDING,
        NAME_DESCENDING, ADDRESS_ASCENDING, ADDRESS_DESCENDING
    }

    private static class PersonComparator implements Comparator<Person> {
        private SortParameter[] parameters;

        private PersonComparator(SortParameter[] parameters) {
            this.parameters = parameters;
        }

        public int compare(Person o1, Person o2) {
            int comparison;
            for (SortParameter parameter : parameters) {
                switch (parameter) {
                    case ID_ASCENDING:
                        comparison = o1.id - o2.id;
                        if (comparison != 0) return comparison;
                        break;
                    case ID_DESCENDING:
                        comparison = o2.id - o1.id;
                        if (comparison != 0) return comparison;
                        break;
                    case NAME_ASCENDING:
                        comparison = o1.name.compareTo(o2.name);
                        if (comparison != 0) return comparison;
                        break;
                    case NAME_DESCENDING:
                        comparison = o2.name.compareTo(o1.name);
                        if (comparison != 0) return comparison;
                        break;
                    case ADDRESS_ASCENDING:
                        comparison = o1.address.compareTo(o2.address);
                        if (comparison != 0) return comparison;
                        break;
                    case ADDRESS_DESCENDING:
                        comparison = o2.address.compareTo(o1.address);
                        if (comparison != 0) return comparison;
                        break;
                }
            }
            return 0;
        }
    }
}
Run Code Online (Sandbox Code Playgroud)

然后它可以在代码中使用,例如:

cp = Person.getComparator(Person.SortParameter.ADDRESS_ASCENDING,
                          Person.SortParameter.NAME_DESCENDING);
Collections.sort(personList, cp);
Run Code Online (Sandbox Code Playgroud)

  • @Pascal,我不同意,FAQ特别鼓励回答你自己的问题. (4认同)
  • 我自己回答,因为这是一个可能的解决方案.我确信有更好的解决方案,因此问题. (3认同)

Tom*_*ine 8

一种方法是撰写Comparators.这可能是一个库方法(我确定它存在于某处).

public static <T> Comparator<T> compose(
    final Comparator<? super T> primary,
    final Comparator<? super T> secondary
) {
    return new Comparator<T>() {
        public int compare(T a, T b) {
            int result = primary.compare(a, b);
            return result==0 ? secondary.compare(a, b) : result;
        }
        [...]
    };
}
Run Code Online (Sandbox Code Playgroud)

使用:

Collections.sort(people, compose(nameComparator, addressComparator));
Run Code Online (Sandbox Code Playgroud)

或者,请注意这Collections.sort是一种稳定的排序.如果性能不是绝对至关重要,则排序为主要之前的次要顺序.

Collections.sort(people, addressComparator);
Collections.sort(people, nameComparator);
Run Code Online (Sandbox Code Playgroud)