Generated on Thu Feb 14 2013 20:59:49 for Gecode by doxygen 1.8.3.1
int-post.cpp File Reference

(Revision: 12388)

#include <cfloat>
#include <algorithm>
#include <gecode/int/rel.hh>
#include <gecode/int/linear.hh>

Go to the source code of this file.

Namespaces

namespace  Gecode
 Gecode toplevel namespace
 
namespace  Gecode::Int
 Finite domain integers.
 
namespace  Gecode::Int::Linear
 Linear propagators
 

Macros

#define GECODE_INT_PL_BIN(CLASS)
 Macro for posting binary special cases for linear constraints. More...
 
#define GECODE_INT_PL_TER(CLASS)
 Macro for posting ternary special cases for linear constraints. More...
 

Functions

void Gecode::Int::Linear::eliminate (Term< IntView > *t, int &n, double &d)
 Eliminate assigned views. More...
 
void Gecode::Int::Linear::rewrite (IntRelType &r, double &d, Term< IntView > *&t_p, int &n_p, Term< IntView > *&t_n, int &n_n)
 Rewrite all inequations in terms of IRT_LQ. More...
 
bool Gecode::Int::Linear::precision (Term< IntView > *t_p, int n_p, Term< IntView > *t_n, int n_n, double d)
 Decide the required precision and check for overflow. More...
 
template<class Val , class View >
void Gecode::Int::Linear::post_nary (Home home, ViewArray< View > &x, ViewArray< View > &y, IntRelType r, Val c)
 Posting n-ary propagators. More...
 
void Gecode::Int::Linear::post (Home home, Term< IntView > *t, int n, IntRelType r, int c, IntConLevel=ICL_DEF)
 Post propagator for linear constraint over integers. More...
 
template<class Val , class View >
void Gecode::Int::Linear::post_nary (Home home, ViewArray< View > &x, ViewArray< View > &y, IntRelType r, Val c, BoolView b)
 Posting reified n-ary propagators. More...
 
void Gecode::Int::Linear::post (Home home, Term< IntView > *t, int n, IntRelType r, int c, BoolView b, IntConLevel=ICL_DEF)
 Post reified propagator for linear constraint. More...
 

Macro Definition Documentation

#define GECODE_INT_PL_BIN (   CLASS)
Value:
switch (n_p) { \
case 2: \
(home,t_p[0].x,t_p[1].x,c))); \
break; \
case 1: \
(home,t_p[0].x,MinusView(t_n[0].x),c))); \
break; \
case 0: \
(home,MinusView(t_n[0].x),MinusView(t_n[1].x),c))); \
break; \
default: GECODE_NEVER; \
}

Macro for posting binary special cases for linear constraints.

Definition at line 160 of file int-post.cpp.

#define GECODE_INT_PL_TER (   CLASS)
Value:
switch (n_p) { \
case 3: \
(home,t_p[0].x,t_p[1].x,t_p[2].x,c))); \
break; \
case 2: \
(home,t_p[0].x,t_p[1].x, \
MinusView(t_n[0].x),c))); \
break; \
case 1: \
(home,t_p[0].x, \
MinusView(t_n[0].x),MinusView(t_n[1].x),c))); \
break; \
case 0: \
(home,MinusView(t_n[0].x), \
MinusView(t_n[1].x),MinusView(t_n[2].x),c))); \
break; \
default: GECODE_NEVER; \
}

Macro for posting ternary special cases for linear constraints.

Definition at line 178 of file int-post.cpp.