All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.chocosolver.solver.constraints.binary.PropNotEqualX_Y Maven / Gradle / Ivy

There is a newer version: 4.10.17
Show newest version
/*
 * This file is part of choco-solver, http://choco-solver.org/
 *
 * Copyright (c) 2023, IMT Atlantique. All rights reserved.
 *
 * Licensed under the BSD 4-clause license.
 *
 * See LICENSE file in the project root for full license information.
 */
package org.chocosolver.solver.constraints.binary;

import org.chocosolver.solver.constraints.Propagator;
import org.chocosolver.solver.constraints.PropagatorPriority;
import org.chocosolver.solver.exception.ContradictionException;
import org.chocosolver.solver.learn.ExplanationForSignedClause;
import org.chocosolver.solver.variables.IntVar;
import org.chocosolver.solver.variables.events.IntEventType;
import org.chocosolver.util.ESat;
import org.chocosolver.util.objects.setDataStructures.iterable.IntIterableRangeSet;
import org.chocosolver.util.tools.ArrayUtils;

/**
 * A specific Propagator extension defining filtering algorithm for:
 * 
* X =/= Y *
where X and Y are Variable objects. *
* This Propagator defines the propagate and awakeOnInst methods. The other ones * throw UnsupportedOperationException. *
*
* Based on Choco-2.1.1 * * @author Xavier Lorca * @author Charles Prud'homme * @author Arnaud Malapert * @version 0.01, june 2010 * @since 0.01 */ public class PropNotEqualX_Y extends Propagator { private final IntVar x; private final IntVar y; @SuppressWarnings({"unchecked"}) public PropNotEqualX_Y(IntVar x, IntVar y) { super(ArrayUtils.toArray(x, y), PropagatorPriority.BINARY, false); this.x = vars[0]; this.y = vars[1]; } @Override public int getPropagationConditions(int vIdx) { //Principle : if v0 is instantiated and v1 is enumerated, then awakeOnInst(0) performs all needed pruning //Otherwise, we must check if we can remove the value from v1 when the bounds has changed. if (vars[vIdx].hasEnumeratedDomain()) { return IntEventType.instantiation(); } return IntEventType.boundAndInst(); } @Override public void propagate(int evtmask) throws ContradictionException { if (x.isInstantiated()) { if (y.removeValue(x.getValue(), this) || !y.contains(x.getValue())) { this.setPassive(); } } else if (y.isInstantiated()) { if (x.removeValue(y.getValue(), this) || !x.contains(y.getValue())) { this.setPassive(); } } else if (x.getUB() < (y.getLB()) || (y.getUB()) < x.getLB()) { setPassive(); } } @Override public ESat isEntailed() { if ((x.getUB() < y.getLB()) || (y.getUB() < x.getLB())) return ESat.TRUE; else if (x.isInstantiated() && y.isInstantiated()) return ESat.FALSE; else return ESat.UNDEFINED; } @Override public void explain(int p, ExplanationForSignedClause explanation) { int m; IntIterableRangeSet set0, set1; if (explanation.readVar(p) == vars[0]) { assert explanation.readDom(vars[1]).size() == 1; m = explanation.readDom(vars[1]).min(); set0 = explanation.universe(); set1 = explanation.universe(); set0.remove(m); set1.remove(m); vars[0].intersectLit(set0, explanation); vars[1].unionLit(set1, explanation); } else { assert explanation.readDom(vars[0]).size() == 1; m = explanation.readDom(vars[0]).min(); set0 = explanation.universe(); set1 = explanation.universe(); set0.remove(m); set1.remove(m); vars[0].unionLit(set0, explanation); vars[1].intersectLit(set1, explanation); } } @Override public String toString() { return "prop(" + vars[0].getName() + ".NEQ." + vars[1].getName() + ")"; } }




© 2015 - 2024 Weber Informatics LLC | Privacy Policy