/*
* Copyright (c) 1999-2014, Ecole des Mines de Nantes
* All rights reserved.
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* * Neither the name of the Ecole des Mines de Nantes nor the
* names of its contributors may be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE REGENTS AND CONTRIBUTORS BE LIABLE FOR ANY
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
package solver.constraints.unary;
import gnu.trove.iterator.TIntIterator;
import gnu.trove.map.hash.THashMap;
import gnu.trove.set.hash.TIntHashSet;
import solver.Solver;
import solver.constraints.Propagator;
import solver.constraints.PropagatorPriority;
import solver.exception.ContradictionException;
import solver.explanations.Deduction;
import solver.explanations.Explanation;
import solver.variables.IntVar;
import util.ESat;
import java.util.Arrays;
/**
* <br/>
*
* @author Charles Prud'homme
* @since 26 nov. 2010
*/
public class PropNotMemberEnum extends Propagator<IntVar> {
final TIntHashSet values;
public PropNotMemberEnum(IntVar var, int[] values) {
super(new IntVar[]{var}, PropagatorPriority.UNARY, false);
this.values = new TIntHashSet(values);
}
@Override
public void propagate(int evtmask) throws ContradictionException {
TIntIterator it = values.iterator();
int left = Integer.MIN_VALUE;
int right = left;
boolean rall = true;
for (; it.hasNext(); ) {
int val = it.next();
if (val == right + 1) {
right = val;
} else {
if (left > Integer.MIN_VALUE) {
rall &= vars[0].removeInterval(left, right, aCause);
}
left = right = val;
}
}
if (left > Integer.MIN_VALUE) {
rall &= vars[0].removeInterval(left, right, aCause);
}
if (rall) {
this.setPassive();
}
}
@Override
public void propagate(int varIdx, int mask) throws ContradictionException {
propagate(0);
}
@Override
public ESat isEntailed() {
int ub = this.vars[0].getUB();
int nb = 0;
for (int val = this.vars[0].getLB(); val <= ub; val = this.vars[0].nextValue(val)) {
if (!values.contains(val)) {
nb++;
}
}
if (nb == 0) return ESat.FALSE;
else if (nb == vars[0].getDomainSize()) return ESat.TRUE;
return ESat.UNDEFINED;
}
@Override
public String toString() {
return vars[0].getName() + " outside " + Arrays.toString(values.toArray());
}
@Override
public void explain(Deduction d, Explanation e) {
e.add(solver.getExplainer().getPropagatorActivation(this));
e.add(aCause);
}
@Override
public void duplicate(Solver solver, THashMap<Object, Object> identitymap) {
if (!identitymap.containsKey(this)) {
identitymap.put(this, new PropNotMemberEnum((IntVar) identitymap.get(vars[0]), values.toArray()));
}
}
}