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.minisat.constraints.cnf;
29
30 import org.sat4j.minisat.core.ILits23;
31
32 /**
33 * @author leberre To change the template for this generated type comment go to
34 * Window - Preferences - Java - Code Generation - Code and Comments
35 */
36 public class Lits23 extends Lits2 implements ILits23 {
37
38 private static final long serialVersionUID = 1L;
39
40 private TernaryClauses[] ternclauses = null;
41
42 /**
43 *
44 */
45 public Lits23() {
46 super();
47 }
48
49 private void register(int p, int q, int r) {
50 assert p > 1;
51 assert q > 1;
52 assert r > 1;
53
54 if (ternclauses == null) {
55 ternclauses = new TernaryClauses[2 * capacity() + 2];
56 } else {
57 int maxid = Math.max(p, q);
58 if (ternclauses.length <= maxid) {
59 TernaryClauses[] nternclauses = new TernaryClauses[2 * capacity() + 2];
60 System.arraycopy(ternclauses, 0, nternclauses, 0,
61 ternclauses.length);
62 ternclauses = nternclauses;
63 }
64 }
65 if (ternclauses[p] == null) {
66 ternclauses[p] = new TernaryClauses(this, p);
67 watches[p ^ 1].push(ternclauses[p]);
68 }
69 ternclauses[p].addTernaryClause(q, r);
70 }
71
72 public void ternaryClauses(int lit1, int lit2, int lit3) {
73 register(lit1, lit2, lit3);
74 register(lit2, lit1, lit3);
75 register(lit3, lit1, lit2);
76 }
77
78 public int nTernaryClauses(int p) {
79 if (ternclauses == null) {
80 return 0;
81 }
82 if (ternclauses[p] == null) {
83 return 0;
84 }
85 return ternclauses[p].size();
86 }
87 }