Clover Coverage Report
Coverage timestamp: mer. juin 27 2007 07:27:16 CEST
19   84   4   3,17
6   46   0,47   6
6     1,5  
1    
 
  AbstractSelectorVariablesDecorator       Line # 31 19 4 0% 0.0
 
No Tests
 
1    /*
2    * SAT4J: a SATisfiability library for Java Copyright (C) 2004-2006 Daniel Le Berre
3    *
4    * Based on the original minisat specification from:
5    *
6    * An extensible SAT solver. Niklas E?n and Niklas S?rensson. Proceedings of the
7    * Sixth International Conference on Theory and Applications of Satisfiability
8    * Testing, LNCS 2919, pp 502-518, 2003.
9    *
10    * This library is free software; you can redistribute it and/or modify it under
11    * the terms of the GNU Lesser General Public License as published by the Free
12    * Software Foundation; either version 2.1 of the License, or (at your option)
13    * any later version.
14    *
15    * This library is distributed in the hope that it will be useful, but WITHOUT
16    * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
17    * FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more
18    * details.
19    *
20    * You should have received a copy of the GNU Lesser General Public License
21    * along with this library; if not, write to the Free Software Foundation, Inc.,
22    * 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
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   
 
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   
 
42  0 toggle public AbstractSelectorVariablesDecorator(ISolver solver) {
43  0 super(solver);
44    }
45   
 
46  0 toggle @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   
 
58  0 toggle @Override
59    public int newVar(int howmany) {
60  0 nborigvars = super.newVar(howmany);
61  0 return nborigvars;
62    }
63   
 
64  0 toggle @Override
65    public void setExpectedNumberOfClauses(int nb) {
66  0 nbexpectedclauses = nb;
67  0 super.setExpectedNumberOfClauses(nb);
68  0 super.newVar(nborigvars + nbexpectedclauses);
69    }
70   
 
71  0 toggle @Override
72    public void reset() {
73  0 super.reset();
74  0 nbnewvar = 0;
75    }
76   
 
77  0 toggle 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    }