1 |
|
package org.sat4j.minisat.core; |
2 |
|
|
3 |
|
import junit.framework.TestCase; |
4 |
|
|
5 |
|
|
6 |
|
|
7 |
|
|
8 |
|
|
9 |
|
|
10 |
|
|
11 |
|
|
12 |
|
|
13 |
|
@author |
14 |
|
|
15 |
|
|
16 |
|
|
17 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (46) |
Complexity: 3 |
Complexity Density: 0,22 |
|
18 |
|
public class QueueTest extends TestCase { |
19 |
|
|
20 |
|
|
21 |
|
|
22 |
|
|
23 |
|
@param |
24 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
25 |
4
|
public QueueTest(String arg0) {... |
26 |
4
|
super(arg0); |
27 |
|
} |
28 |
|
|
29 |
|
|
30 |
|
@see |
31 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
32 |
4
|
@Override... |
33 |
|
protected void setUp() throws Exception { |
34 |
4
|
qu = new IntQueue(); |
35 |
|
} |
36 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (9) |
Complexity: 3 |
Complexity Density: 0,6 |
1
PASS
|
|
37 |
1
|
public void testInsert() {... |
38 |
1
|
qu.ensure(15); |
39 |
16
|
for (int i = 0; i < 15; i++) { |
40 |
15
|
qu.insert(i); |
41 |
|
} |
42 |
16
|
for (int i = 0; i < 15; i++) { |
43 |
15
|
assertEquals(i, qu.dequeue()); |
44 |
|
} |
45 |
|
} |
46 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (11) |
Complexity: 1 |
Complexity Density: 0,09 |
1
PASS
|
|
47 |
1
|
public void testDequeue() {... |
48 |
1
|
qu.insert(1); |
49 |
1
|
qu.insert(2); |
50 |
1
|
assertEquals(2, qu.size()); |
51 |
1
|
int i = qu.dequeue(); |
52 |
1
|
assertEquals(1, i); |
53 |
1
|
qu.insert(3); |
54 |
1
|
assertEquals(2, qu.size()); |
55 |
1
|
i = qu.dequeue(); |
56 |
1
|
assertEquals(2, i); |
57 |
1
|
i = qu.dequeue(); |
58 |
1
|
assertEquals(3, i); |
59 |
|
} |
60 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (9) |
Complexity: 1 |
Complexity Density: 0,11 |
1
PASS
|
|
61 |
1
|
public void testClear() {... |
62 |
1
|
assertEquals(0, qu.size()); |
63 |
1
|
qu.insert(1); |
64 |
1
|
qu.insert(2); |
65 |
1
|
assertEquals(2, qu.size()); |
66 |
1
|
qu.clear(); |
67 |
1
|
assertEquals(0, qu.size()); |
68 |
1
|
qu.insert(1); |
69 |
1
|
qu.insert(2); |
70 |
1
|
assertEquals(2, qu.size()); |
71 |
|
} |
72 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (9) |
Complexity: 1 |
Complexity Density: 0,11 |
1
PASS
|
|
73 |
1
|
public void testSize() {... |
74 |
1
|
assertEquals(0, qu.size()); |
75 |
1
|
qu.insert(1); |
76 |
1
|
assertEquals(1, qu.size()); |
77 |
1
|
qu.insert(2); |
78 |
1
|
assertEquals(2, qu.size()); |
79 |
1
|
qu.dequeue(); |
80 |
1
|
assertEquals(1, qu.size()); |
81 |
1
|
qu.dequeue(); |
82 |
1
|
assertEquals(0, qu.size()); |
83 |
|
} |
84 |
|
|
85 |
|
private IntQueue qu; |
86 |
|
|
87 |
|
} |