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

org.chocosolver.solver.expression.discrete.relational.ReExpression 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.expression.discrete.relational;

import org.chocosolver.solver.Model;
import org.chocosolver.solver.constraints.Constraint;
import org.chocosolver.solver.constraints.extension.Tuples;
import org.chocosolver.solver.constraints.extension.TuplesFactory;
import org.chocosolver.solver.expression.discrete.arithmetic.ArExpression;
import org.chocosolver.solver.expression.discrete.arithmetic.IfArExpression;
import org.chocosolver.solver.expression.discrete.logical.BiLoExpression;
import org.chocosolver.solver.expression.discrete.logical.LoExpression;
import org.chocosolver.solver.expression.discrete.logical.NaLoExpression;
import org.chocosolver.solver.expression.discrete.logical.UnLoExpression;
import org.chocosolver.solver.variables.BoolVar;
import org.chocosolver.solver.variables.IntVar;

import java.util.HashSet;
import java.util.LinkedHashSet;
import java.util.Map;
import java.util.stream.Collectors;
import java.util.stream.IntStream;

/**
 * relational expression
 * 

* Project: choco-solver. * * @author Charles Prud'homme * @since 28/04/2016. */ public interface ReExpression extends ArExpression { /** * List of available operator for relational expression */ enum Operator { /** * less than */ LT { @Override boolean eval(int i1, int i2) { return i1 < i2; } }, /** * less than or equal to */ LE { @Override boolean eval(int i1, int i2) { return i1 <= i2; } }, /** * greater than */ GE { @Override boolean eval(int i1, int i2) { return i1 >= i2; } }, /** * greater than or equal to */ GT { @Override boolean eval(int i1, int i2) { return i1 > i2; } }, /** * not equal to */ NE { @Override boolean eval(int i1, int i2) { return i1 != i2; } }, /** * equal to */ EQ { @Override boolean eval(int i1, int i2) { return i1 == i2; } }, IN { @Override boolean eval(int i1, int i2) { return i1 == i2; } }, NIN { @Override boolean eval(int i1, int i2) { return i1 != i2; } } ; abstract boolean eval(int i1, int i2); } /** * Return the associated model * * @return a Model object */ Model getModel(); /** * @return the relational expression as an {@link BoolVar}. * If necessary, it creates intermediary variable and posts intermediary constraints */ BoolVar boolVar(); @Override default IntVar intVar() { return boolVar(); } /** * Extract the variables from this expression * @param variables set of variables */ void extractVar(HashSet variables); /** * Post the decomposition of this expression in the solver */ default void post() { decompose().post(); } /** * @return the topmost constraint representing the expression. If needed, a call to this method * creates additional variables and posts additional constraints. */ default Constraint decompose(){ throw new UnsupportedOperationException(); } /** * @return a TABLE constraint that captures the expression */ default Constraint extension() { HashSet avars = new LinkedHashSet<>(); extractVar(avars); IntVar[] uvars = avars.stream().sorted().toArray(IntVar[]::new); Map map = IntStream.range(0, uvars.length).boxed().collect(Collectors.toMap(i -> uvars[i], i -> i)); Tuples tuples = TuplesFactory.generateTuples(values -> beval(values, map), true, uvars); // System.out.printf("%d -> %d\n", VariableUtils.domainCardinality(uvars), tuples.nbTuples()); return getModel().table(uvars, tuples); } /** * @param values int values to evaluate * @param map mapping between variables of the topmost expression and position in values * @return an evaluation of this relational expression based on a tuple */ default boolean beval(int[] values, Map map){ assert this instanceof BoolVar; return values[map.get(this)] == 1; } @Override default int ieval(int[] values, Map map) { return beval(values, map)?1:0; } /** * @param y some relational expressions * @return return the expression "x ∧ y_1 ∧ y_2 ∧ ..." where this is "x" */ default ReExpression and(ReExpression... y) { return new NaLoExpression(LoExpression.Operator.AND, this, y); } /** * @param y some relational expressions * @return return the expression "x ∨ y_1 ∨ y_2 ∨ ..." where this is "x" */ default ReExpression or(ReExpression... y) { return new NaLoExpression(LoExpression.Operator.OR, this, y); } /** * @param y a relational expression * @return return the expression "x ⊕ y_1 ⊕ y_2 ⊕ ..." where this is "x" */ default ReExpression xor(ReExpression... y) { if (y.length == 1) { return new BiLoExpression(LoExpression.Operator.XOR, this, y[0]); } else { return new NaLoExpression(LoExpression.Operator.XOR, this, y); } } /** * @param y a relational expression * @return return the expression "x ⇒ y" where this is "x" */ default ReExpression imp(ReExpression y) { return new BiLoExpression(LoExpression.Operator.IMP, this, y); } /** * @param y a relational expression * @return return the expression "x ⇔ y_1 ⇔ y_2 ⇔ ..." where this is "x" */ default ReExpression iff(ReExpression... y) { if(y.length == 1){ return new BiLoExpression(LoExpression.Operator.IFF, this, y[0]); }else { return new NaLoExpression(LoExpression.Operator.IFF, this, y); } } /** * @return return the expression "¬x" where this is "x" */ default ReExpression not() { return new UnLoExpression(LoExpression.Operator.NOT, this); } /** * @param y1 an arithmetic expression * @param y2 an arithmetic expression * @return return "if(b,y1,y2)" where this is "b" */ default ArExpression ift(ArExpression y1, ArExpression y2) { return new IfArExpression(this, y1, y2); } /** * @param y1 an arithmetic expression * @param y2 an int * @return return a arithmetic expression that is equal to y1 if b is true, y2 otherwise. */ default ArExpression ift(ArExpression y1, int y2) { return new IfArExpression(this, y1, this.getModel().intVar(y2)); } /** * @param y1 an int * @param y2 an arithmetic expression * @return return a arithmetic expression that is equal to y1 if b is true, y2 otherwise. */ default ArExpression ift(int y1, ArExpression y2) { return new IfArExpression(this, this.getModel().intVar(y1), y2); } /** * @param y1 an int * @param y2 an int * @return return a arithmetic expression that is equal to y1 if b is true, y2 otherwise. */ default ArExpression ift(int y1, int y2) { return new IfArExpression(this, this.getModel().intVar(y1), this.getModel().intVar(y2)); } }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy