Generated on Mon Nov 30 23:53:40 2009 for Gecode by doxygen 1.6.1
gecode

minimodel.hh File Reference

(Revision: 10032)

#include <gecode/kernel.hh>
#include <gecode/int.hh>
#include <gecode/set.hh>
#include <gecode/int/linear.hh>
#include <gecode/minimodel/exception.hpp>
#include <iostream>
#include <gecode/support/auto-link.hpp>
#include <gecode/minimodel/lin-expr.hpp>
#include <gecode/minimodel/lin-rel.hpp>
#include <gecode/minimodel/bool-expr.hpp>
#include <gecode/minimodel/bool-rel.hpp>
#include <gecode/minimodel/arithmetic.hpp>
#include <gecode/minimodel/matrix.hpp>
#include <gecode/minimodel/optimize.hpp>

Go to the source code of this file.

Classes

class  Gecode::LinExpr< Var >
 Linear expressions. More...
class  Gecode::LinRel< Var >
 Linear relations. More...
class  Gecode::BoolExpr
 Boolean expressions. More...
class  Gecode::BoolExpr::Node
 Node for Boolean expression. More...
class  Gecode::BoolExpr::NNF
 Node for negation normalform (NNF). More...
class  Gecode::BoolRel
 Boolean relations. More...
class  Gecode::REG
 Regular expressions over integer values. More...
class  Gecode::Matrix< A >
 Matrix-interface for arrays. More...
class  Gecode::Matrix< A >::Slice
 A slice of a matrix. More...
class  Gecode::MiniModel::OptimizeSpace< irt >
 Baseclass for cost-based optimization. More...

Namespaces

namespace  Gecode
 

Gecode toplevel namespace.


namespace  Gecode::MiniModel
 

Minimalistic modeling support.


Defines

#define GECODE_MINIMODEL_EXPORT
#define GECODE_LIBRARY_NAME   "MiniModel"

Typedefs

typedef
MiniModel::OptimizeSpace
< IRT_LE > 		Gecode::MinimizeSpace
 Class for minimizing cost.
typedef
MiniModel::OptimizeSpace
< IRT_GR > 		Gecode::MaximizeSpace
 Class for maximizing cost.

Functions

LinExpr< IntVar > Gecode::operator+ (int, const IntVar &)
 Construct linear expression as sum of variable and integer.
LinExpr< IntVar > Gecode::operator+ (int, const LinExpr< IntVar > &)
 Construct linear expression as sum of linear expression and integer.
LinExpr< IntVar > Gecode::operator+ (const IntVar &, int)
 Construct linear expression as sum of integer and linear expression.
LinExpr< IntVar > Gecode::operator+ (const LinExpr< IntVar > &, int)
 Construct linear expression as sum of integer and variable.
LinExpr< IntVar > Gecode::operator+ (const IntVar &, const IntVar &)
 Construct linear expression as sum of variables.
LinExpr< IntVar > Gecode::operator+ (const IntVar &, const LinExpr< IntVar > &)
 Construct linear expression as sum of variable and linear expression.
LinExpr< IntVar > Gecode::operator+ (const LinExpr< IntVar > &, const IntVar &)
 Construct linear expression as sum of linear expression and variable.
LinExpr< IntVar > Gecode::operator+ (const LinExpr< IntVar > &, const LinExpr< IntVar > &)
 Construct linear expression as sum of linear expressions.
LinExpr< IntVar > Gecode::operator- (int, const IntVar &)
 Construct linear expression as sum of variable and integer.
LinExpr< IntVar > Gecode::operator- (int, const LinExpr< IntVar > &)
 Construct linear expression as sum of linear expression and integer.
LinExpr< IntVar > Gecode::operator- (const IntVar &, int)
 Construct linear expression as sum of integer and linear expression.
LinExpr< IntVar > Gecode::operator- (const LinExpr< IntVar > &, int)
 Construct linear expression as sum of integer and variable.
LinExpr< IntVar > Gecode::operator- (const IntVar &, const IntVar &)
 Construct linear expression as sum of variables.
LinExpr< IntVar > Gecode::operator- (const IntVar &, const LinExpr< IntVar > &)
 Construct linear expression as sum of variable and linear expression.
