Generated on Thu Mar 22 10:39:48 2012 for Gecode by doxygen 1.6.3
gecode

minimodel.hh File Reference

(Revision: 12537)

#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/set-expr.hpp>
#include <gecode/minimodel/set-rel.hpp>
#include <gecode/minimodel/matrix.hpp>
#include <gecode/minimodel/optimize.hpp>

Go to the source code of this file.

Classes

class  Gecode::NonLinExpr
 Base class for non-linear expressions. More...
class  Gecode::LinExpr
 Linear expressions. More...
class  Gecode::LinRel
 Linear relations. More...
class  Gecode::SetExpr
 Set expressions More...
class  Gecode::SetExpr::Node
 Node for set expression More...
class  Gecode::SetExpr::NNF
 Node for negation normalform (NNF) More...
class  Gecode::SetCmpRel
 Comparison relation (for two-sided comparisons). More...
class  Gecode::SetRel
 Set relations More...
class  Gecode::BoolExpr
 Boolean expressions. More...
class  Gecode::BoolExpr::MiscExpr
 Miscealloneous Boolean expressions. More...
class  Gecode::BoolExpr::Node
 Node for Boolean expression More...
class  Gecode::BoolExpr::NNF
 Node for negation normalform (NNF) More...
class  Gecode::REG
 Regular expressions over integer values. More...
class  Gecode::Slice< A >
 A slice of a matrix. More...
class  Gecode::Matrix< A >
 Matrix-interface for arrays. 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 Gecode::operator+ (int, const IntVar &)
 Construct linear expression as sum of integer variable and integer.
LinExpr Gecode::operator+ (int, const BoolVar &)
 Construct linear expression as sum of Boolean variable and integer.
LinExpr Gecode::operator+ (int, const LinExpr &)
 Construct linear expression as sum of linear expression and integer.
LinExpr Gecode::operator+ (const IntVar &, int)
 Construct linear expression as sum of integer variable and integer.
LinExpr Gecode::operator+ (const BoolVar &, int)
 Construct linear expression as sum of Boolean variable and integer.
LinExpr Gecode::operator+ (const LinExpr &, int)
 Construct linear expression as sum of linear expression and integer.
LinExpr Gecode::operator+ (const IntVar &, const IntVar &)
 Construct linear expression as sum of integer variables.
LinExpr Gecode::operator+ (const IntVar &, const BoolVar &)
 Construct linear expression as sum of integer and Boolean variable.
LinExpr Gecode::operator+ (const BoolVar &, const IntVar &)
 Construct linear expression as sum of Boolean and integer variable.
LinExpr Gecode::operator+ (const BoolVar &, const BoolVar &)
 Construct linear expression as sum of Boolean variables.
LinExpr Gecode::operator+ (const IntVar &, const LinExpr &)
 Construct linear expression as sum of integer variable and linear expression.
LinExpr Gecode::operator+ (const BoolVar &, const LinExpr &)
 Construct linear expression as sum of Boolean variable and linear expression.
LinExpr Gecode::operator+ (const LinExpr &, const IntVar &)
 Construct linear expression as sum of linear expression and integer variable.
LinExpr Gecode::operator+ (const LinExpr &, const BoolVar &)
 Construct linear expression as sum of linear expression and Boolean variable.
LinExpr Gecode::operator+ (const LinExpr &, const LinExpr &)
 Construct linear expression as sum of linear expressions.
LinExpr Gecode::operator- (int, const IntVar &)
 Construct linear expression as sum of integer variable and integer.
LinExpr Gecode::operator- (int, const BoolVar &)
 Construct linear expression as sum of Boolean variable and integer.
LinExpr Gecode::operator- (int, const LinExpr &)
 Construct linear expression as sum of integer and linear expression.
LinExpr Gecode::operator- (const IntVar &, int)
 Construct linear expression as sum of integer variable and integer.
LinExpr Gecode::operator- (const BoolVar &, int)
 Construct linear expression as sum of Boolean variable and integer.
