org.chocosolver.solver.expression.discrete.relational.NaReExpression Maven / Gradle / Ivy
Show all versions of choco-solver Show documentation
/*
* This file is part of choco-solver, http://choco-solver.org/
*
* Copyright (c) 2022, 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.expression.discrete.relational;
import org.chocosolver.solver.Model;
import org.chocosolver.solver.constraints.Constraint;
import org.chocosolver.solver.exception.SolverException;
import org.chocosolver.solver.expression.discrete.arithmetic.ArExpression;
import org.chocosolver.solver.variables.BoolVar;
import org.chocosolver.solver.variables.IntVar;
import org.chocosolver.util.tools.ArrayUtils;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Map;
/**
* Binary relational expression
*
* Project: choco-solver.
*
* @author Charles Prud'homme
* @since 28/04/2016.
*/
public class NaReExpression implements ReExpression {
/**
* The model in which the expression is declared
*/
Model model;
/**
* Lazy creation of the underlying variable
*/
BoolVar me = null;
/**
* Operator of the arithmetic expression
*/
Operator op;
/**
* The expressions this expression relies on
*/
private final ArExpression[] es;
/**
* Builds a nary expression
*
* @param op an operator
* @param e an expression
* @param es some expressions
*/
public NaReExpression(Operator op, ArExpression e, ArExpression... es) {
this(op, ArrayUtils.append(new ArExpression[]{e}, es));
}
/**
* Builds a binary expression
*
* @param op an operator
* @param es some expressions
*/
public NaReExpression(Operator op, ArExpression... es) {
this.model = es[0].getModel();
this.op = op;
this.es = es;
}
@Override
public Model getModel() {
return model;
}
@Override
public BoolVar boolVar() {
if (me == null) {
IntVar[] vs = Arrays.stream(es).map(ArExpression::intVar).toArray(IntVar[]::new);
me = model.boolVar(model.generateName(op+"_exp_"));
if (op == Operator.EQ) {
if (vs.length == 2) {
model.reifyXeqY(vs[0], vs[1], me);
} else {
IntVar count = model.intVar(op + "_count_", 1, vs.length);
model.nValues(vs, count).post();
model.reifyXeqC(count, 1, me);
}
}else if(op == Operator.IN){
BoolVar[] reifs = model.boolVarArray(vs.length - 1);
for(int i = 1; i < vs.length; i++) {
model.reifyXeqY(vs[0], vs[i], reifs[i-1]);
}
model.addClausesSumBoolArrayGreaterEqVar(reifs,me);
} else {
throw new UnsupportedOperationException(
"Binary arithmetic expressions does not support " + op.name());
}
}
return me;
}
@Override
public void extractVar(HashSet variables) {
Arrays.stream(es).forEach(e -> e.extractVar(variables));
}
@Override
public Constraint decompose() {
IntVar[] vs = Arrays.stream(es).map(ArExpression::intVar).toArray(IntVar[]::new);
switch (op) {
case EQ:
if(vs.length == 2){
return model.arithm(vs[0], "=", vs[1]);
}else {
return model.allEqual(vs);
}
case IN:
return model.count(vs[0],
Arrays.copyOfRange(vs, 1, vs.length),
model.intVar(op+"_idx", 1, vs.length-1));
}
throw new SolverException("Unexpected case");
}
@Override
public boolean beval(int[] values, Map map) {
boolean eval;
switch (op) {
case EQ:
eval = true;
for (int i = 1; i < es.length && eval; i++) {
eval = op.eval(es[0].ieval(values, map), es[i].ieval(values, map));
}
break;
case IN:
eval = false;
for (int i = 1; i < es.length; i++) {
eval |= op.eval(es[0].ieval(values, map), es[i].ieval(values, map));
}
break;
default:
throw new IllegalStateException("Unexpected value: " + op);
}
return eval;
}
@Override
public String toString() {
return op.name() + "(" + es[0].toString() + ", ...," + es[es.length - 1].toString() + ")";
}
}