LinExpr< IntVar > Gecode::operator- (const LinExpr< IntVar > &, const IntVar &)
 Construct linear expression as sum of linear expression and variable.
LinExpr< IntVar > Gecode::operator- (const LinExpr< IntVar > &, const LinExpr< IntVar > &)
 Construct linear expression as sum of linear expressions.
LinExpr< IntVar > Gecode::operator- (const IntVar &)
 Construct linear expression as negative of variable.
LinExpr< IntVar > Gecode::operator- (const LinExpr< IntVar > &)
 Construct linear expression as negative of linear expression.
LinExpr< IntVar > Gecode::operator* (int, const IntVar &)
 Construct linear expression as product of integer coefficient and integer variable.
LinExpr< IntVar > Gecode::operator* (const IntVar &, int)
 Construct linear expression as product of integer coefficient and integer variable.
LinExpr< IntVar > Gecode::operator* (const LinExpr< IntVar > &, int)
 Construct linear expression as product of integer coefficient and linear expression.
LinExpr< IntVar > Gecode::operator* (int, const LinExpr< IntVar > &)
 Construct linear expression as product of integer coefficient and linear expression.
LinExpr< BoolVar > Gecode::operator+ (int, const BoolVar &)
 Construct linear expression as sum of variable and integer.
LinExpr< BoolVar > Gecode::operator+ (int, const LinExpr< BoolVar > &)
 Construct linear expression as sum of linear expression and integer.
LinExpr< BoolVar > Gecode::operator+ (const BoolVar &, int)
 Construct linear expression as sum of integer and linear expression.
LinExpr< BoolVar > Gecode::operator+ (const LinExpr< BoolVar > &, int)
 Construct linear expression as sum of integer and variable.
LinExpr< BoolVar > Gecode::operator+ (const BoolVar &, const BoolVar &)
 Construct linear expression as sum of variables.
LinExpr< BoolVar > Gecode::operator+ (const BoolVar &, const LinExpr< BoolVar > &)
 Construct linear expression as sum of variable and linear expression.
LinExpr< BoolVar > Gecode::operator+ (const LinExpr< BoolVar > &, const BoolVar &)
 Construct linear expression as sum of linear expression and variable.
LinExpr< BoolVar > Gecode::operator+ (const LinExpr< BoolVar > &, const LinExpr< BoolVar > &)
 Construct linear expression as sum of linear expressions.
LinExpr< BoolVar > Gecode::operator- (int, const BoolVar &)
 Construct linear expression as sum of variable and integer.
LinExpr< BoolVar > Gecode::operator- (int, const LinExpr< BoolVar > &)
 Construct linear expression as sum of linear expression and integer.
LinExpr< BoolVar > Gecode::operator- (const BoolVar &, int)
 Construct linear expression as sum of integer and linear expression.
LinExpr< BoolVar > Gecode::operator- (const LinExpr< BoolVar > &, int)
 Construct linear expression as sum of integer and variable.
LinExpr< BoolVar > Gecode::operator- (const BoolVar &, const BoolVar &)
 Construct linear expression as sum of variables.
LinExpr< BoolVar > Gecode::operator- (const BoolVar &, const LinExpr< BoolVar > &)
 Construct linear expression as sum of variable and linear expression.
LinExpr< BoolVar > Gecode::operator- (const LinExpr< BoolVar > &, const BoolVar &)
 Construct linear expression as sum of linear expression and variable.
LinExpr< BoolVar > Gecode::operator- (const LinExpr< BoolVar > &, const LinExpr< BoolVar > &)
 Construct linear expression as sum of linear expressions.
LinExpr< BoolVar > Gecode::operator- (const BoolVar &)
 Construct linear expression as negative of variable.
LinExpr< BoolVar > Gecode::operator- (const LinExpr< BoolVar > &)
 Construct linear expression as negative of linear expression.
LinExpr< BoolVar > Gecode::operator* (int, const BoolVar &)
 Construct linear expression as product of integer coefficient and integer variable.
LinExpr< BoolVar > Gecode::operator* (const BoolVar &, int)
 Construct linear expression as product of integer coefficient and integer variable.
LinExpr< BoolVar > Gecode::operator* (const LinExpr< BoolVar > &, int)
 Construct linear expression as product of integer coefficient and linear expression.
