/**
* 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.
*/
/**
* Created by IntelliJ IDEA.
* User: Jean-Guillaume Fages
* Date: 14/01/13
* Time: 16:36
*/
package solver.constraints.set;
import gnu.trove.map.hash.THashMap;
import solver.Solver;
import solver.constraints.Propagator;
import solver.constraints.PropagatorPriority;
import solver.exception.ContradictionException;
import solver.variables.SetVar;
import solver.variables.delta.ISetDeltaMonitor;
import solver.variables.events.PropagatorEventType;
import solver.variables.events.SetEventType;
import util.ESat;
import util.procedure.IntProcedure;
/**
* Ensures that all sets are equal
*
* @author Jean-Guillaume Fages
*/
public class PropAllEqual extends Propagator<SetVar> {
//***********************************************************************************
// VARIABLES
//***********************************************************************************
private int n;
private ISetDeltaMonitor[] sdm;
private IntProcedure elementForced, elementRemoved;
//***********************************************************************************
// CONSTRUCTORS
//***********************************************************************************
/**
* Ensures that all sets are equal
*
* @param sets
*/
public PropAllEqual(SetVar[] sets) {
super(sets, PropagatorPriority.LINEAR, true);
n = sets.length;
// delta monitors
sdm = new ISetDeltaMonitor[n];
for (int i = 0; i < n; i++) {
sdm[i] = this.vars[i].monitorDelta(this);
}
elementForced = new IntProcedure() {
@Override
public void execute(int element) throws ContradictionException {
for (int i = 0; i < n; i++) {
vars[i].addToKernel(element, aCause);
}
}
};
elementRemoved = new IntProcedure() {
@Override
public void execute(int element) throws ContradictionException {
for (int i = 0; i < n; i++) {
vars[i].removeFromEnvelope(element, aCause);
}
}
};
}
//***********************************************************************************
// METHODS
//***********************************************************************************
@Override
public void propagate(int evtmask) throws ContradictionException {
if (PropagatorEventType.isFullPropagation(evtmask)) {
for (int i = 0; i < n; i++) {
for (int j = vars[i].getKernelFirst(); j != SetVar.END; j = vars[i].getKernelNext()) {
for (int i2 = 0; i2 < n; i2++) {
vars[i2].addToKernel(j, aCause);
}
}
// removing elements that are not in all set envelope would be a waste of time
}
}
for (int i = 0; i < n; i++) {
sdm[i].unfreeze();
}
}
@Override
public void propagate(int idxVarInProp, int mask) throws ContradictionException {
sdm[idxVarInProp].freeze();
sdm[idxVarInProp].forEach(elementForced, SetEventType.ADD_TO_KER);
sdm[idxVarInProp].forEach(elementRemoved, SetEventType.REMOVE_FROM_ENVELOPE);
sdm[idxVarInProp].unfreeze();
}
@Override
public ESat isEntailed() {
boolean allInstantiated = true;
for (int i = 0; i < n; i++) {
if (!vars[i].isInstantiated()) {
allInstantiated = false;
}
for (int j = vars[i].getKernelFirst(); j != SetVar.END; j = vars[i].getKernelNext()) {
for (int i2 = 0; i2 < n; i2++) {
if (!vars[i2].envelopeContains(j)) {
return ESat.FALSE;
}
}
}
}
if (allInstantiated) {
return ESat.TRUE;
}
return ESat.UNDEFINED;
}
@Override
public void duplicate(Solver solver, THashMap<Object, Object> identitymap) {
if (!identitymap.containsKey(this)) {
int size = this.vars.length;
SetVar[] aVars = new SetVar[size];
for (int i = 0; i < size; i++) {
this.vars[i].duplicate(solver, identitymap);
aVars[i] = (SetVar) identitymap.get(this.vars[i]);
}
identitymap.put(this, new PropAllEqual(aVars));
}
}
}