如何使用Comparator定义自定义排序顺序?

akh*_*tar 82 java sorting enums

我想为汽车列表开发一个排序演示.我正在使用数据表来显示汽车清单.实际上我想按汽车颜色对列表进行排序.这里不按字母顺序排序.我想使用我的自定义排序顺序,如Red car先行,然后是Blue等.

为此,我尝试使用Java Comparator,Comparable但它允许仅按字母顺序排序.

因此,任何人都可以指导我实现使用该技术的方式,以便排序变得更快.

class Car implements Comparable<Car>
{
    private String name;
    private String color;

    public Car(String name, String color){
        this.name = name;
        this.color = color;
    }

    //Implement the natural order for this class
    public int compareTo(Car c) {
        return name.compareTo(c.name);
    }

    static class ColorComparator implements Comparator<Car> {
        public int compare(Car c1, Car c2) {
            String a1 = c1.color;
            String a2 = c2.color;
            return a1.compareTo(a2);
        }
    }

    public static void main(String[] args) {
        List<Car> carList = new ArrayList<>();
        List<String> sortOrder = new ArrayList<>();

        carList.add(new Car("Ford","Silver"));
        carList.add(new Car("Tes","Blue"));
        carList.add(new Car("Honda","Magenta"));

        sortOrder.add("Silver");
        sortOrder.add("Magenta");
        sortOrder.add("Blue");

        // Now here I am confuse how to implement my custom sort             
    }
}
Run Code Online (Sandbox Code Playgroud)

z7s*_*g Ѫ 98

我建议您为汽车颜色创建一个枚举,而不是使用字符串,枚举的自然顺序将是您声明常量的顺序.

public enum PaintColors {
    SILVER, BLUE, MAGENTA, RED
}
Run Code Online (Sandbox Code Playgroud)

 static class ColorComparator implements Comparator<CarSort>
 {
     public int compare(CarSort c1, CarSort c2)
     {
         return c1.getColor().compareTo(c2.getColor());
     }
 }
Run Code Online (Sandbox Code Playgroud)

您将String更改为PaintColor,然后在main中您的汽车列表变为:

carList.add(new CarSort("Ford Figo",PaintColor.SILVER));

...

Collections.sort(carList, new ColorComparator());
Run Code Online (Sandbox Code Playgroud)


Sea*_*oyd 51

这个怎么样:

List<String> definedOrder = // define your custom order
    Arrays.asList("Red", "Green", "Magenta", "Silver");

Comparator<Car> comparator = new Comparator<Car>(){

    @Override
    public int compare(final Car o1, final Car o2){
        // let your comparator look up your car's color in the custom order
        return Integer.valueOf(
            definedOrder.indexOf(o1.getColor()))
            .compareTo(
                Integer.valueOf(
                    definedOrder.indexOf(o2.getColor())));
    }
};
Run Code Online (Sandbox Code Playgroud)

原则上,我同意使用a enum是一种更好的方法,但是这个版本更灵活,因为它允许您定义不同的排序顺序.

更新

Guava将此功能融入其中Ordering:

List<String> colorOrder = ImmutableList.of("red","green","blue","yellow");
final Ordering<String> colorOrdering = Ordering.explicit(colorOrder);
Comparator<Car> comp = new Comparator<Car>() {
    @Override
    public int compare(Car o1, Car o2) {
        return colorOrdering.compare(o1.getColor(),o2.getColor());
    }
}; 
Run Code Online (Sandbox Code Playgroud)

这个版本稍微冗长一点.


再次更新

Java 8使Comparator更加冗长:

Comparator<Car> carComparator = Comparator.comparing(
        c -> definedOrder.indexOf(c.getColor()));
Run Code Online (Sandbox Code Playgroud)

  • Java 8是一个智能解决方案。工作正常 (2认同)

Sil*_*oia 23

比较器在线......

List<Object> objList = findObj(name);
Collections.sort(objList, new Comparator<Object>() {
    @Override
    public int compare(Object a1, Object a2) {
        return a1.getType().compareToIgnoreCase(a2.getType());
    }
});
Run Code Online (Sandbox Code Playgroud)


ila*_*lex 9

我认为这可以做到如下:

class ColorComparator implements Comparator<CarSort>
{
    private List<String> sortOrder;
    public ColorComparator (List<String> sortOrder){
        this.sortOrder = sortOrder;
    }

    public int compare(CarSort c1, CarSort c2)
    {
        String a1 = c1.getColor();
        String a2 = c2.getColor();
        return sortOrder.indexOf(a1) - sortOrder.indexOf(a2);
     }
 }
Run Code Online (Sandbox Code Playgroud)

对于排序使用此:

Collections.sort(carList, new ColorComparator(sortOrder));
Run Code Online (Sandbox Code Playgroud)


mat*_*616 7

我不得不做类似Sean和ilalex的回答.
但是我有太多的选项来明确定义排序顺序,并且只需要将某些条目浮动到列表的前面...以指定的(非自然的)顺序.
希望这对其他人有帮助.

public class CarComparator implements Comparator<Car> {

    //sort these items in this order to the front of the list 
    private static List<String> ORDER = Arrays.asList("dd", "aa", "cc", "bb");

    public int compare(final Car o1, final Car o2) {
        int result = 0;
        int o1Index = ORDER.indexOf(o1.getName());
        int o2Index = ORDER.indexOf(o2.getName());
        //if neither are found in the order list, then do natural sort
        //if only one is found in the order list, float it above the other
        //if both are found in the order list, then do the index compare
        if (o1Index < 0 && o2Index < 0) result = o1.getName().compareTo(o2.getName());
        else if (o1Index < 0) result = 1;
        else if (o2Index < 0) result = -1;
        else result = o1Index - o2Index;
        return result;
    }

//Testing output: dd,aa,aa,cc,bb,bb,bb,a,aaa,ac,ac,ba,bd,ca,cb,cb,cd,da,db,dc,zz
}
Run Code Online (Sandbox Code Playgroud)


Mar*_*szS 7

我会做这样的事情:

List<String> order = List.of("Red", "Green", "Magenta", "Silver");

Comparator.comparing(Car::getColor(), Comparator.comparingInt(c -> order.indexOf(c)))
Run Code Online (Sandbox Code Playgroud)

所有学分均归@Sean Patrick Floyd :)