LinExpr< BoolVar > Gecode::operator* (int, const LinExpr< BoolVar > &)
 Construct linear expression as product of integer coefficient and linear expression.
LinRel< IntVar > Gecode::operator== (int l, const IntVar &r)
 Construct linear equality relation.
LinRel< IntVar > Gecode::operator== (int l, const LinExpr< IntVar > &r)
 Construct linear equality relation.
LinRel< IntVar > Gecode::operator== (const IntVar &l, int r)
 Construct linear equality relation.
LinRel< IntVar > Gecode::operator== (const LinExpr< IntVar > &l, int r)
 Construct linear equality relation.
LinRel< IntVar > Gecode::operator== (const IntVar &l, const IntVar &r)
 Construct linear equality relation.
LinRel< IntVar > Gecode::operator== (const IntVar &l, const LinExpr< IntVar > &r)
 Construct linear equality relation.
LinRel< IntVar > Gecode::operator== (const LinExpr< IntVar > &l, const IntVar &r)
 Construct linear equality relation.
LinRel< IntVar > Gecode::operator== (const LinExpr< IntVar > &l, const LinExpr< IntVar > &r)
 Construct linear equality relation.
LinRel< IntVar > Gecode::operator!= (int l, const IntVar &r)
 Construct linear disequality relation.
LinRel< IntVar > Gecode::operator!= (int l, const LinExpr< IntVar > &r)
 Construct linear disequality relation.
LinRel< IntVar > Gecode::operator!= (const IntVar &l, int r)
 Construct linear disequality relation.
LinRel< IntVar > Gecode::operator!= (const LinExpr< IntVar > &l, int r)
 Construct linear disequality relation.
LinRel< IntVar > Gecode::operator!= (const IntVar &l, const IntVar &r)
 Construct linear disequality relation.
LinRel< IntVar > Gecode::operator!= (const IntVar &l, const LinExpr< IntVar > &r)
 Construct linear disequality relation.
LinRel< IntVar > Gecode::operator!= (const LinExpr< IntVar > &l, const IntVar &r)
 Construct linear disequality relation.
LinRel< IntVar > Gecode::operator!= (const LinExpr< IntVar > &l, const LinExpr< IntVar > &r)
 Construct linear disequality relation.
LinRel< IntVar > Gecode::operator< (int l, const IntVar &r)
 Construct linear inequality relation.
LinRel< IntVar > Gecode::operator< (int l, const LinExpr< IntVar > &r)
 Construct linear inequality relation.
LinRel< IntVar > Gecode::operator< (const IntVar &l, int r)
 Construct linear inequality relation.
LinRel< IntVar > Gecode::operator< (const LinExpr< IntVar > &l, int r)
 Construct linear inequality relation.
LinRel< IntVar > Gecode::operator< (const IntVar &l, const IntVar &r)
 Construct linear inequality relation.
LinRel< IntVar > Gecode::operator< (const IntVar &l, const LinExpr< IntVar > &r)
 Construct linear inequality relation.
LinRel< IntVar > Gecode::operator< (const LinExpr< IntVar > &l, const IntVar &r)
 Construct linear inequality relation.
LinRel< IntVar > Gecode::operator< (const LinExpr< IntVar > &l, const LinExpr< IntVar > &r)
 Construct linear inequality relation.
LinRel< IntVar > Gecode::operator<= (int l, const IntVar &r)
 Construct linear inequality relation.
LinRel< IntVar > Gecode::operator<= (int l, const LinExpr< IntVar > &r)
 Construct linear inequality relation.
LinRel< IntVar > Gecode::operator<= (const IntVar &l, int r)
 Construct linear inequality relation.
LinRel< IntVar > Gecode::operator<= (const LinExpr< IntVar > &l, int r)
 Construct linear inequality relation.
LinRel< IntVar > Gecode::operator<= (const IntVar &l, const IntVar &r)
 Construct linear inequality relation.
LinRel< IntVar > Gecode::operator<= (const IntVar &l, const LinExpr< IntVar > &r)
 Construct linear inequality relation.
LinRel< IntVar > Gecode::operator<= (const LinExpr< IntVar > &l, const IntVar &r)
 Construct linear inequality relation.
