View Javadoc

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;
31  
32  import static org.junit.Assert.assertEquals;
33  
34  import org.junit.Before;
35  import org.junit.Test;
36  import org.sat4j.core.VecInt;
37  import org.sat4j.minisat.SolverFactory;
38  import org.sat4j.specs.ContradictionException;
39  import org.sat4j.specs.ISolver;
40  import org.sat4j.specs.IVecInt;
41  
42  public class TestFreeId {
43  
44      private ISolver solver;
45  
46      @Before
47      public void setUp() {
48          this.solver = SolverFactory.newDefault();
49      }
50  
51      @Test
52      public void testEmptySolver() {
53          assertEquals(1, this.solver.nextFreeVarId(false));
54          this.solver.newVar(100);
55          assertEquals(101, this.solver.nextFreeVarId(false));
56      }
57  
58      @Test
59      public void testIncrementalFeed() throws ContradictionException {
60          assertEquals(1, this.solver.nextFreeVarId(false));
61          IVecInt clause = new VecInt();
62          clause.push(3).push(-5);
63          this.solver.addClause(clause);
64          assertEquals(6, this.solver.nextFreeVarId(false));
65          clause.clear();
66          clause.push(1).push(-2);
67          this.solver.addClause(clause);
68          assertEquals(6, this.solver.nextFreeVarId(false));
69          clause.clear();
70          clause.push(1000).push(-31);
71          this.solver.addClause(clause);
72          assertEquals(1001, this.solver.nextFreeVarId(false));
73      }
74  
75      @Test
76      public void testReserveParameter() {
77          assertEquals(1, this.solver.nextFreeVarId(false));
78          assertEquals(1, this.solver.nextFreeVarId(false));
79          assertEquals(1, this.solver.nextFreeVarId(false));
80          assertEquals(1, this.solver.nextFreeVarId(false));
81          assertEquals(1, this.solver.nextFreeVarId(true));
82          assertEquals(2, this.solver.nextFreeVarId(true));
83          assertEquals(3, this.solver.nextFreeVarId(false));
84          assertEquals(3, this.solver.nextFreeVarId(false));
85      }
86  }