LinExpr Gecode::operator- (const LinExpr &, int)
 Construct linear expression as sum of linear expression and integer.
LinExpr Gecode::operator- (const IntVar &, const IntVar &)
 Construct linear expression as sum of integer variables.
LinExpr Gecode::operator- (const IntVar &, const BoolVar &)
 Construct linear expression as sum of integer and Boolean variable.
LinExpr Gecode::operator- (const BoolVar &, const IntVar &)
 Construct linear expression as sum of Boolean and integer variable.
LinExpr Gecode::operator- (const BoolVar &, const BoolVar &)
 Construct linear expression as sum of Boolean variables.
LinExpr Gecode::operator- (const IntVar &, const LinExpr &)
 Construct linear expression as sum of integer variable and linear expression.
LinExpr Gecode::operator- (const BoolVar &, const LinExpr &)
 Construct linear expression as sum of Boolean variable and linear expression.
LinExpr Gecode::operator- (const LinExpr &, const IntVar &)
 Construct linear expression as sum of linear expression and integer variable.
LinExpr Gecode::operator- (const LinExpr &, const BoolVar &)
 Construct linear expression as sum of linear expression and Boolean variable.
LinExpr Gecode::operator- (const LinExpr &, const LinExpr &)
 Construct linear expression as sum of linear expressions.
LinExpr Gecode::operator- (const IntVar &)
 Construct linear expression as negative of integer variable.
LinExpr Gecode::operator- (const BoolVar &)
 Construct linear expression as negative of Boolean variable.
LinExpr Gecode::operator- (const LinExpr &)
 Construct linear expression as negative of linear expression.
LinExpr Gecode::operator* (int, const IntVar &)
 Construct linear expression as product of integer coefficient and integer variable.
LinExpr Gecode::operator* (int, const BoolVar &)
 Construct linear expression as product of integer coefficient and Boolean variable.
LinExpr Gecode::operator* (const IntVar &, int)
 Construct linear expression as product of integer coefficient and integer variable.
LinExpr Gecode::operator* (const BoolVar &, int)
 Construct linear expression as product of integer coefficient and Boolean variable.
LinExpr Gecode::operator* (const LinExpr &, int)
 Construct linear expression as product of integer coefficient and linear expression.
LinExpr Gecode::operator* (int, const LinExpr &)
 Construct linear expression as product of integer coefficient and linear expression.
LinExpr Gecode::sum (const IntVarArgs &x)
 Construct linear expression as sum of integer variables.
LinExpr Gecode::sum (const IntArgs &a, const IntVarArgs &x)
 Construct linear expression as sum of integer variables with coefficients.
LinExpr Gecode::sum (const BoolVarArgs &x)
 Construct linear expression as sum of Boolean variables.
LinExpr Gecode::sum (const IntArgs &a, const BoolVarArgs &x)
 Construct linear expression as sum of Boolean variables with coefficients.
LinRel Gecode::operator== (int l, const IntVar &r)
 Construct linear equality relation.
LinRel Gecode::operator== (int l, const BoolVar &r)
 Construct linear equality relation.
LinRel Gecode::operator== (int l, const LinExpr &r)
 Construct linear equality relation.
LinRel Gecode::operator== (const IntVar &l, int r)
 Construct linear equality relation.
LinRel Gecode::operator== (const BoolVar &l, int r)
 Construct linear equality relation.
LinRel Gecode::operator== (const LinExpr &l, int r)
 Construct linear equality relation.
LinRel Gecode::operator== (const IntVar &l, const IntVar &r)
 Construct linear equality relation.
LinRel Gecode::operator== (const IntVar &l, const BoolVar &r)
 Construct linear equality relation.
LinRel Gecode::operator== (const BoolVar &l, const IntVar &r)
 Construct linear equality relation.
LinRel Gecode::operator== (const BoolVar &l, const BoolVar &r)
 Construct linear equality relation.