LinRel< IntVar > Gecode::operator<= (const LinExpr< IntVar > &l, const LinExpr< IntVar > &r)
 Construct linear inequality relation.
LinRel< IntVar > Gecode::operator> (int l, const IntVar &r)
 Construct linear inequality relation.
LinRel< IntVar > Gecode::operator> (int l, const LinExpr< IntVar > &r)
 Construct linear inequality relation.
LinRel< IntVar > Gecode::operator> (const IntVar &l, int r)
 Construct linear inequality relation.
LinRel< IntVar > Gecode::operator> (const LinExpr< IntVar > &l, int r)
 Construct linear inequality relation.
LinRel< IntVar > Gecode::operator> (const IntVar &l, const IntVar &r)
 Construct linear inequality relation.
LinRel< IntVar > Gecode::operator> (const IntVar &l, const LinExpr< IntVar > &r)
 Construct linear inequality relation.
LinRel< IntVar > Gecode::operator> (const LinExpr< IntVar > &l, const IntVar &r)
 Construct linear inequality relation.
LinRel< IntVar > Gecode::operator> (const LinExpr< IntVar > &l, const LinExpr< IntVar > &r)
 Construct linear inequality relation.
LinRel< IntVar > Gecode::operator>= (int l, const IntVar &r)
 Construct linear inequality relation.
LinRel< IntVar > Gecode::operator>= (int l, const LinExpr< IntVar > &r)
 Construct linear inequality relation.
LinRel< IntVar > Gecode::operator>= (const IntVar &l, int r)
 Construct linear inequality relation.
LinRel< IntVar > Gecode::operator>= (const LinExpr< IntVar > &l, int r)
 Construct linear inequality relation.
LinRel< IntVar > Gecode::operator>= (const IntVar &l, const IntVar &r)
 Construct linear inequality relation.
LinRel< IntVar > Gecode::operator>= (const IntVar &l, const LinExpr< IntVar > &r)
 Construct linear inequality relation.
LinRel< IntVar > Gecode::operator>= (const LinExpr< IntVar > &l, const IntVar &r)
 Construct linear inequality relation.
LinRel< IntVar > Gecode::operator>= (const LinExpr< IntVar > &l, const LinExpr< IntVar > &r)
 Construct linear inequality relation.
LinRel< BoolVar > Gecode::operator== (int l, const BoolVar &r)
 Construct linear equality relation.
LinRel< BoolVar > Gecode::operator== (int l, const LinExpr< BoolVar > &r)
 Construct linear equality relation.
LinRel< BoolVar > Gecode::operator== (const BoolVar &l, int r)
 Construct linear equality relation.
LinRel< BoolVar > Gecode::operator== (const LinExpr< BoolVar > &l, int r)
 Construct linear equality relation.
LinRel< BoolVar > Gecode::operator== (const BoolVar &l, const BoolVar &r)
 Construct linear equality relation.
LinRel< BoolVar > Gecode::operator== (const BoolVar &l, const LinExpr< BoolVar > &r)
 Construct linear equality relation.
LinRel< BoolVar > Gecode::operator== (const LinExpr< BoolVar > &l, const BoolVar &r)
 Construct linear equality relation.
LinRel< BoolVar > Gecode::operator== (const LinExpr< BoolVar > &l, const LinExpr< BoolVar > &r)
 Construct linear equality relation.
LinRel< BoolVar > Gecode::operator!= (int l, const BoolVar &r)
 Construct linear disequality relation.
LinRel< BoolVar > Gecode::operator!= (int l, const LinExpr< BoolVar > &r)
 Construct linear disequality relation.
LinRel< BoolVar > Gecode::operator!= (const BoolVar &l, int r)
 Construct linear disequality relation.
LinRel< BoolVar > Gecode::operator!= (const LinExpr< BoolVar > &l, int r)
 Construct linear disequality relation.
LinRel< BoolVar > Gecode::operator!= (const BoolVar &l, const BoolVar &r)
 Construct linear disequality relation.
LinRel< BoolVar > Gecode::operator!= (const BoolVar &l, const LinExpr< BoolVar > &r)
 Construct linear disequality relation.
