平常搬砖时,常常有这种状况,根据不一样策略对返回前端的列表元素进行各类重排序,因而有了这篇文章,学会使用Guava Orderiing。html
依然,引用下官方定义:前端
排序器(Ordering)是Guava流畅风格比较器[Comparator]的实现,它能够用来为构建复杂的比较器,以完成集合排序的功能。java
在使用方面,Ordering
提供了链式调用的支持,使得代码变得清晰简洁。算法
Ordering
的运行,以由Entity
对象组成的列表进行不一样排序(笔者偷懒没有使用Getter
和Setter
,直接public
声明了成员变量。)。public class Entity {
public int status;
public String name;
public Entity(int status, String name) {
this.status = status;
this.name = name;
}
public Entity(int status) {
this.status = status;
}
@Override
public String toString() {
return "Entity{" +
"status=" + status +
", name='" + name + '\'' +
'}';
}
}
复制代码
List<Entity> list = new ArrayList<Entity>() {{
add(new Entity(1, "h"));
add(new Entity(2, "f"));
add(new Entity(3, "a"));
add(new Entity(0, "d"));
add(new Entity(2, "b"));
}};
复制代码
Ordering的初始化方法主要有三种,分别用于不一样的场景。设计模式
// 整型按照大小排序
Ordering<Integer> integerOrdering = Ordering.natural();
// 日期前后排序
Ordering<Date> dateOrdering = Ordering.natural();
复制代码
// 排序结果:[Entity{status=0, name='d'}, Entity{status=1, name='h'}, Entity{status=2, name='b'}, Entity{status=2, name='f'}, Entity{status=3, name='a'}]
Ordering<Object> ordering3 = Ordering.usingToString();
复制代码
Comparator
初始化// 排序结果:[Entity{status=0, name='d'}, Entity{status=1, name='h'}, Entity{status=2, name='f'}, Entity{status=2, name='b'}, Entity{status=3, name='a'}]
// 按照status字段升序排序
Ordering<Entity> ordering1 = Ordering.from(Comparator.comparingInt(o -> o.status));
复制代码
// 倒序排序
// 排序结果:[Entity{status=3, name='a'}, Entity{status=2, name='f'}, Entity{status=2, name='b'}, Entity{status=1, name='h'}, Entity{status=0, name='d'}]
Ordering<Object> ordering3 = Ordering.usingToString().reverse();
复制代码
nullsFirst() 、nullsLast():将null值排到最前面/最后面位置。数组
compound(Comparator<? super U> secondaryComparator):合成另外一个比较器,以处理当前排序器中的相等状况。bash
// status升序排序
Ordering<Entity> ordering1 = Ordering.from(Comparator.comparingInt(o -> o.status));
// status相等,按照name升序排序
// 排序结果:[Entity{status=0, name='d'}, Entity{status=1, name='h'}, Entity{status=2, name='b'}, Entity{status=2, name='f'}, Entity{status=3, name='a'}]
Ordering<Entity> ordering4 = ordering1.compound((o1, o2) -> StringUtils.compare(o1.name, o2.name));
复制代码
// status升序 null的对象放在最后面
// 排序结果:[Entity{status=0, name='d'}, Entity{status=1, name='h'}, Entity{status=2, name='f'}, Entity{status=2, name='b'}, Entity{status=3, name='a'}, null]
Ordering<Entity> ordering = Ordering.natural().onResultOf(new Function<Entity, Comparable>() {
@Override
public Comparable apply(Entity entity) {
if (entity != null) {
return entity.status;
}
return -1;
}
}).nullsLast();
复制代码
// 排序结果:[null, Entity{status=3, name='a'}, Entity{status=2, name='f'}, Entity{status=2, name='b'}]
// nullLast()致使null最大,最大的四个元素
ordering.greatestOf(list, 4)
// 排序结果:[Entity{status=0, name='d'}, Entity{status=1, name='h'}, Entity{status=2, name='f'}, Entity{status=2, name='b'}]
// 最小的四个元素
ordering.leastOf(list, 4)
复制代码
// 结果:Entity{status=0, name='d'}
ordering.min(list)
// 还支持N个对象的比较
// 结果:Entity{status=1, name='y'}
ordering.min(new Entity(1, "y"), new Entity(2, "x"))
复制代码
public <E extends T> List<E> sortedCopy(Iterable<E> iterable) {
// 转换成了对象数组
E[] array = (Object[])Iterables.toArray(iterable);
// Ordering继承Comparator,使用Ordering排序
Arrays.sort(array, this);
// 最后复制到新建列表中
return Lists.newArrayList(Arrays.asList(array));
}
复制代码
Ordering
将排序结果做为新的列表对象,原有列表没有改动。// 数据:
List<Entity> list = new ArrayList<Entity>() {{
add(new Entity(1, "h"));
add(new Entity(2, "f"));
add(new Entity(3, "a"));
add(new Entity(0, "d"));
add(new Entity(2, "b"));
add(null);
}};
// 结果:[Entity{status=0, name='d'}, Entity{status=1, name='h'}, Entity{status=2, name='f'}, Entity{status=2, name='b'}, Entity{status=3, name='a'}, null]
[Entity{status=1, name='h'}, Entity{status=2, name='f'}, Entity{status=3, name='a'}, Entity{status=0, name='d'}, Entity{status=2, name='b'}, null]
System.out.println(ordering.sortedCopy(list));
System.out.println(list);
复制代码
public interface IEntityStrategy {
List<Entity> sort(List<Entity> list);
}
复制代码
public class StatusDESCStrategy implements IEntityStrategy {
private static Ordering<Entity> ordering = Ordering.natural().onResultOf(new Function<Entity, Comparable>() {
@Override
public Comparable apply(Entity entity) {
if (entity != null) {
return entity.status;
}
return -1;
}
}).nullsLast();
@Override
public List<Entity> sort(List<Entity> list) {
return ordering.sortedCopy(list);
}
}
复制代码
public class NameASCStrategy implements IEntityStrategy {
private static Ordering<Entity> ordering = Ordering.from((o1, o2) -> StringUtils.compare(o1.name, o2.name));
@Override
public List<Entity> sort(List<Entity> list) {
return ordering.sortedCopy(list);
}
}
复制代码
public class Test {
public static void main(String[] args) {
List<Entity> list = new ArrayList<Entity>() {{
add(new Entity(1, "h"));
add(new Entity(2, "f"));
add(new Entity(3, "a"));
add(new Entity(0, "d"));
add(new Entity(2, "b"));
add(null);
}};
Context context = new Context(new StatusDESCStrategy());
System.out.println("status字段降序排序");
// 结果:[Entity{status=3, name='a'}, Entity{status=2, name='f'}, Entity{status=2, name='b'}, Entity{status=1, name='h'}, Entity{status=0, name='d'}, null]
System.out.println(context.sortByStrategy(list));
// 结果:[Entity{status=3, name='a'}, Entity{status=2, name='b'}, Entity{status=0, name='d'}, Entity{status=2, name='f'}, Entity{status=1, name='h'}, null]
Context context1 = new Context(new NameASCStrategy());
System.out.println("name字段升序排序");
System.out.println(context1.sortByStrategy(list));
}
}
复制代码
Context
,直接上策略类处理。ifeve.com/google-guav… 设计模式.pdf www.runoob.com/design-patt…app