| 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 |
|
package org.sat4j.minisat.constraints.cnf; |
| 26 |
|
|
| 27 |
|
import java.util.HashSet; |
| 28 |
|
import java.util.Set; |
| 29 |
|
|
| 30 |
|
import org.sat4j.core.VecInt; |
| 31 |
|
import org.sat4j.minisat.core.IMarkableLits; |
| 32 |
|
import org.sat4j.specs.IVecInt; |
| 33 |
|
|
|
|
|
| 95,8% |
Uncovered Elements: 3 (72) |
Complexity: 14 |
Complexity Density: 0,74 |
|
| 34 |
|
public class MarkableLits extends Lits implements IMarkableLits { |
| 35 |
|
|
| 36 |
|
|
| 37 |
|
|
| 38 |
|
|
| 39 |
|
private static final long serialVersionUID = 1L; |
| 40 |
|
|
| 41 |
|
private int[] marks; |
| 42 |
|
|
| 43 |
|
private static final int DEFAULTMARK = 1; |
| 44 |
|
|
|
|
|
| 100% |
Uncovered Elements: 0 (2) |
Complexity: 1 |
Complexity Density: 0,5 |
|
| 45 |
12
|
@Override... |
| 46 |
|
public void init(int nvar) { |
| 47 |
12
|
super.init(nvar); |
| 48 |
12
|
marks = new int[(nvar << 1) + 2]; |
| 49 |
|
} |
| 50 |
|
|
|
|
|
| 57,1% |
Uncovered Elements: 3 (7) |
Complexity: 1 |
Complexity Density: 1 |
|
| 51 |
44
|
public void setMark(int p, int mark) {... |
| 52 |
44
|
assert marks != null; |
| 53 |
44
|
assert p > 1; |
| 54 |
44
|
assert p < marks.length; |
| 55 |
44
|
marks[p] = mark; |
| 56 |
|
} |
| 57 |
|
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
| 58 |
9
|
public void setMark(int p) {... |
| 59 |
9
|
setMark(p, DEFAULTMARK); |
| 60 |
|
} |
| 61 |
|
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
| 62 |
45
|
public int getMark(int p) {... |
| 63 |
45
|
return marks[p]; |
| 64 |
|
} |
| 65 |
|
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
| 66 |
110
|
public boolean isMarked(int p) {... |
| 67 |
110
|
return marks[p] != MARKLESS; |
| 68 |
|
} |
| 69 |
|
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
| 70 |
23
|
public void resetMark(int p) {... |
| 71 |
23
|
marks[p] = MARKLESS; |
| 72 |
|
} |
| 73 |
|
|
|
|
|
| 100% |
Uncovered Elements: 0 (4) |
Complexity: 2 |
Complexity Density: 1 |
|
| 74 |
1
|
public void resetAllMarks() {... |
| 75 |
21
|
for (int i = 2; i < marks.length; i++) |
| 76 |
20
|
resetMark(i); |
| 77 |
|
} |
| 78 |
|
|
|
|
|
| 100% |
Uncovered Elements: 0 (9) |
Complexity: 3 |
Complexity Density: 0,6 |
|
| 79 |
1
|
public IVecInt getMarkedLiterals() {... |
| 80 |
1
|
IVecInt marked = new VecInt(); |
| 81 |
21
|
for (int i = 2; i < marks.length; i++) { |
| 82 |
20
|
if (isMarked(i)) |
| 83 |
3
|
marked.push(i); |
| 84 |
|
} |
| 85 |
1
|
return marked; |
| 86 |
|
} |
| 87 |
|
|
|
|
|
| 100% |
Uncovered Elements: 0 (9) |
Complexity: 3 |
Complexity Density: 0,6 |
|
| 88 |
1
|
public IVecInt getMarkedLiterals(int mark) {... |
| 89 |
1
|
IVecInt marked = new VecInt(); |
| 90 |
21
|
for (int i = 2; i < marks.length; i++) { |
| 91 |
20
|
if (getMark(i) == mark) |
| 92 |
2
|
marked.push(i); |
| 93 |
|
} |
| 94 |
1
|
return marked; |
| 95 |
|
} |
| 96 |
|
|
|
|
|
| 100% |
Uncovered Elements: 0 (9) |
Complexity: 4 |
Complexity Density: 0,8 |
|
| 97 |
1
|
public IVecInt getMarkedVariables() {... |
| 98 |
1
|
IVecInt marked = new VecInt(); |
| 99 |
11
|
for (int i = 2; i < marks.length; i += 2) { |
| 100 |
10
|
if (isMarked(i) || isMarked(i + 1)) |
| 101 |
3
|
marked.push(i >> 1); |
| 102 |
|
} |
| 103 |
1
|
return marked; |
| 104 |
|
} |
| 105 |
|
|
|
|
|
| 100% |
Uncovered Elements: 0 (9) |
Complexity: 4 |
Complexity Density: 0,8 |
|
| 106 |
1
|
public IVecInt getMarkedVariables(int mark) {... |
| 107 |
1
|
IVecInt marked = new VecInt(); |
| 108 |
11
|
for (int i = 2; i < marks.length; i += 2) { |
| 109 |
10
|
if (getMark(i) == mark || getMark(i + 1) == mark) |
| 110 |
2
|
marked.push(i >> 1); |
| 111 |
|
} |
| 112 |
1
|
return marked; |
| 113 |
|
} |
| 114 |
|
|
|
|
|
| 100% |
Uncovered Elements: 0 (7) |
Complexity: 3 |
Complexity Density: 0,6 |
|
| 115 |
1
|
public Set<Integer> getMarks() {... |
| 116 |
1
|
Set<Integer> markers = new HashSet<Integer>(); |
| 117 |
1
|
for (int m : marks) |
| 118 |
22
|
if (m != MARKLESS) |
| 119 |
3
|
markers.add(m); |
| 120 |
1
|
return markers; |
| 121 |
|
} |
| 122 |
|
} |