LinRel< BoolVar > Gecode::operator!= (const LinExpr< BoolVar > &l, const BoolVar &r)
 Construct linear disequality relation.
LinRel< BoolVar > Gecode::operator!= (const LinExpr< BoolVar > &l, const LinExpr< BoolVar > &r)
 Construct linear disequality relation.
LinRel< BoolVar > Gecode::operator< (int l, const BoolVar &r)
 Construct linear inequality relation.
LinRel< BoolVar > Gecode::operator< (int l, const LinExpr< BoolVar > &r)
 Construct linear inequality relation.
LinRel< BoolVar > Gecode::operator< (const BoolVar &l, int r)
 Construct linear inequality relation.
LinRel< BoolVar > Gecode::operator< (const LinExpr< BoolVar > &l, int r)
 Construct linear inequality relation.
LinRel< BoolVar > Gecode::operator< (const BoolVar &l, const BoolVar &r)
 Construct linear inequality relation.
LinRel< BoolVar > Gecode::operator< (const BoolVar &l, const LinExpr< BoolVar > &r)
 Construct linear inequality relation.
LinRel< BoolVar > Gecode::operator< (const LinExpr< BoolVar > &l, const BoolVar &r)
 Construct linear inequality relation.
LinRel< BoolVar > Gecode::operator< (const LinExpr< BoolVar > &l, const LinExpr< BoolVar > &r)
 Construct linear inequality relation.
LinRel< BoolVar > Gecode::operator<= (int l, const BoolVar &r)
 Construct linear inequality relation.
LinRel< BoolVar > Gecode::operator<= (int l, const LinExpr< BoolVar > &r)
 Construct linear inequality relation.
LinRel< BoolVar > Gecode::operator<= (const BoolVar &l, int r)
 Construct linear inequality relation.
LinRel< BoolVar > Gecode::operator<= (const LinExpr< BoolVar > &l, int r)
 Construct linear inequality relation.
LinRel< BoolVar > Gecode::operator<= (const BoolVar &l, const BoolVar &r)
 Construct linear inequality relation.
LinRel< BoolVar > Gecode::operator<= (const BoolVar &l, const LinExpr< BoolVar > &r)
 Construct linear inequality relation.
LinRel< BoolVar > Gecode::operator<= (const LinExpr< BoolVar > &l, const BoolVar &r)
 Construct linear inequality relation.
LinRel< BoolVar > Gecode::operator<= (const LinExpr< BoolVar > &l, const LinExpr< BoolVar > &r)
 Construct linear inequality relation.
LinRel< BoolVar > Gecode::operator> (int l, const BoolVar &r)
 Construct linear inequality relation.
LinRel< BoolVar > Gecode::operator> (int l, const LinExpr< BoolVar > &r)
 Construct linear inequality relation.
LinRel< BoolVar > Gecode::operator> (const BoolVar &l, int r)
 Construct linear inequality relation.
LinRel< BoolVar > Gecode::operator> (const LinExpr< BoolVar > &l, int r)
 Construct linear inequality relation.
LinRel< BoolVar > Gecode::operator> (const BoolVar &l, const BoolVar &r)
 Construct linear inequality relation.
LinRel< BoolVar > Gecode::operator> (const BoolVar &l, const LinExpr< BoolVar > &r)
 Construct linear inequality relation.
LinRel< BoolVar > Gecode::operator> (const LinExpr< BoolVar > &l, const BoolVar &r)
 Construct linear inequality relation.
LinRel< BoolVar > Gecode::operator> (const LinExpr< BoolVar > &l, const LinExpr< BoolVar > &r)
 Construct linear inequality relation.
LinRel< BoolVar > Gecode::operator>= (int l, const BoolVar &r)
 Construct linear inequality relation.
LinRel< BoolVar > Gecode::operator>= (int l, const LinExpr< BoolVar > &r)
 Construct linear inequality relation.
LinRel< BoolVar > Gecode::operator>= (const BoolVar &l, int r)
 Construct linear inequality relation.
LinRel< BoolVar > Gecode::operator>= (const LinExpr< BoolVar > &l, int r)
 Construct linear inequality relation.
LinRel< BoolVar > Gecode::operator>= (const BoolVar &l, const BoolVar &r)
 Construct linear inequality relation.
