/**
* 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.binary;
import gnu.trove.map.hash.THashMap;
import solver.Solver;
import solver.constraints.Constraint;
import solver.constraints.Operator;
import solver.exception.SolverException;
import solver.variables.IntVar;
import util.tools.ArrayUtils;
/**
* Ensures: <br/>
* |X-Y| OP C
* <br/>
* where OP can take its value among {=, >, <, =/=}
*
* @author Charles Prud'homme
* @since 21/03/12
*/
public class DistanceXYC extends Constraint {
final IntVar X, Y;
final int C;
final Operator operator;
public DistanceXYC(IntVar X, IntVar Y, Operator operator, int C) {
super("DistanceXYC " + operator.name(), new PropDistanceXYC(ArrayUtils.toArray(X, Y), operator, C));
if (operator != Operator.EQ && operator != Operator.GT && operator != Operator.LT && operator != Operator.NQ) {
throw new SolverException("Unexpected operator for distance");
}
this.X = X;
this.Y = Y;
this.C = C;
this.operator = operator;
}
// will be ok once every operator is supported
// public Constraint makeOpposite(){
// return new DistanceXYC(X,Y,Operator.getOpposite(operator),C);
// }
@Override
public void duplicate(Solver solver, THashMap<Object, Object> identitymap) {
if (!identitymap.containsKey(this)) {
this.X.duplicate(solver, identitymap);
IntVar X = (IntVar) identitymap.get(this.X);
this.Y.duplicate(solver, identitymap);
IntVar Y = (IntVar) identitymap.get(this.Y);
Constraint clone = new DistanceXYC(X, Y, this.operator, this.C);
identitymap.put(this.propagators[0], clone.getPropagator(0));
identitymap.put(this, clone);
}
}
}