141 ::
post(home,x0,x1,nr)));
145 ::
post(home,x0,x1,nr)));
149 ::
post(home,x0,x1,nr)));
187 ::
post(home,n0,x1,nr)));
192 ::
post(home,x0,x1,nr)));
196 ::
post(home,x0,x1,nr)));
230 ::
post(home,nx,ny)));
305 ::
post(home,nx,ny)));
376 for (
int i=x.
size();
i--; ) {
378 ::
post(home,x[
i],y)));
384 for (
int i=x.
size();
i--; ) {
386 ::
post(home,x[
i],n)));
391 for (
int i=x.
size();
i--; ) {
396 for (
int i=x.
size();
i--; ) {
401 for (
int i=x.
size();
i--; ) {
406 for (
int i=x.
size();
i--; ) {
424 for (
int i=x.
size();
i--; ) {
430 for (
int i=x.
size();
i--; ) {
445 for (
int i=x.
size();
i--; ) {
451 for (
int i=x.
size();
i--; ) {
510 for (
int i=x.
size();
i--; )
514 for (
int i=x.
size()-1;
i--; )
533 ::
post(home,yv,xv,
true)));
540 ::
post(home,xv,yv,
true)));
547 ::
post(home,yv,xv,
false)));
554 ::
post(home,xv,yv,
false)));
558 for (
int i=x.
size();
i--; ) {
560 ::
post(home,x[
i],y[i])));
567 ::
post(home,xv,yv)));
581 for (
int i = x.
size();
i--; ) {
582 if ((x[
i] != 0) && (x[
i] != 1))
603 ::
post(home,yv,xv,
true)));
611 ::
post(home,xv,yv,
true)));
619 ::
post(home,yv,xv,
false)));
627 ::
post(home,xv,yv,
false)));
634 for (
int i=x.
size();
i--; )
643 ::
post(home,xv,yv)));
654 rel(home,y,irt,x,ipl);
667 ::
post(home,n0,n1,n2)));
672 ::
post(home,x0,x1,x2)));
678 ::
post(home,n0,x1,x2)));
683 ::
post(home,x0,x1,x2)));
689 ::
post(home,x0,x1,n2)));
708 ::
post(home,n0,n1)));
753 ::
post(home,n0,x1)));
784 for (
int i=m;
i--; ) {
805 for (
int i=x.
size()-1;
i--; )
810 ::
post(home,b,
a,y)));
816 for (
int i=x.
size();
i--; )
825 for (
int i=x.
size();
i--; )
840 if ((n < 0) || (n > 1))
849 for (
int i=m;
i--; ) {
855 for (
int i=m;
i--; ) {
862 for (
int i=m;
i--; ) {
875 for (
int i=m-1;
i--; )
880 for (
int i=x.
size()-1;
i--; )
909 if ((n < 0) || (n > 1))
916 for (
int i=x.
size();
i--; ) {
922 ::
post(home,xv,yv)));
924 for (
int i=x.
size();
i--; ) {
927 for (
int i=y.
size();
i--; ) {
934 for (
int i=x.
size();
i--; ) {
937 for (
int i=y.
size();
i--; ) {
943 for (
int i=y.
size();
i--; ) {
948 ::
post(home,xv,yv)));
965 for (
int i=x.
size();
i--; ) {
972 ::
post(home,xv,yv,nz)));
979 for (
int i=y.
size();
i--; ) {
984 ::
post(home,xv,yv,z)));
999 ::
post(home,b,x,y,z)));
1002 ::
post(home,b,x,y,z)));
1009 using namespace Int;
1012 ::
post(home,b,x,y,z)));
If-then-else bounds-consistent propagator.
IntPropLevel vbd(IntPropLevel ipl)
Extract value, bounds, or domain propagation from propagation level.
bool zero(void) const
Test whether view is assigned to be zero.
Inverse implication for reification.
int size(void) const
Return size of array (number of elements)
Boolean clause propagator (disjunctive, true)
ReifyMode mode(void) const
Return reification mode.
bool one(const Gecode::FloatValArgs &a)
Check whether has only one coefficients.
BoolOpType
Operation types for Booleans.
bool one(void) const
Test whether view is assigned to be one.
Exception: Too few arguments available in argument array
Exception: Unknown operation passed as argument
Lexical disequality propagator.
Boolean clause propagator (disjunctive)
static ExecStatus post(Home home, ViewArray< BoolView > &x, int pm2)
Post propagator .
ModEvent eq(Space &home, int n)
Restrict domain values to be equal to n.
Reified less or equal propagator.
Nary disequality propagator.
Exception: Unknown relation passed as argument
Gecode::IntArgs i(4, 1, 2, 3, 4)
int n
Number of negative literals for node type.
n-ary Boolean equality propagator
Boolean equivalence propagator.
IntRelType
Relation types for integers.
Exception: Illegal operation passed as argument
Boolean disjunction propagator.
Reification specification.
Reified binary bounds consistent equality propagator.
Boolean equality propagator.
Post propagator for SetVar SetOpType SetVar SetRelType SetVar z
Passing integer arguments.
Passing Boolean variables.
Boolean less or equal propagator.
Boolean integer variables.
Post propagator for SetVar SetOpType SetVar SetRelType r
If-then-else domain-consistent propagator.
Boolean n-ary disjunction propagator (true)
IntPropLevel
Propagation levels for integer propagators.
struct Gecode::@585::NNF::@62::@63 b
For binary nodes (and, or, eqv)
Post propagator for SetVar SetOpType SetVar y
Nary Boolean less or equal propagator.
struct Gecode::@585::NNF::@62::@64 a
For atomic nodes.
Lexical ordering propagator.
Boolean n-ary disjunction propagator.
Binary Boolean disjunction propagator (true)
void rel(Home home, FloatVar x0, FloatRelType frt, FloatVal n)
Propagates .
BoolVar var(void) const
Return Boolean control variable.
Post propagator for SetVar x
Exception: Not 0/1 integer
void unique(void)
Remove all duplicate views from array (changes element order)
#define GECODE_ME_FAIL(me)
Check whether modification event me is failed, and fail space home.
void fail(void)
Mark space as failed.
Exception: Unknown reification mode passed as argument
Gecode toplevel namespace
Implication for reification.
#define GECODE_POST
Check for failure in a constraint post function.
Home class for posting propagators
#define GECODE_ES_FAIL(es)
Check whether execution status es is failed, and fail space home.
void ite(Home home, BoolVar b, FloatVar x, FloatVar y, FloatVar z)
Post propagator for if-then-else constraint.
TFE post(PropagatorGroup g)
Only post functions (but not propagators) from g are considered.
void clause(Home home, BoolOpType o, const BoolVarArgs &x, const BoolVarArgs &y, int n, IntPropLevel)
Post domain consistent propagator for Boolean clause with positive variables x and negative variables...
Equivalence for reification (default)
IntRelType swap(IntRelType irt)
Return swapped relation type of irt.
Boolean view for Boolean variables.