1 /*
2 * SAT4J: a SATisfiability library for Java Copyright (C) 2004-2006 Daniel Le Berre
3 *
4 * Based on the original minisat specification from:
5 *
6 * An extensible SAT solver. Niklas E?n and Niklas S?rensson. Proceedings of the
7 * Sixth International Conference on Theory and Applications of Satisfiability
8 * Testing, LNCS 2919, pp 502-518, 2003.
9 *
10 * This library is free software; you can redistribute it and/or modify it under
11 * the terms of the GNU Lesser General Public License as published by the Free
12 * Software Foundation; either version 2.1 of the License, or (at your option)
13 * any later version.
14 *
15 * This library is distributed in the hope that it will be useful, but WITHOUT
16 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
17 * FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more
18 * details.
19 *
20 * You should have received a copy of the GNU Lesser General Public License
21 * along with this library; if not, write to the Free Software Foundation, Inc.,
22 * 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
23 *
24 */
25 package org.sat4j.reader.csp;
26
27 import java.util.Iterator;
28 import java.util.NoSuchElementException;
29
30 public class EnumeratedDomain implements Domain {
31
32 private final int[] values;
33
34 public EnumeratedDomain(int[] values) {
35 // DLB findbugs ok
36 this.values = values;
37 }
38
39 public int get(int i) {
40 return values[i];
41 }
42
43 public int size() {
44 return values.length;
45 }
46
47 public Iterator<Integer> iterator() {
48 return new Iterator<Integer>() {
49 private int i = 0;
50
51 public boolean hasNext() {
52 return i < values.length;
53 }
54
55 public Integer next() {
56 if (i == values.length)
57 throw new NoSuchElementException();
58 return values[i++];
59 }
60
61 public void remove() {
62 throw new UnsupportedOperationException();
63 }
64 };
65 }
66
67 public int pos(int value) {
68 for (int i = 0; i < values.length; i++)
69 if (values[i] == value)
70 return i;
71 return -1;
72 }
73 }