View Javadoc

1   /*******************************************************************************
2    * SAT4J: a SATisfiability library for Java Copyright (C) 2004-2008 Daniel Le Berre
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   *******************************************************************************/
28  package org.sat4j.tools;
29  
30  import java.util.Map;
31  
32  import org.sat4j.specs.IConstr;
33  import org.sat4j.specs.Lbool;
34  import org.sat4j.specs.SearchListener;
35  
36  /**
37   * Debugging Search Listener allowing to follow the search in a textual way.
38   * 
39   * @author daniel
40   * @since 2.2
41   */
42  public class TextOutputTracing<T> implements SearchListener {
43  
44  	private static final long serialVersionUID = 1L;
45  
46  	private final Map<Integer, T> mapping;
47  
48  	/**
49  	 * @since 2.1
50  	 */
51  	public TextOutputTracing(Map<Integer, T> mapping) {
52  		this.mapping = mapping;
53  	}
54  
55  	private String node(int dimacs) {
56  
57  		if (mapping != null) {
58  			int var = Math.abs(dimacs);
59  			T t = mapping.get(var);
60  			if (t != null) {
61  				if (dimacs > 0)
62  					return t.toString();
63  				return "-" + t.toString();
64  			}
65  		}
66  		return Integer.toString(dimacs);
67  	}
68  
69  	public void assuming(int p) {
70  		System.out.println("assuming " + node(p));
71  	}
72  
73  	/**
74  	 * @since 2.1
75  	 */
76  	public void propagating(int p, IConstr reason) {
77  		System.out.println("propagating " + node(p));
78  	}
79  
80  	public void backtracking(int p) {
81  		System.out.println("backtracking " + node(p));
82  	}
83  
84  	public void adding(int p) {
85  		System.out.println("adding " + node(p));
86  	}
87  
88  	/**
89  	 * @since 2.1
90  	 */
91  	public void learn(IConstr clause) {
92  
93  	}
94  
95  	public void delete(int[] clause) {
96  
97  	}
98  
99  	/**
100 	 * @since 2.1
101 	 */
102 	public void conflictFound(IConstr confl, int dlevel, int trailLevel) {
103 		System.out.println("conflict ");
104 	}
105 
106 	/**
107 	 * @since 2.1
108 	 */
109 	public void conflictFound(int p) {
110 		System.out.println("conflict during propagation");
111 	}
112 
113 	public void solutionFound() {
114 		System.out.println("solution found ");
115 	}
116 
117 	public void beginLoop() {
118 	}
119 
120 	public void start() {
121 	}
122 
123 	/**
124 	 * @since 2.1
125 	 */
126 	public void end(Lbool result) {
127 	}
128 
129 	/**
130 	 * @since 2.2
131 	 */
132 	public void restarting() {
133 		System.out.println("restarting ");
134 	}
135 
136 	public void backjump(int backjumpLevel) {
137 		System.out.println("backjumping to decision level " + backjumpLevel);
138 	}
139 
140 }