LinRel Gecode::operator== (const IntVar &l, const LinExpr &r)
 Construct linear equality relation.
LinRel Gecode::operator== (const BoolVar &l, const LinExpr &r)
 Construct linear equality relation.
LinRel Gecode::operator== (const LinExpr &l, const IntVar &r)
 Construct linear equality relation.
LinRel Gecode::operator== (const LinExpr &l, const BoolVar &r)
 Construct linear equality relation.
LinRel Gecode::operator== (const LinExpr &l, const LinExpr &r)
 Construct linear equality relation.
LinRel Gecode::operator!= (int l, const IntVar &r)
 Construct linear disequality relation.
LinRel Gecode::operator!= (int l, const BoolVar &r)
 Construct linear disequality relation.
LinRel Gecode::operator!= (int l, const LinExpr &r)
 Construct linear disequality relation.
LinRel Gecode::operator!= (const IntVar &l, int r)
 Construct linear disequality relation.
LinRel Gecode::operator!= (const BoolVar &l, int r)
 Construct linear disequality relation.
LinRel Gecode::operator!= (const LinExpr &l, int r)
 Construct linear disequality relation.
LinRel Gecode::operator!= (const IntVar &l, const IntVar &r)
 Construct linear disequality relation.
LinRel Gecode::operator!= (const IntVar &l, const BoolVar &r)
 Construct linear disequality relation.
LinRel Gecode::operator!= (const BoolVar &l, const IntVar &r)
 Construct linear disequality relation.
LinRel Gecode::operator!= (const BoolVar &l, const BoolVar &r)
 Construct linear disequality relation.
LinRel Gecode::operator!= (const IntVar &l, const LinExpr &r)
 Construct linear disequality relation.
LinRel Gecode::operator!= (const BoolVar &l, const LinExpr &r)
 Construct linear disequality relation.
LinRel Gecode::operator!= (const LinExpr &l, const IntVar &r)
 Construct linear disequality relation.
LinRel Gecode::operator!= (const LinExpr &l, const BoolVar &r)
 Construct linear disequality relation.
LinRel Gecode::operator!= (const LinExpr &l, const LinExpr &r)
 Construct linear disequality relation.
LinRel Gecode::operator< (int l, const IntVar &r)
 Construct linear inequality relation.
LinRel Gecode::operator< (int l, const BoolVar &r)
 Construct linear inequality relation.
LinRel Gecode::operator< (int l, const LinExpr &r)
 Construct linear inequality relation.
LinRel Gecode::operator< (const IntVar &l, int r)
 Construct linear inequality relation.
LinRel Gecode::operator< (const BoolVar &l, int r)
 Construct linear inequality relation.
LinRel Gecode::operator< (const LinExpr &l, int r)
 Construct linear inequality relation.
LinRel Gecode::operator< (const IntVar &l, const IntVar &r)
 Construct linear inequality relation.
LinRel Gecode::operator< (const IntVar &l, const BoolVar &r)
 Construct linear inequality relation.
LinRel Gecode::operator< (const BoolVar &l, const IntVar &r)
 Construct linear inequality relation.
LinRel Gecode::operator< (const BoolVar &l, const BoolVar &r)
 Construct linear inequality relation.
LinRel Gecode::operator< (const IntVar &l, const LinExpr &r)
 Construct linear inequality relation.
LinRel Gecode::operator< (const BoolVar &l, const LinExpr &r)
 Construct linear inequality relation.
LinRel Gecode::operator< (const LinExpr &l, const IntVar &r)
 Construct linear inequality relation.
LinRel Gecode::operator< (const LinExpr &l, const BoolVar &r)
 Construct linear inequality relation.
LinRel Gecode::operator< (const LinExpr &l, const LinExpr &r)
 Construct linear inequality relation.
LinRel Gecode::operator<= (int l, const IntVar &r)
 Construct linear inequality relation.
