我在考虑用更现代的东西替换一些旧的比较器代码。通过函数列表构建链式比较器
public int compare(String o1, String o2) {
if (null == o1 && null == o2)
return 0;
if (null == o1)
return -1;
if (null == o2)
return 1;
if (0 == o1.length() && 0 == o2.length())
return 0;
if (0 == o1.length())
return -1;
if (0 == o2.length())
return 1;
int result = Integer.compare(o1.length(), o2.length());
if (0 != result)
return result;
result = Character.compare(o1.charAt(0), o2.charAt(0));
if (0 != result)
return result;
return o1.compareTo(o2);
}
我知道关于Java 8的比较方法,因此,上述能够成为:
Comparator<String> chained = Comparator.nullsFirst(
Comparator.comparingInt(String::length)).thenComparing(
s -> s.length() == 0 ? -1 : s.charAt(0)).thenComparing(
Function.identity());
但是,这是一个有点讨厌,我需要写出来comparing
和thenComparing
每次比较。理想情况下,我只需传入一个List或多个lambda表达式。
喜欢的东西:
Comparator.comparing(
String::length,
s -> s.length() == 0 ? 0 : s.charAt(0),
Function.identity());
以下是我已经得到了最近,一些评论部分,指明哪些是无效的,由于泛型不匹配。困难点似乎是我想通过多个Function<T, ?>
通配符不被固定为一次捕获。我猜这是不可能的。
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
import java.util.function.Function;
public class MultiComparator<T> implements Comparator<T> {
private Comparator<T> comparator;
public MultiComparator() {
this.comparator = Comparator.nullsFirst(Comparator.comparing(o -> 0));
}
/*
public MultiComparator(List<Function<T, ? extends Comparable<?>>> extractors) {
this();
extractors.stream().forEach(this::add);
}
public MultiComparator(Function<T, ? extends Comparable<?>>... extractors) {
this(Arrays.asList(extractors));
}
*/
public static void main(String[] args) {
List<String> strings = Arrays.asList("1", "11", "111", "2", "22", "222", "3", "123", "432", "aaa", "1234",
"", "", null, null, null);
MultiComparator<String> multi = new MultiComparator<>();
multi.add(String::length);
multi.add(s -> s.length() == 0 ? 0 : s.charAt(0));
multi.add(Function.identity());
Collections.shuffle(strings);
Collections.sort(strings, multi);
System.err.println(strings);
/*
multi = new MultiComparator<>(String::length, s -> s.length() == 0 ? -1 : s.charAt(0));
Collections.shuffle(strings);
Collections.sort(strings, multi);
System.err.println(strings);
*/
Comparator<String> chained = Comparator.nullsFirst(Comparator.comparingInt(String::length)).thenComparing(s
-> s.length() == 0 ? -1 : s.charAt(0)).thenComparing(Function.identity());
Collections.shuffle(strings);
Collections.sort(strings, chained);
System.err.println(strings);
Collections.shuffle(strings);
Collections.sort(strings, (o1, o2) -> {
if (null == o1 && null == o2) return 0;
if (null == o1) return -1;
if (null == o2) return 1;
if (0 == o1.length() && 0 == o2.length()) return 0;
if (0 == o1.length()) return -1;
if (0 == o2.length()) return 1;
int result = Integer.compare(o1.length(), o2.length());
if (0 != result) return result;
result = Character.compare(o1.charAt(0), o2.charAt(0));
if (0 != result) return result;
return o1.compareTo(o2);
});
System.err.println(strings);
}
public <U extends Comparable<U>> void add(Function<T, U> fieldExtractor) {
this.comparator = this.comparator.thenComparing(Comparator.nullsFirst(Comparator.comparing(fieldExtractor)));
}
@Override
public int compare(T o1, T o2) {
return this.comparator.compare(o1, o2);
}
}
积极的一面,我可以只使用thenComparing,而无需编写自己的实用工具类。
多亏了Tagir Valeev的解决方案,最终我放弃了自定义的比较级,只是有两个方法返回一个新的比较。
@SuppressWarnings("unchecked")
public static <T> Comparator<T> create(List<Function<T, ? extends Comparable<?>>> extractors) {
return extractors.stream().map(e -> Comparator.comparing((Function<T, Comparable<Object>>) e)).reduce
(Comparator::thenComparing).orElse(Comparator.comparing(o -> 0));
}
@SafeVarargs
public static <T> Comparator<T> create(Function<T, ? extends Comparable<?>>... extractors) {
return create(Arrays.asList(extractors));
}
当然!不知道为什么我没有想到铸造。非常感谢。 – fracai