Clover Coverage Report
Coverage timestamp: mer. juin 27 2007 07:27:16 CEST
Overview   Package   File
    FRAMES   NO FRAMES     
19   104   6   2,38
8   57   0,68   8
8     1,62  
1    
 
  MinOneDecorator       Line # 40 19 6 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.core.VecInt;
28    import org.sat4j.specs.ContradictionException;
29    import org.sat4j.specs.IOptimizationProblem;
30    import org.sat4j.specs.ISolver;
31    import org.sat4j.specs.IVecInt;
32    import org.sat4j.specs.TimeoutException;
33    import org.sat4j.tools.SolverDecorator;
34   
35    /**
36    * Computes a solution with the smallest number of satisfied literals.
37    *
38    * @author leberre
39    */
 
40    public class MinOneDecorator extends SolverDecorator implements
41    IOptimizationProblem {
42   
43    /**
44    *
45    */
46    private static final long serialVersionUID = 1L;
47   
48    private int[] prevmodel;
49   
 
50  0 toggle public MinOneDecorator(ISolver solver) {
51  0 super(solver);
52    }
53   
 
54  0 toggle public boolean admitABetterSolution() throws TimeoutException {
55  0 boolean result = isSatisfiable();
56  0 if (result) {
57  0 prevmodel = super.model();
58    }
59  0 return result;
60    }
61   
 
62  0 toggle public boolean hasNoObjectiveFunction() {
63  0 return false;
64    }
65   
 
66  0 toggle public boolean nonOptimalMeansSatisfiable() {
67  0 return true;
68    }
69   
70    private int counter;
71   
 
72  0 toggle public Number calculateObjective() {
73  0 counter = 0;
74  0 for (int p : prevmodel) {
75  0 if (p > 0) {
76  0 counter++;
77    }
78    }
79  0 return counter;
80    }
81   
82    private final IVecInt literals = new VecInt();
83   
 
84  0 toggle public void discard() throws ContradictionException {
85  0 if (literals.isEmpty()) {
86  0 for (int i = 1; i <= nVars(); i++) {
87  0 literals.push(i);
88    }
89    }
90  0 addAtMost(literals, counter - 1);
91    }
92   
 
93  0 toggle @Override
94    public int[] model() {
95  0 return prevmodel;
96    }
97   
 
98  0 toggle @Override
99    public void reset() {
100  0 literals.clear();
101  0 super.reset();
102    }
103   
104    }
 
CloverReport generated by Clover Code Coverage v2.0a5
mer. juin 27 2007 07:27:33 CEST.		   Beta Testers License registered to clover-support@cenqua.com. This license of Clover2 is provided for beta testing only. You have 5 day(s) before your Beta Tester License expires.