LinRel Gecode::operator<= (int l, const BoolVar &r)
 Construct linear inequality relation.
LinRel Gecode::operator<= (int l, const LinExpr &r)
 Construct linear inequality relation.
LinRel Gecode::operator<= (const IntVar &l, int r)
 Construct linear inequality relation.
LinRel Gecode::operator<= (const BoolVar &l, int r)
 Construct linear inequality relation.
LinRel Gecode::operator<= (const LinExpr &l, int r)
 Construct linear inequality relation.
LinRel Gecode::operator<= (const IntVar &l, const IntVar &r)
 Construct linear inequality relation.
LinRel Gecode::operator<= (const IntVar &l, const BoolVar &r)
 Construct linear inequality relation.
LinRel Gecode::operator<= (const BoolVar &l, const IntVar &r)
 Construct linear inequality relation.
LinRel Gecode::operator<= (const BoolVar &l, const BoolVar &r)
 Construct linear inequality relation.
LinRel Gecode::operator<= (const IntVar &l, const LinExpr &r)
 Construct linear inequality relation.
LinRel Gecode::operator<= (const BoolVar &l, const LinExpr &r)
 Construct linear inequality relation.
LinRel Gecode::operator<= (const LinExpr &l, const IntVar &r)
 Construct linear inequality relation.
LinRel Gecode::operator<= (const LinExpr &l, const BoolVar &r)
 Construct linear inequality relation.
LinRel Gecode::operator<= (const LinExpr &l, const LinExpr &r)
 Construct linear inequality relation.
LinRel Gecode::operator> (int l, const IntVar &r)
 Construct linear inequality relation.
LinRel Gecode::operator> (int l, const BoolVar &r)
 Construct linear inequality relation.
LinRel Gecode::operator> (int l, const LinExpr &r)
 Construct linear inequality relation.
LinRel Gecode::operator> (const IntVar &l, int r)
 Construct linear inequality relation.
LinRel Gecode::operator> (const BoolVar &l, int r)
 Construct linear inequality relation.
LinRel Gecode::operator> (const LinExpr &l, int r)
 Construct linear inequality relation.
LinRel Gecode::operator> (const IntVar &l, const IntVar &r)
 Construct linear inequality relation.
LinRel Gecode::operator> (const IntVar &l, const BoolVar &r)
 Construct linear inequality relation.
LinRel Gecode::operator> (const BoolVar &l, const IntVar &r)
 Construct linear inequality relation.
LinRel Gecode::operator> (const BoolVar &l, const BoolVar &r)
 Construct linear inequality relation.
LinRel Gecode::operator> (const IntVar &l, const LinExpr &r)
 Construct linear inequality relation.
LinRel Gecode::operator> (const BoolVar &l, const LinExpr &r)
 Construct linear inequality relation.
LinRel Gecode::operator> (const LinExpr &l, const IntVar &r)
 Construct linear inequality relation.
LinRel Gecode::operator> (const LinExpr &l, const BoolVar &r)
 Construct linear inequality relation.
LinRel Gecode::operator> (const LinExpr &l, const LinExpr &r)
 Construct linear inequality relation.
LinRel Gecode::operator>= (int l, const IntVar &r)
 Construct linear inequality relation.
LinRel Gecode::operator>= (int l, const BoolVar &r)
 Construct linear inequality relation.
LinRel Gecode::operator>= (int l, const LinExpr &r)
 Construct linear inequality relation.
LinRel Gecode::operator>= (const IntVar &l, int r)
 Construct linear inequality relation.
LinRel Gecode::operator>= (const BoolVar &l, int r)
 Construct linear inequality relation.
LinRel Gecode::operator>= (const LinExpr &l, int r)
 Construct linear inequality relation.
LinRel Gecode::operator>= (const IntVar &l, const IntVar &r)
 Construct linear inequality relation.
LinRel Gecode::operator>= (const IntVar &l, const BoolVar &r)
 Construct linear inequality relation.
