1 |
|
|
2 |
|
|
3 |
|
|
4 |
|
|
5 |
|
|
6 |
|
|
7 |
|
|
8 |
|
|
9 |
|
|
10 |
|
|
11 |
|
|
12 |
|
|
13 |
|
|
14 |
|
|
15 |
|
|
16 |
|
package org.qedeq.base.utility; |
17 |
|
|
18 |
|
import org.qedeq.base.test.QedeqTestCase; |
19 |
|
|
20 |
|
|
21 |
|
@link |
22 |
|
|
23 |
|
@author |
24 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (64) |
Complexity: 10 |
Complexity Density: 0.19 |
|
25 |
|
public class EnumeratorTest extends QedeqTestCase { |
26 |
|
|
27 |
|
|
28 |
|
@see |
29 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
30 |
6
|
protected void setUp() throws Exception {... |
31 |
6
|
super.setUp(); |
32 |
|
} |
33 |
|
|
34 |
|
|
35 |
|
@see |
36 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
37 |
6
|
protected void tearDown() throws Exception {... |
38 |
6
|
super.tearDown(); |
39 |
|
} |
40 |
|
|
41 |
|
|
42 |
|
|
43 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (6) |
Complexity: 1 |
Complexity Density: 0.17 |
1
PASS
|
|
44 |
1
|
public void testConstructors() {... |
45 |
1
|
Enumerator e1 = new Enumerator(); |
46 |
1
|
assertEquals(0, e1.getNumber()); |
47 |
1
|
Enumerator e2 = new Enumerator(0); |
48 |
1
|
assertEquals(0, e2.getNumber()); |
49 |
1
|
Enumerator e3 = new Enumerator(-1); |
50 |
1
|
assertEquals(-1, e3.getNumber()); |
51 |
|
} |
52 |
|
|
53 |
|
|
54 |
|
@link |
55 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (20) |
Complexity: 2 |
Complexity Density: 0.11 |
1
PASS
|
|
56 |
1
|
public void testIncrease() {... |
57 |
1
|
Enumerator e1 = new Enumerator(); |
58 |
1
|
e1.increaseNumber(); |
59 |
1
|
assertEquals(1, e1.getNumber()); |
60 |
1
|
Enumerator e2 = new Enumerator(0); |
61 |
1
|
e2.increaseNumber(); |
62 |
1
|
assertEquals(1, e2.getNumber()); |
63 |
1
|
assertEquals(e1, e2); |
64 |
1
|
assertNotSame(e1, e2); |
65 |
1
|
Enumerator e3 = new Enumerator(-1); |
66 |
1
|
e3.increaseNumber(); |
67 |
1
|
e3.increaseNumber(); |
68 |
1
|
assertEquals(e1, e3); |
69 |
1
|
assertEquals(e2, e3); |
70 |
1
|
assertEquals(1, e3.getNumber()); |
71 |
1
|
Enumerator e4 = new Enumerator(100); |
72 |
1001
|
for (int i = 0; i < 1000; i++) { |
73 |
1000
|
e4.increaseNumber(); |
74 |
|
} |
75 |
1
|
assertEquals(1100, e4.getNumber()); |
76 |
|
} |
77 |
|
|
78 |
|
|
79 |
|
@link |
80 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (4) |
Complexity: 1 |
Complexity Density: 0.25 |
1
PASS
|
|
81 |
1
|
public void testToString() {... |
82 |
1
|
Enumerator e1 = new Enumerator(); |
83 |
1
|
assertEquals("0", e1.toString()); |
84 |
1
|
Enumerator e2 = new Enumerator(1234); |
85 |
1
|
assertEquals("1234", e2.toString()); |
86 |
|
} |
87 |
|
|
88 |
|
|
89 |
|
@link |
90 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (14) |
Complexity: 1 |
Complexity Density: 0.07 |
1
PASS
|
|
91 |
1
|
public void testEquals() {... |
92 |
1
|
Enumerator e1 = new Enumerator(); |
93 |
1
|
assertEquals(0, e1.getNumber()); |
94 |
1
|
Enumerator e2 = new Enumerator(0); |
95 |
1
|
assertEquals(0, e2.getNumber()); |
96 |
1
|
assertEquals(e1, e2); |
97 |
1
|
assertNotSame(e1, e2); |
98 |
1
|
Enumerator e3 = new Enumerator(-1); |
99 |
1
|
assertEquals(-1, e3.getNumber()); |
100 |
1
|
assertFalse(e1.equals(e3)); |
101 |
1
|
assertFalse(e3.equals(e1)); |
102 |
1
|
assertFalse(e2.equals(e3)); |
103 |
1
|
assertFalse(e3.equals(e2)); |
104 |
1
|
assertFalse(e3.equals(null)); |
105 |
1
|
assertFalse(e1.equals(new Integer(0))); |
106 |
|
} |
107 |
|
|
108 |
|
|
109 |
|
@link |
110 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (5) |
Complexity: 2 |
Complexity Density: 0.67 |
1
PASS
|
|
111 |
1
|
public void testHashcode() {... |
112 |
111
|
for (int i = -10; i < 100; i++) { |
113 |
|
|
114 |
110
|
Enumerator e = new Enumerator(i); |
115 |
110
|
assertEquals(i, e.hashCode()); |
116 |
|
} |
117 |
|
} |
118 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (5) |
Complexity: 1 |
Complexity Density: 0.2 |
1
PASS
|
|
119 |
1
|
public void testReset() {... |
120 |
1
|
Enumerator e1 = new Enumerator(); |
121 |
1
|
e1.increaseNumber(); |
122 |
1
|
assertEquals(1, e1.getNumber()); |
123 |
1
|
e1.reset(); |
124 |
1
|
assertEquals(0, e1.getNumber()); |
125 |
|
} |
126 |
|
} |