1 |
|
package org.sat4j.minisat.core; |
2 |
|
|
3 |
|
import junit.framework.TestCase; |
4 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (55) |
Complexity: 1 |
Complexity Density: 0,17 |
|
5 |
|
public class HeapTest extends TestCase { |
6 |
|
|
7 |
|
|
8 |
|
|
9 |
|
|
|
|
| - |
Uncovered Elements: 0 (0) |
Complexity: 1 |
Complexity Density: - |
1
PASS
|
|
10 |
1
|
public void testSetBounds() {... |
11 |
|
|
12 |
|
} |
13 |
|
|
14 |
|
|
15 |
|
|
16 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (29) |
Complexity: 1 |
Complexity Density: 0,03 |
1
PASS
|
|
17 |
1
|
public void testInHeap() {... |
18 |
1
|
Heap heap = new Heap(new double[] { 0.0, 3.0, 9.0, 2.0 }); |
19 |
1
|
heap.setBounds(5); |
20 |
1
|
assertFalse(heap.inHeap(1)); |
21 |
1
|
assertFalse(heap.inHeap(2)); |
22 |
1
|
assertFalse(heap.inHeap(3)); |
23 |
1
|
heap.insert(1); |
24 |
1
|
assertTrue(heap.inHeap(1)); |
25 |
1
|
assertFalse(heap.inHeap(2)); |
26 |
1
|
assertFalse(heap.inHeap(3)); |
27 |
1
|
heap.insert(2); |
28 |
1
|
assertTrue(heap.inHeap(1)); |
29 |
1
|
assertTrue(heap.inHeap(2)); |
30 |
1
|
assertFalse(heap.inHeap(3)); |
31 |
1
|
heap.insert(3); |
32 |
1
|
assertTrue(heap.inHeap(1)); |
33 |
1
|
assertTrue(heap.inHeap(2)); |
34 |
1
|
assertTrue(heap.inHeap(3)); |
35 |
1
|
assertEquals(2, heap.getmin()); |
36 |
1
|
assertTrue(heap.inHeap(1)); |
37 |
1
|
assertFalse(heap.inHeap(2)); |
38 |
1
|
assertTrue(heap.inHeap(3)); |
39 |
1
|
assertEquals(1, heap.getmin()); |
40 |
1
|
assertFalse(heap.inHeap(1)); |
41 |
1
|
assertFalse(heap.inHeap(2)); |
42 |
1
|
assertTrue(heap.inHeap(3)); |
43 |
1
|
assertEquals(3, heap.getmin()); |
44 |
1
|
assertFalse(heap.inHeap(1)); |
45 |
1
|
assertFalse(heap.inHeap(2)); |
46 |
1
|
assertFalse(heap.inHeap(3)); |
47 |
|
|
48 |
|
} |
49 |
|
|
50 |
|
|
51 |
|
|
52 |
|
|
|
|
| - |
Uncovered Elements: 0 (0) |
Complexity: 1 |
Complexity Density: - |
1
PASS
|
|
53 |
1
|
public void testIncrease() {... |
54 |
|
|
55 |
|
} |
56 |
|
|
57 |
|
|
58 |
|
|
59 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (2) |
Complexity: 1 |
Complexity Density: 0,5 |
1
PASS
|
|
60 |
1
|
public void testEmpty() {... |
61 |
1
|
Heap heap = new Heap(new double[] {}); |
62 |
1
|
assertTrue(heap.empty()); |
63 |
|
} |
64 |
|
|
65 |
|
|
66 |
|
|
67 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (8) |
Complexity: 1 |
Complexity Density: 0,12 |
1
PASS
|
|
68 |
1
|
public void testInsert() {... |
69 |
1
|
Heap heap = new Heap(new double[] { 0.0, 1.0, 1.0, 2.0 }); |
70 |
1
|
heap.setBounds(5); |
71 |
1
|
heap.insert(1); |
72 |
1
|
heap.insert(2); |
73 |
1
|
heap.insert(3); |
74 |
1
|
assertEquals(3, heap.getmin()); |
75 |
1
|
assertEquals(1, heap.getmin()); |
76 |
1
|
assertEquals(2, heap.getmin()); |
77 |
|
} |
78 |
|
|
79 |
|
|
80 |
|
|
81 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (8) |
Complexity: 1 |
Complexity Density: 0,12 |
1
PASS
|
|
82 |
1
|
public void testGetmin() {... |
83 |
1
|
Heap heap = new Heap(new double[] { 0.0, 3.0, 9.0, 2.0 }); |
84 |
1
|
heap.setBounds(5); |
85 |
1
|
heap.insert(1); |
86 |
1
|
heap.insert(2); |
87 |
1
|
heap.insert(3); |
88 |
1
|
assertEquals(2, heap.getmin()); |
89 |
1
|
assertEquals(1, heap.getmin()); |
90 |
1
|
assertEquals(3, heap.getmin()); |
91 |
|
} |
92 |
|
|
93 |
|
|
94 |
|
|
95 |
|
|
|
|
| - |
Uncovered Elements: 0 (0) |
Complexity: 1 |
Complexity Density: - |
1
PASS
|
|
96 |
1
|
public void testHeapProperty() {... |
97 |
|
|
98 |
|
} |
99 |
|
|
100 |
|
|
101 |
|
|
102 |
|
|
|
|
| - |
Uncovered Elements: 0 (0) |
Complexity: 1 |
Complexity Density: - |
1
PASS
|
|
103 |
1
|
public void testHeapPropertyInt() {... |
104 |
|
|
105 |
|
} |
106 |
|
|
107 |
|
} |