LinRel Gecode::operator>= (const BoolVar &l, const IntVar &r)
 Construct linear inequality relation.
LinRel Gecode::operator>= (const BoolVar &l, const BoolVar &r)
 Construct linear inequality relation.
LinRel Gecode::operator>= (const IntVar &l, const LinExpr &r)
 Construct linear inequality relation.
LinRel Gecode::operator>= (const BoolVar &l, const LinExpr &r)
 Construct linear inequality relation.
LinRel Gecode::operator>= (const LinExpr &l, const IntVar &r)
 Construct linear inequality relation.
LinRel Gecode::operator>= (const LinExpr &l, const BoolVar &r)
 Construct linear inequality relation.
LinRel Gecode::operator>= (const LinExpr &l, const LinExpr &r)
 Construct linear inequality relation.
SetExpr Gecode::singleton (const LinExpr &)
 Singleton expression.
SetExpr Gecode::operator- (const SetExpr &)
 Complement expression.
SetExpr Gecode::operator& (const SetExpr &, const SetExpr &)
 Intersection of set expressions.
SetExpr Gecode::operator| (const SetExpr &, const SetExpr &)
 Union of set expressions.
SetExpr Gecode::operator+ (const SetExpr &, const SetExpr &)
 Disjoint union of set expressions.
SetExpr Gecode::operator- (const SetExpr &, const SetExpr &)
 Difference of set expressions.
SetExpr Gecode::inter (const SetVarArgs &)
 Intersection of set variables.
SetExpr Gecode::setunion (const SetVarArgs &)
 Union of set variables.
SetExpr Gecode::setdunion (const SetVarArgs &)
 Disjoint union of set variables.
LinExpr Gecode::cardinality (const SetExpr &)
 Cardinality of set expression.
LinExpr Gecode::min (const SetExpr &)
 Minimum element of set expression.
LinExpr Gecode::max (const SetExpr &)
 Minimum element of set expression.
SetRel Gecode::operator== (const SetExpr &, const SetExpr &)
 Equality of set expressions.
SetRel Gecode::operator!= (const SetExpr &, const SetExpr &)
 Disequality of set expressions.
SetCmpRel Gecode::operator<= (const SetExpr &, const SetExpr &)
 Subset of set expressions.
BoolExpr Gecode::operator<= (const SetCmpRel &, const SetExpr &)
 Subset of set expressions.
SetCmpRel Gecode::operator>= (const SetExpr &, const SetExpr &)
 Superset of set expressions.
BoolExpr Gecode::operator>= (const SetCmpRel &, const SetExpr &)
 Superset of set expressions.
SetRel Gecode::operator|| (const SetExpr &, const SetExpr &)
 Disjointness of set expressions.
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.
BoolExpr Gecode::operator!= (const BoolExpr &, const BoolExpr &)
 Non-equivalence of Boolean expressions.
BoolExpr Gecode::operator== (const BoolExpr &, const BoolExpr &)
 Equivalence of Boolean expressions.
BoolExpr Gecode::operator>> (const BoolExpr &, const BoolExpr &)
 Implication of Boolean expressions.
BoolExpr Gecode::operator<< (const BoolExpr &, const BoolExpr &)
 Reverse implication of Boolean expressions.
IntVar Gecode::expr (Home home, const LinExpr &e, IntConLevel icl=ICL_DEF)
 Post linear expression and return its value.
SetVar Gecode::expr (Home home, const SetExpr &e)
 Post set expression and return its value.
BoolVar Gecode::expr (Home home, const BoolExpr &e, IntConLevel icl=ICL_DEF)
 Post Boolean expression and return its value.
void Gecode::rel (Home home, const BoolExpr &e, IntConLevel icl=ICL_DEF)
 Post Boolean relation.
LinExpr Gecode::abs (const LinExpr &e)
 Return expression for $|e|$.
LinExpr Gecode::min (const LinExpr &x, const LinExpr &y)
 Return expression for $\min(x,y)$.
