1 /*******************************************************************************
2 * SAT4J: a SATisfiability library for Java Copyright (C) 2004, 2012 Artois University and CNRS
3 *
4 * All rights reserved. This program and the accompanying materials
5 * are made available under the terms of the Eclipse Public License v1.0
6 * which accompanies this distribution, and is available at
7 * http://www.eclipse.org/legal/epl-v10.html
8 *
9 * Alternatively, the contents of this file may be used under the terms of
10 * either the GNU Lesser General Public License Version 2.1 or later (the
11 * "LGPL"), in which case the provisions of the LGPL are applicable instead
12 * of those above. If you wish to allow use of your version of this file only
13 * under the terms of the LGPL, and not to allow others to use your version of
14 * this file under the terms of the EPL, indicate your decision by deleting
15 * the provisions above and replace them with the notice and other provisions
16 * required by the LGPL. If you do not delete the provisions above, a recipient
17 * may use your version of this file under the terms of the EPL or the LGPL.
18 *
19 * Based on the original MiniSat specification from:
20 *
21 * An extensible SAT solver. Niklas Een and Niklas Sorensson. Proceedings of the
22 * Sixth International Conference on Theory and Applications of Satisfiability
23 * Testing, LNCS 2919, pp 502-518, 2003.
24 *
25 * See www.minisat.se for the original solver in C++.
26 *
27 * Contributors:
28 * CRIL - initial API and implementation
29 *******************************************************************************/
30 package org.sat4j.tools;
31
32 import java.util.Map;
33
34 import org.sat4j.specs.IConstr;
35 import org.sat4j.specs.ISolverService;
36 import org.sat4j.specs.Lbool;
37 import org.sat4j.specs.SearchListener;
38
39 /**
40 * Debugging Search Listener allowing to follow the search in a textual way.
41 *
42 * @author daniel
43 * @since 2.2
44 */
45 public class TextOutputTracing<T> implements SearchListener {
46
47 private static final long serialVersionUID = 1L;
48
49 private final Map<Integer, T> mapping;
50
51 /**
52 * @since 2.1
53 */
54 public TextOutputTracing(Map<Integer, T> mapping) {
55 this.mapping = mapping;
56 }
57
58 private String node(int dimacs) {
59
60 if (this.mapping != null) {
61 int var = Math.abs(dimacs);
62 T t = this.mapping.get(var);
63 if (t != null) {
64 if (dimacs > 0) {
65 return t.toString();
66 }
67 return "-" + t.toString();
68 }
69 }
70 return Integer.toString(dimacs);
71 }
72
73 public void assuming(int p) {
74 System.out.println("assuming " + node(p));
75 }
76
77 /**
78 * @since 2.1
79 */
80 public void propagating(int p, IConstr reason) {
81 System.out.println("propagating " + node(p));
82 }
83
84 public void backtracking(int p) {
85 System.out.println("backtracking " + node(p));
86 }
87
88 public void adding(int p) {
89 System.out.println("adding " + node(p));
90 }
91
92 /**
93 * @since 2.1
94 */
95 public void learn(IConstr clause) {
96 System.out.println("learning " + clause);
97
98 }
99
100 public void delete(int[] clause) {
101
102 }
103
104 /**
105 * @since 2.1
106 */
107 public void conflictFound(IConstr confl, int dlevel, int trailLevel) {
108 System.out.println("conflict ");
109 }
110
111 /**
112 * @since 2.1
113 */
114 public void conflictFound(int p) {
115 System.out.println("conflict during propagation");
116 }
117
118 public void solutionFound(int[] model) {
119 System.out.println("solution found ");
120 }
121
122 public void beginLoop() {
123 }
124
125 public void start() {
126 }
127
128 /**
129 * @since 2.1
130 */
131 public void end(Lbool result) {
132 }
133
134 /**
135 * @since 2.2
136 */
137 public void restarting() {
138 System.out.println("restarting ");
139 }
140
141 public void backjump(int backjumpLevel) {
142 System.out.println("backjumping to decision level " + backjumpLevel);
143 }
144
145 /**
146 * @since 2.3.2
147 */
148 public void init(ISolverService solverService) {
149 }
150
151 /**
152 * @since 2.3.2
153 */
154 public void cleaning() {
155 System.out.println("cleaning");
156 }
157
158 }