LinRel< BoolVar > Gecode::operator>= (const BoolVar &l, const LinExpr< BoolVar > &r)
 Construct linear inequality relation.
LinRel< BoolVar > Gecode::operator>= (const LinExpr< BoolVar > &l, const BoolVar &r)
 Construct linear inequality relation.
LinRel< BoolVar > Gecode::operator>= (const LinExpr< BoolVar > &l, const LinExpr< BoolVar > &r)
 Construct linear inequality relation.
BoolExpr Gecode::operator! (const BoolExpr &)
 Negated Boolean expression.
BoolExpr Gecode::operator&& (const BoolExpr &, const BoolExpr &)
 Conjunction of Boolean expressions.
BoolExpr Gecode::operator|| (const BoolExpr &, const BoolExpr &)
 Disjunction of Boolean expressions.
BoolExpr Gecode::operator^ (const BoolExpr &, const BoolExpr &)
 Exclusive-or of Boolean expressions.
template<class Var >
BoolExpr Gecode::operator~ (const LinRel< Var > &)
 Reification of linear relations.
BoolExpr Gecode::eqv (const BoolExpr &, const BoolExpr &)
 Equivalence of Boolean expressions.
BoolExpr Gecode::imp (const BoolExpr &, const BoolExpr &)
 Implication of Boolean expressions.
BoolRel Gecode::tt (const BoolExpr &)
 State that Boolean expression must be true.
BoolRel Gecode::ff (const BoolExpr &)
 State that Boolean expression must be false.
template<class Var >
IntVar Gecode::post (Home home, const LinExpr< Var > &e, IntConLevel icl=ICL_DEF)
 Post linear expression and return its value.
IntVar Gecode::post (Home home, const IntVar &x, IntConLevel icl=ICL_DEF)
 Post linear expression (special case for integer variable) and return its value.
IntVar Gecode::post (Home home, int n, IntConLevel icl=ICL_DEF)
 Post linear expression (special case for constant) and return its value.
template<class Var >
void Gecode::post (Home home, const LinRel< Var > &r, IntConLevel icl=ICL_DEF)
 Post linear relation.
void Gecode::post (Home home, bool r, IntConLevel icl=ICL_DEF)
 Make it work for special integer only-case.
BoolVar Gecode::post (Home home, const BoolExpr &e, IntConLevel icl=ICL_DEF)
 Post Boolean expression and return its value.
BoolVar Gecode::post (Home home, const BoolVar &b, IntConLevel icl=ICL_DEF)
 Post Boolean expression (special case for variable) and return its value.
void Gecode::post (Home home, const BoolRel &r, IntConLevel icl=ICL_DEF)
 Post Boolean relation.
IntVar Gecode::abs (Home home, IntVar x, IntConLevel icl=ICL_DEF)
 Return variable constrained to $|x|$.
IntVar Gecode::min (Home home, IntVar x, IntVar y, IntConLevel icl=ICL_DEF)
 Return variable constrained to $\min(x,y)$.
IntVar Gecode::min (Home home, const IntVarArgs &x, IntConLevel icl=ICL_DEF)
 Return variable constrained to $\min(x)$.
IntVar Gecode::max (Home home, IntVar x, IntVar y, IntConLevel icl=ICL_DEF)
 Return variable constrained to $\max(x,y)$.
IntVar Gecode::max (Home home, const IntVarArgs &x, IntConLevel icl=ICL_DEF)
 Return variable constrained to $\max(x)$.
IntVar Gecode::mult (Home home, IntVar x, IntVar y, IntConLevel icl=ICL_DEF)
 Return variable constrained to $x\cdot y$.
IntVar Gecode::div (Home home, IntVar x, IntVar y, IntConLevel icl=ICL_DEF)
 Return variable constrained to $x\ \mathrm{div}\ y$.
IntVar Gecode::mod (Home home, IntVar x, IntVar y, IntConLevel icl=ICL_DEF)
 Return variable constrained to $x\ \mathrm{mod}\ y$.
IntVar Gecode::sqr (Home home, IntVar x, IntConLevel icl=ICL_DEF)
 Return variable constrained to $x^2$.
