Examples of solver.Solver.propagate()

solver.Solver.propagate()
Propagate constraints and related events through the constraint network until a fix point is find, or a contradiction is detected. @throws ContradictionException

    public void testMinus1() {
        Solver solver = new Solver();
        IntVar var = VariableFactory.minus(VariableFactory.enumerated("b", new int[]{1, 2, 4}, solver));
    if(!Configuration.ENABLE_VIEWS){
      try {
        solver.propagate();
      }catch (Exception e){
        e.printStackTrace();
        throw new UnsupportedOperationException();
      }
    }

View Full Code Here

    public void testMinus2() {
        Solver solver = new Solver();
        IntVar var = VariableFactory.minus(VariableFactory.enumerated("b", new int[]{1, 2, 4}, solver));
    if(!Configuration.ENABLE_VIEWS){
      try {
        solver.propagate();
      }catch (Exception e){
        e.printStackTrace();
        throw new UnsupportedOperationException();
      }
    }

View Full Code Here

    public void testMinus3() {
        Solver solver = new Solver();
        IntVar var = VariableFactory.minus(VariableFactory.enumerated("b", new int[]{1, 2, 4}, solver));
    if(!Configuration.ENABLE_VIEWS){
      try {
        solver.propagate();
      }catch (Exception e){
        e.printStackTrace();
        throw new UnsupportedOperationException();
      }
    }

View Full Code Here

    public void testMinus4() {
        Solver solver = new Solver();
        IntVar var = VariableFactory.minus(VariableFactory.enumerated("b", new int[]{1, 2, 4}, solver));
    if(!Configuration.ENABLE_VIEWS){
      try {
        solver.propagate();
      }catch (Exception e){
        e.printStackTrace();
        throw new UnsupportedOperationException();
      }
    }

View Full Code Here

    @Test(groups = "1s")
    public void testAbs1() {
        Solver solver = new Solver();
        IntVar var = VariableFactory.abs(VariableFactory.enumerated("b", new int[]{-2, 1, 4}, solver));
        try {
            solver.propagate();
        } catch (ContradictionException e) {
            e.printStackTrace();
        }
        DisposableValueIterator vit = var.getValueIterator(true);
        Assert.assertTrue(vit.hasNext());

View Full Code Here

    @Test(groups = "1s")
    public void testAbs2() {
        Solver solver = new Solver();
        IntVar var = VariableFactory.abs(VariableFactory.enumerated("b", new int[]{-2, 1, 4}, solver));
        try {
            solver.propagate();
        } catch (ContradictionException e) {
            e.printStackTrace();
        }
        DisposableValueIterator vit = var.getValueIterator(false);
        Assert.assertTrue(vit.hasPrevious());

View Full Code Here

    @Test(groups = "1s")
    public void testAbs3() {
        Solver solver = new Solver();
        IntVar var = VariableFactory.abs(VariableFactory.enumerated("b", new int[]{-2, 1, 4}, solver));
        try {
            solver.propagate();
        } catch (ContradictionException e) {
            e.printStackTrace();
        }
        DisposableRangeIterator vit = var.getRangeIterator(true);
        Assert.assertTrue(vit.hasNext());

View Full Code Here

    @Test(groups = "1s")
    public void testAbs4() {
        Solver solver = new Solver();
        IntVar var = VariableFactory.abs(VariableFactory.enumerated("b", new int[]{-2, 1, 4}, solver));
        try {
            solver.propagate();
        } catch (ContradictionException e) {
            e.printStackTrace();
        }
        DisposableRangeIterator vit = var.getRangeIterator(false);
        Assert.assertTrue(vit.hasPrevious());

View Full Code Here


        solver.post(ICF.lex_chain_less(X));




        try {
            solver.propagate();
            X[0][0].updateLowerBound(1, Cause.Null);
            X[0][1].updateLowerBound(1, Cause.Null);
            X[1][0].updateLowerBound(1, Cause.Null);
            X[2][1].updateLowerBound(1, Cause.Null);
            solver.propagate();

View Full Code Here

            solver.propagate();
            X[0][0].updateLowerBound(1, Cause.Null);
            X[0][1].updateLowerBound(1, Cause.Null);
            X[1][0].updateLowerBound(1, Cause.Null);
            X[2][1].updateLowerBound(1, Cause.Null);
            solver.propagate();
            X[2][1].instantiateTo(1, Cause.Null);
            solver.propagate();
        } catch (ContradictionException e) {
            Assert.fail();
        }

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.