LinExpr Gecode::min (const IntVarArgs &x)
 Return expression for $\min(x)$.
LinExpr Gecode::max (const LinExpr &x, const LinExpr &y)
 Return expression for $\max(x,y)$.
LinExpr Gecode::max (const IntVarArgs &x)
 Return expression for $\max(x)$.
LinExpr Gecode::operator* (const LinExpr &x, const LinExpr &y)
 Return expression for $x\cdot y$.
LinExpr Gecode::operator/ (const LinExpr &x, const LinExpr &y)
 Return expression for $x\ \mathrm{div}\ y$.
LinExpr Gecode::operator% (const LinExpr &x, const LinExpr &y)
 Return expression for $x\ \mathrm{mod}\ y$.
LinExpr Gecode::sqr (const LinExpr &x)
 Return expression for $x^2$.
LinExpr Gecode::sqrt (const LinExpr &x)
 Return expression for $\lfloor\sqrt{x}\rfloor$.
LinExpr Gecode::element (const IntVarArgs &x, const LinExpr &y)
 Return expression for $x[y]$.
BoolExpr Gecode::element (const BoolVarArgs &x, const LinExpr &y)
 Return expression for $x[y]$.
LinExpr Gecode::element (const IntArgs &x, const LinExpr &y)
 Return expression for $x[y]$.
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$.
SetVar Gecode::channel (Home home, const IntVarArgs &x, IntConLevel icl=ICL_DEF)
 Return set variable equal to $\{x_0,\dots,x_{n-1}\}$.
void Gecode::atmost (Home home, const IntVarArgs &x, int n, int m, IntConLevel icl=ICL_DEF)
 Post constraint $\#\{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 constraint $\#\{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 constraint $\#\{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 constraint $\#\{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 constraint $\#\{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 constraint $\#\{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 constraint $\#\{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 constraint $\#\{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 constraint $\#\{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 constraint $\#\{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 constraint $\#\{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 constraint $\#\{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 constraint $\#\{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 constraint $\#\{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 constraint $\#\{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 constraint $\#\{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 constraint $\#\{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 constraint $\#\{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 lexical order between x and y.
void Gecode::lex (Home home, const BoolVarArgs &x, IntRelType r, const BoolVarArgs &y, IntConLevel icl=ICL_DEF)
 Post lexical order between x and y.
void Gecode::values (Home home, const IntVarArgs &x, IntSet y, IntConLevel icl=ICL_DEF)
 Post constraint $\{x_0,\dots,x_{n-1}\}=y$.
void Gecode::channel (Home home, const IntVarArgs &x, SetVar y)
 Post constraint $\{x_0,\dots,x_{n-1}\}=y$.
void Gecode::range (Home home, const IntVarArgs &x, SetVar y, SetVar z)
 Post constraint $\bigcup_{i\in y}\{x_i\}=z$.
void Gecode::roots (Home home, const IntVarArgs &x, SetVar y, SetVar z)
 Post constraint $\bigcup_{i\in z}\{j\ |\ x_j=i\}=z$.
template<class A >
Slice< A >::ArgsType Gecode::operator+ (const Slice< A > &x, const Slice< A > &y)
 Concatenate x and y.
template<class A >
Slice< A >::ArgsType Gecode::operator+ (const Slice< A > &x, const typename ArrayTraits< A >::ArgsType &y)
 Concatenate x and y.
template<class A >
Slice< A >::ArgsType Gecode::operator+ (const typename ArrayTraits< A >::ArgsType &x, const Slice< A > &y)
 Concatenate x and y.
template<class A >
Slice< A >::ArgsType Gecode::operator+ (const Slice< A > &x, const typename ArrayTraits< A >::ValueType &y)
 Concatenate x and y.
template<class A >
Slice< A >::ArgsType Gecode::operator+ (const typename ArrayTraits< A >::ValueType &x, const Slice< A > &y)
 Concatenate 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.