IntVar Gecode::sqrt (Home home, IntVar x, IntConLevel icl=ICL_DEF)
 Return variable constrained to $\lfloor\sqrt{x}\rfloor$.
IntVar Gecode::plus (Home home, IntVar x, IntVar y, IntConLevel icl=ICL_DEF)
 Return variable constrained to $x+y$.
IntVar Gecode::minus (Home home, IntVar x, IntVar y, IntConLevel icl)
BoolVar Gecode::channel (Home home, IntVar x, IntConLevel icl=ICL_DEF)
 Return Boolean variable equal to $x$.
IntVar Gecode::channel (Home home, BoolVar b, IntConLevel icl=ICL_DEF)
 Return integer variable equal to $b$.
void Gecode::atmost (Home home, const IntVarArgs &x, int n, int m, IntConLevel icl=ICL_DEF)
 Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=n\}\leq m$.
void Gecode::atmost (Home home, const IntVarArgs &x, IntVar y, int m, IntConLevel icl=ICL_DEF)
 Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}\leq m$.
void Gecode::atmost (Home home, const IntVarArgs &x, const IntArgs &y, int m, IntConLevel icl=ICL_DEF)
 Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y_i\}\leq m$.
void Gecode::atmost (Home home, const IntVarArgs &x, int n, IntVar z, IntConLevel icl=ICL_DEF)
 Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=n\}\leq z$.
void Gecode::atmost (Home home, const IntVarArgs &x, IntVar y, IntVar z, IntConLevel icl=ICL_DEF)
 Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}\leq z$.
void Gecode::atmost (Home home, const IntVarArgs &x, const IntArgs &y, IntVar z, IntConLevel icl=ICL_DEF)
 Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y_i\}\leq z$.
void Gecode::atleast (Home home, const IntVarArgs &x, int n, int m, IntConLevel icl=ICL_DEF)
 Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=n\}\geq m$.
void Gecode::atleast (Home home, const IntVarArgs &x, IntVar y, int m, IntConLevel icl=ICL_DEF)
 Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}\geq m$.
void Gecode::atleast (Home home, const IntVarArgs &x, const IntArgs &y, int m, IntConLevel icl=ICL_DEF)
 Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y_i\}\geq m$.
void Gecode::atleast (Home home, const IntVarArgs &x, int n, IntVar z, IntConLevel icl=ICL_DEF)
 Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=n\}\geq z$.
void Gecode::atleast (Home home, const IntVarArgs &x, IntVar y, IntVar z, IntConLevel icl=ICL_DEF)
 Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}\geq z$.
void Gecode::atleast (Home home, const IntVarArgs &x, const IntArgs &y, IntVar z, IntConLevel icl=ICL_DEF)
 Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y_i\}\geq z$.
void Gecode::exactly (Home home, const IntVarArgs &x, int n, int m, IntConLevel icl=ICL_DEF)
 Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=n\}=m$.
void Gecode::exactly (Home home, const IntVarArgs &x, IntVar y, int m, IntConLevel icl=ICL_DEF)
 Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}=m$.
void Gecode::exactly (Home home, const IntVarArgs &x, const IntArgs &y, int m, IntConLevel icl=ICL_DEF)
 Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y_i\}=m$.
void Gecode::exactly (Home home, const IntVarArgs &x, int n, IntVar z, IntConLevel icl=ICL_DEF)
 Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=n\}=z$.
void Gecode::exactly (Home home, const IntVarArgs &x, IntVar y, IntVar z, IntConLevel icl=ICL_DEF)
 Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}=z$.
void Gecode::exactly (Home home, const IntVarArgs &x, const IntArgs &y, IntVar z, IntConLevel icl=ICL_DEF)
 Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y_i\}=z$.
void Gecode::lex (Home home, const IntVarArgs &x, IntRelType r, const IntVarArgs &y, IntConLevel icl=ICL_DEF)
 Post propagator for lexical order between x and y.
void Gecode::lex (Home home, const BoolVarArgs &x, IntRelType r, const BoolVarArgs &y, IntConLevel icl=ICL_DEF)
 Post propagator for lexical order between x and y.

Define Documentation

#define GECODE_MINIMODEL_EXPORT

Definition at line 78 of file minimodel.hh.

#define GECODE_LIBRARY_NAME   "MiniModel"

Definition at line 85 of file minimodel.hh.