blob: 4b5274c31012545cae752e8c35ce51042cd85225 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
|
package org.junit.runner.manipulation;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
import org.junit.runner.Description;
/**
* A <code>Sorter</code> orders tests. In general you will not need
* to use a <code>Sorter</code> directly. Instead, use
* {@link org.junit.runner.Request#sortWith(Comparator)}.
*
* @since 4.0
*/
public class Sorter extends Ordering implements Comparator<Description> {
/**
* NULL is a <code>Sorter</code> that leaves elements in an undefined order
*/
public static final Sorter NULL = new Sorter(new Comparator<Description>() {
public int compare(Description o1, Description o2) {
return 0;
}
});
private final Comparator<Description> comparator;
/**
* Creates a <code>Sorter</code> that uses <code>comparator</code>
* to sort tests
*
* @param comparator the {@link Comparator} to use when sorting tests
* @since 4.0
*/
public Sorter(Comparator<Description> comparator) {
this.comparator = comparator;
}
/**
* Sorts the tests in <code>target</code> using <code>comparator</code>.
*
* @since 4.0
*/
@Override
public void apply(Object target) {
/*
* Note that all runners that are Orderable are also Sortable (because
* Orderable extends Sortable). Sorting is more efficient than ordering,
* so we override the parent behavior so we sort instead.
*/
if (target instanceof Sortable) {
Sortable sortable = (Sortable) target;
sortable.sort(this);
}
}
public int compare(Description o1, Description o2) {
return comparator.compare(o1, o2);
}
/**
* {@inheritDoc}
*
* @since 4.13
*/
@Override
protected final List<Description> orderItems(Collection<Description> descriptions) {
/*
* In practice, we will never get here--Sorters do their work in the
* compare() method--but the Liskov substitution principle demands that
* we obey the general contract of Orderable. Luckily, it's trivial to
* implement.
*/
List<Description> sorted = new ArrayList<Description>(descriptions);
Collections.sort(sorted, this); // Note: it would be incorrect to pass in "comparator"
return sorted;
}
/**
* {@inheritDoc}
*
* @since 4.13
*/
@Override
boolean validateOrderingIsCorrect() {
return false;
}
}
|
