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.minisat.core;
31
32 import org.sat4j.specs.IConstr;
33 import org.sat4j.specs.ISolverService;
34 import org.sat4j.specs.Lbool;
35 import org.sat4j.specs.SearchListener;
36
37 /**
38 * Do-nothing search listener. Used by default by the solver when no
39 * SearchListener is provided to the solver.
40 *
41 * @author leberre
42 *
43 */
44 final class VoidTracing implements SearchListener<ISolverService> {
45 private static final long serialVersionUID = 1L;
46
47 public void assuming(int p) {
48 }
49
50 public void propagating(int p, IConstr reason) {
51 }
52
53 public void backtracking(int p) {
54 }
55
56 public void adding(int p) {
57 }
58
59 public void learn(IConstr clause) {
60 }
61
62 public void delete(int[] clause) {
63 }
64
65 public void conflictFound(IConstr confl, int dlevel, int trailLevel) {
66 }
67
68 public void conflictFound(int p) {
69 }
70
71 public void solutionFound(int[] model) {
72 }
73
74 public void beginLoop() {
75 }
76
77 public void start() {
78 }
79
80 public void end(Lbool result) {
81 }
82
83 public void restarting() {
84 }
85
86 public void backjump(int backjumpLevel) {
87 }
88
89 public void init(ISolverService solverService) {
90 }
91
92 public void cleaning() {
93 }
94 }