| 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.opt; |
| 26 |
|
|
| 27 |
|
import org.sat4j.specs.ISolver; |
| 28 |
|
import org.sat4j.specs.TimeoutException; |
| 29 |
|
import org.sat4j.tools.SolverDecorator; |
| 30 |
|
|
|
|
|
| 0% |
Uncovered Elements: 31 (31) |
Complexity: 4 |
Complexity Density: 0,47 |
|
| 31 |
|
public abstract class AbstractSelectorVariablesDecorator extends |
| 32 |
|
SolverDecorator { |
| 33 |
|
|
| 34 |
|
protected int nborigvars; |
| 35 |
|
|
| 36 |
|
private int nbexpectedclauses; |
| 37 |
|
|
| 38 |
|
protected int nbnewvar; |
| 39 |
|
|
| 40 |
|
protected int[] prevfullmodel; |
| 41 |
|
|
|
|
|
| 0% |
Uncovered Elements: 1 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
| 42 |
0
|
public AbstractSelectorVariablesDecorator(ISolver solver) {... |
| 43 |
0
|
super(solver); |
| 44 |
|
} |
| 45 |
|
|
|
|
|
| 0% |
Uncovered Elements: 11 (11) |
Complexity: 3 |
Complexity Density: 0,43 |
|
| 46 |
0
|
@Override... |
| 47 |
|
public int[] model() { |
| 48 |
0
|
int end = nborigvars - 1; |
| 49 |
0
|
while (Math.abs(prevfullmodel[end]) > nborigvars) |
| 50 |
0
|
end--; |
| 51 |
0
|
int[] shortmodel = new int[end + 1]; |
| 52 |
0
|
for (int i = 0; i <= end; i++) { |
| 53 |
0
|
shortmodel[i] = prevfullmodel[i]; |
| 54 |
|
} |
| 55 |
0
|
return shortmodel; |
| 56 |
|
} |
| 57 |
|
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0,5 |
|
| 58 |
0
|
@Override... |
| 59 |
|
public int newVar(int howmany) { |
| 60 |
0
|
nborigvars = super.newVar(howmany); |
| 61 |
0
|
return nborigvars; |
| 62 |
|
} |
| 63 |
|
|
|
|
|
| 0% |
Uncovered Elements: 3 (3) |
Complexity: 1 |
Complexity Density: 0,33 |
|
| 64 |
0
|
@Override... |
| 65 |
|
public void setExpectedNumberOfClauses(int nb) { |
| 66 |
0
|
nbexpectedclauses = nb; |
| 67 |
0
|
super.setExpectedNumberOfClauses(nb); |
| 68 |
0
|
super.newVar(nborigvars + nbexpectedclauses); |
| 69 |
|
} |
| 70 |
|
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0,5 |
|
| 71 |
0
|
@Override... |
| 72 |
|
public void reset() { |
| 73 |
0
|
super.reset(); |
| 74 |
0
|
nbnewvar = 0; |
| 75 |
|
} |
| 76 |
|
|
|
|
|
| 0% |
Uncovered Elements: 6 (6) |
Complexity: 2 |
Complexity Density: 0,5 |
|
| 77 |
0
|
public boolean admitABetterSolution() throws TimeoutException {... |
| 78 |
0
|
boolean result = super.isSatisfiable(); |
| 79 |
0
|
if (result) |
| 80 |
0
|
prevfullmodel = super.model(); |
| 81 |
0
|
return result; |
| 82 |
|
} |
| 83 |
|
|
| 84 |
|
} |