Go to the documentation of this file.
126 ::
post(home,x0,x1,
r.var())));
130 ::
post(home,x0,x1,
r.var())));
134 ::
post(home,x0,x1,
r.var())));
145 ::
post(home,x0,x1,nr)));
149 ::
post(home,x0,x1,nr)));
153 ::
post(home,x0,x1,nr)));
167 ::
post(home,n0,x1,
r.var())));
172 ::
post(home,x0,x1,
r.var())));
176 ::
post(home,x0,x1,
r.var())));
191 ::
post(home,n0,x1,nr)));
196 ::
post(home,x0,x1,nr)));
200 ::
post(home,x0,x1,nr)));
234 ::
post(home,nx,ny)));
309 ::
post(home,nx,ny)));
380 for (
int i=
x.size();
i--; ) {
388 for (
int i=
x.size();
i--; ) {
395 for (
int i=
x.size();
i--; ) {
400 for (
int i=
x.size();
i--; ) {
405 for (
int i=
x.size();
i--; ) {
410 for (
int i=
x.size();
i--; ) {
428 for (
int i=
x.size();
i--; ) {
434 for (
int i=
x.size();
i--; ) {
449 for (
int i=
x.size();
i--; ) {
455 for (
int i=
x.size();
i--; ) {
475 if ((irt !=
IRT_NQ) && (
x.size() < 2))
514 for (
int i=
x.size();
i--; )
515 y[
i] =
x[
x.size()-1-
i];
518 for (
int i=
x.size()-1;
i--; )
537 ::
post(home,yv,xv,
true)));
544 ::
post(home,xv,yv,
true)));
551 ::
post(home,yv,xv,
false)));
558 ::
post(home,xv,yv,
false)));
562 for (
int i=
x.size();
i--; ) {
571 ::
post(home,xv,yv)));
582 ViewArray<Int::ConstIntView>
583 viewarray(Space& home,
const IntArgs&
x) {
584 ViewArray<Int::ConstIntView> xv(home,
x.size());
585 for (
int i =
x.size();
i--; ) {
586 if ((
x[
i] != 0) && (
x[
i] != 1))
587 throw Int::NotZeroOne(
"Int::rel");
588 xv[
i] = Int::ConstIntView(
x[
i]);
607 ::
post(home,yv,xv,
true)));
615 ::
post(home,xv,yv,
true)));
623 ::
post(home,yv,xv,
false)));
631 ::
post(home,xv,yv,
false)));
635 if (
x.size() !=
y.size()) {
638 for (
int i=
x.size();
i--; )
647 ::
post(home,xv,yv)));
658 rel(home,
y,irt,
x,ipl);
671 ::
post(home,n0,n1,n2)));
676 ::
post(home,x0,x1,x2)));
682 ::
post(home,n0,x1,x2)));
687 ::
post(home,x0,x1,x2)));
693 ::
post(home,x0,x1,n2)));
712 ::
post(home,n0,n1)));
757 ::
post(home,n0,x1)));
788 for (
int i=m;
i--; ) {
809 for (
int i=
x.size()-1;
i--; )
820 for (
int i=
x.size();
i--; )
829 for (
int i=
x.size();
i--; )
844 if ((
n < 0) || (
n > 1))
853 for (
int i=m;
i--; ) {
859 for (
int i=m;
i--; ) {
866 for (
int i=m;
i--; ) {
879 for (
int i=m-1;
i--; )
884 for (
int i=
x.size()-1;
i--; )
913 if ((
n < 0) || (
n > 1))
920 for (
int i=
x.size();
i--; ) {
926 ::
post(home,xv,yv)));
928 for (
int i=
x.size();
i--; ) {
931 for (
int i=
y.size();
i--; ) {
938 for (
int i=
x.size();
i--; ) {
941 for (
int i=
y.size();
i--; ) {
947 for (
int i=
y.size();
i--; ) {
952 ::
post(home,xv,yv)));
969 for (
int i=
x.size();
i--; ) {
976 ::
post(home,xv,yv,nz)));
983 for (
int i=
y.size();
i--; ) {
988 ::
post(home,xv,yv,
z)));
1013 using namespace Int;
Exception: Unknown reification mode passed as argument
Lexical ordering propagator.
Post propagator for SetVar x
IntRelType
Relation types for integers.
bool zero(void) const
Test whether view is assigned to be zero.
Post propagator for SetVar SetOpType SetVar y
@ RM_PMI
Inverse implication for reification.
#define GECODE_ES_FAIL(es)
Check whether execution status es is failed, and fail space home.
If-then-else bounds-consistent propagator.
@ IRT_GQ
Greater or equal ( )
Exception: Unknown operation passed as argument
Post propagator for SetVar SetOpType SetVar SetRelType SetVar z
Gecode::IntArgs i(4, 1, 2, 3, 4)
@ RM_IMP
Implication for reification.
bool one(void) const
Test whether view is assigned to be one.
IntPropLevel
Propagation levels for integer propagators.
Boolean view for Boolean variables.
Exception: Not 0/1 integer
Gecode toplevel namespace
IntPropLevel vbd(IntPropLevel ipl)
Extract value, bounds, or domain propagation from propagation level.
Reified binary bounds consistent equality propagator.
Boolean clause propagator (disjunctive, true)
BoolOpType
Operation types for Booleans.
Reification specification.
Passing Boolean variables.
Boolean disjunction propagator.
@ RM_EQV
Equivalence for reification (default)
Home class for posting propagators
struct Gecode::@579::NNF::@61::@63 a
For atomic nodes.
struct Gecode::@579::NNF::@61::@62 b
For binary nodes (and, or, eqv)
Nary disequality propagator.
Exception: Illegal operation passed as argument
Boolean n-ary disjunction propagator.
Reified less or equal propagator.
Post propagator for SetVar SetOpType SetVar SetRelType r
Boolean integer variables.
Boolean equality propagator.
TFE post(PropagatorGroup g)
Only post functions (but not propagators) from g are considered.
IntRelType swap(IntRelType irt)
Return swapped relation type of irt.
Binary Boolean disjunction propagator (true)
Lexical disequality propagator.
bool one(const Gecode::FloatValArgs &a)
Check whether has only one coefficients.
n-ary Boolean equality propagator
Boolean less or equal propagator.
@ IPL_BND
Bounds propagation.
Boolean clause propagator (disjunctive)
static ExecStatus post(Home home, ViewArray< BoolView > &x, int pm2)
Post propagator .
Nary Boolean less or equal propagator.
Boolean n-ary disjunction propagator (true)
void rel(Home home, FloatVar x0, FloatRelType frt, FloatVal n)
Propagates .
void fail(void)
Mark space as failed.
#define GECODE_POST
Check for failure in a constraint post function.
void unique(const Space &home)
Remove all duplicate views from array (changes element order)
Boolean equivalence propagator.
If-then-else domain-consistent propagator.
#define GECODE_ME_FAIL(me)
Check whether modification event me 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.
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...
Exception: Unknown relation passed as argument
int n
Number of negative literals for node type.
Passing integer arguments.
Exception: Too few arguments available in argument array
@ IRT_LQ
Less or equal ( )