1 |
|
|
2 |
|
|
3 |
|
|
4 |
|
|
5 |
|
|
6 |
|
|
7 |
|
|
8 |
|
|
9 |
|
|
10 |
|
|
11 |
|
|
12 |
|
|
13 |
|
|
14 |
|
|
15 |
|
|
16 |
|
|
17 |
|
|
18 |
|
|
19 |
|
|
20 |
|
|
21 |
|
package com.xpn.xwiki.criteria.impl; |
22 |
|
|
23 |
|
import junit.framework.TestCase; |
24 |
|
import com.xpn.xwiki.criteria.impl.Range; |
25 |
|
import com.xpn.xwiki.criteria.impl.RangeFactory; |
26 |
|
|
27 |
|
|
28 |
|
@link |
29 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (32) |
Complexity: 10 |
Complexity Density: 0.45 |
|
30 |
|
public class RangeFactoryTest extends TestCase |
31 |
|
{ |
32 |
|
|
33 |
|
@link |
34 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
1PASS
|
|
35 |
1 |
public void testAll()... |
36 |
|
{ |
37 |
1 |
doRangeTest(RangeFactory.ALL, 0, 0); |
38 |
|
} |
39 |
|
|
40 |
|
|
41 |
|
@link |
42 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
1PASS
|
|
43 |
1 |
public void testFirst()... |
44 |
|
{ |
45 |
1 |
doRangeTest(RangeFactory.FIRST, 0, 1); |
46 |
|
} |
47 |
|
|
48 |
|
|
49 |
|
@link |
50 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
1PASS
|
|
51 |
1 |
public void testLast()... |
52 |
|
{ |
53 |
1 |
doRangeTest(RangeFactory.LAST, 0, -1); |
54 |
|
} |
55 |
|
|
56 |
|
|
57 |
|
@link |
58 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (6) |
Complexity: 1 |
Complexity Density: 0.17 |
1PASS
|
|
59 |
1 |
public void testCreateRange()... |
60 |
|
{ |
61 |
1 |
doCreateRangeTest(0, 0); |
62 |
1 |
doCreateRangeTest(0, 3); |
63 |
1 |
doCreateRangeTest(0, -4); |
64 |
1 |
doCreateRangeTest(-10, 0); |
65 |
1 |
doCreateRangeTest(-10, 5); |
66 |
1 |
doCreateRangeTest(-10, -9); |
67 |
|
} |
68 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
69 |
6 |
private void doCreateRangeTest(int start, int size)... |
70 |
|
{ |
71 |
6 |
doRangeTest(RangeFactory.createRange(start, size), start, size); |
72 |
|
} |
73 |
|
|
74 |
|
|
75 |
|
@link |
76 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (3) |
Complexity: 1 |
Complexity Density: 0.33 |
1PASS
|
|
77 |
1 |
public void testCreateHeadRange()... |
78 |
|
{ |
79 |
1 |
doCreateHeadRangeTest(0); |
80 |
1 |
doCreateHeadRangeTest(3); |
81 |
1 |
doCreateHeadRangeTest(-7); |
82 |
|
} |
83 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
84 |
3 |
private void doCreateHeadRangeTest(int size)... |
85 |
|
{ |
86 |
3 |
doRangeTest(RangeFactory.createHeadRange(size), 0, Math.abs(size)); |
87 |
|
} |
88 |
|
|
89 |
|
|
90 |
|
@link |
91 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (3) |
Complexity: 1 |
Complexity Density: 0.33 |
1PASS
|
|
92 |
1 |
public void testCreateTailRange()... |
93 |
|
{ |
94 |
1 |
doCreateTailRangeTest(0); |
95 |
1 |
doCreateTailRangeTest(3); |
96 |
1 |
doCreateTailRangeTest(-7); |
97 |
|
} |
98 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
99 |
3 |
private void doCreateTailRangeTest(int size)... |
100 |
|
{ |
101 |
3 |
doRangeTest(RangeFactory.createTailRange(size), 0, -Math.abs(size)); |
102 |
|
} |
103 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (4) |
Complexity: 1 |
Complexity Density: 0.25 |
|
104 |
15 |
private void doRangeTest(Range i, int start, int size)... |
105 |
|
{ |
106 |
15 |
assertEquals(i.getStart(), start); |
107 |
15 |
assertEquals(i.getSize(), size); |
108 |
15 |
assertEquals(i.getAbsoluteStart(), Math.abs(start)); |
109 |
15 |
assertEquals(i.getAbsoluteSize(), Math.abs(size)); |
110 |
|
} |
111 |
|
} |