42 #ifdef GECODE_HAS_SET_VARS 78 static void*
operator new(
size_t size);
80 static void operator delete(
void*
p,
size_t size);
90 SetExpr::Node::operator
new(
size_t size) {
94 SetExpr::Node::operator
delete(
void*
p, size_t) {
140 static NNF* nnf(Region&
r, Node* n,
bool neg);
142 void post(Home home, NodeType t, SetVarArgs&
b,
int&
i)
const;
153 static void*
operator new(
size_t s, Region&
r);
155 static void operator delete(
void*);
157 static void operator delete(
void*, Region&);
165 NNF::operator
delete(
void*) {}
168 NNF::operator
delete(
void*, Region&) {}
171 NNF::operator
new(
size_t s, Region&
r) {
191 rel(home,
u.a.x->x, srt, bc);
195 rel(home,
u.a.x->x, srt, s);
201 IntSetRanges sr(
u.a.x->s);
202 Set::RangesCompl<IntSetRanges> src(sr);
212 dom(home, s, srt, ss);
217 IntVar iv =
u.a.x->e.post(home,
ICL_DEF);
242 rel(home, bc, srt, s);
261 rel(home, bc, srt, s);
298 rel(home, br, srt, bc);
309 rel(home, br, srt, s);
336 rel(home,
u.a.x->x, srt, bc, b);
340 rel(home,
u.a.x->x, srt, s, b);
346 IntSetRanges sr(
u.a.x->s);
347 Set::RangesCompl<IntSetRanges> src(sr);
370 dom(home, s, invsrt, ss, b);
375 IntVar iv =
u.a.x->e.post(home,
ICL_DEF);
380 rel(home,ic,srt,s,b);
382 rel(home,iv,srt,s,b);
393 rel(home, br, srt, s, b);
404 rel(home, br, srt, s, b);
424 rel(home, br, srt, bc);
431 rel(home, br, srt, s, b);
464 u.b.l->post(home, t, b, i);
465 u.b.r->post(home, t, b, i);
472 post(home,srt,n->u.a.x->x);
478 default: n_srt = srt;
480 n->post(home,n_srt,
this);
494 post(home,srt,n->u.a.x->x,b);
500 default: n_srt = srt;
502 n->post(home,b,
true,n_srt,
this);
509 }
else if (srt ==
SRT_EQ) {
511 }
else if (srt ==
SRT_NQ) {
514 BoolVar nb(home,0,1);
516 post(home,nb,
true,srt,n);
521 NNF::nnf(Region&
r,
Node* n,
bool neg) {
527 NNF*
x =
new (
r) NNF;
528 x->t = n->t; x->neg =
neg; x->u.a.x = n;
537 return nnf(r,n->l,!neg);
544 t = n->t; xneg =
neg; neg =
false;
550 NNF* x =
new (
r) NNF;
553 x->u.b.l = nnf(r,n->l,neg);
554 x->u.b.r = nnf(r,n->r,neg);
557 p_l=x->u.b.l->p; n_l=x->u.b.l->n;
563 p_r=x->u.b.r->p; n_r=x->u.b.r->n;
634 if (n != NULL && n->decrement())
643 if (n != NULL && n->decrement())
656 NNF::nnf(r,n,
false)->post(home,
SRT_EQ,s);
663 return NNF::nnf(r,n,
false)->post(home,srt,NNF::nnf(r,e.n,
false));
669 return NNF::nnf(r,n,
false)->post(home,b,t,srt,
670 NNF::nnf(r,e.n,
false));
703 for (
int i=1; i<x.
size(); i++)
712 for (
int i=1; i<x.
size(); i++)
721 for (
int i=1; i<x.
size(); i++)
726 namespace MiniModel {
743 IntVar m = result(home,ret);
762 if (t==SNLE_CARD && irt!=
IRT_NQ) {
767 static_cast<unsigned int>(
c));
772 static_cast<unsigned int>(c-1));
776 static_cast<unsigned int>(
c),
781 static_cast<unsigned int>(c+1),
786 static_cast<unsigned int>(
c),
787 static_cast<unsigned int>(c));
792 }
else if (t==SNLE_MIN && (irt==
IRT_GR || irt==
IRT_GQ)) {
793 c = (irt==
IRT_GQ ? c : c+1);
795 }
else if (t==SNLE_MAX && (irt==
IRT_LE || irt==
IRT_LQ)) {
796 c = (irt==
IRT_LQ ? c : c-1);
799 rel(home,
post(home,NULL,icl), irt, c);
805 c = (irt==
IRT_GQ ? c : c+1);
807 }
else if (t==SNLE_MAX && (irt==
IRT_LE || irt==
IRT_LQ)) {
808 c = (irt==
IRT_LQ ? c : c-1);
811 rel(home,
post(home,NULL,icl), irt, c, b);
union Gecode::@536::NNF::@66 u
Union depending on nodetype t.
bool failed(void) const
Check whether corresponding space is failed.
FloatVal operator-(const FloatVal &x)
int same
Number of variables in subtree with same type (for INTER and UNION)
SetExpr singleton(const LinIntExpr &e)
Singleton expression.
SetRelType
Common relation types for sets.
IntConLevel
Consistency levels for integer propagators.
const SetExpr & operator=(const SetExpr &e)
Assignment operator.
SetExpr operator&(const SetExpr &l, const SetExpr &r)
Intersection of set expressions.
void post(Home home, Term *t, int n, FloatRelType frt, FloatVal c)
Post propagator for linear constraint over floats.
const int min
Smallest allowed integer in integer set.
void rfree(void *p)
Free memory block starting at p.
int size(void) const
Return size of array (number of elements)
LinIntExpr e
Possibly a linear expression.
bool neg
Is formula negative.
void max(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
virtual IntVar post(Home home, IntVar *ret, IntConLevel) const
Post expression.
void dom(Home home, FloatVar x, FloatVal n)
Propagates .
Base class for non-linear expressions over integer variables.
void * ralloc(size_t s)
Allocate s bytes from heap.
SetVar x
Possibly a variable.
struct Gecode::@536::NNF::@66::@67 b
For binary nodes (and, or, eqv)
virtual void post(Home home, IntRelType irt, int c, BoolVar b, IntConLevel icl) const
Post reified expression to be in relation irt with c.
const unsigned int card
Maximum cardinality of an integer set.
const int max
Largest allowed integer in integer set.
Heap heap
The single global heap.
SetExpr setdunion(const SetVarArgs &x)
Disjoint union of set variables.
Gecode::FloatVal c(-8, 8)
bool same(const ConstView< ViewA > &, const ConstView< ViewB > &)
Test whether two views are the same.
Gecode::IntArgs i(4, 1, 2, 3, 4)
int n
Number of negative literals for node type.
IntSet s
Possibly a constant.
IntRelType
Relation types for integers.
FloatVal operator+(const FloatVal &x)
NodeType t
Type of expression.
SetExpr(void)
Default constructor.
unsigned int size(I &i)
Size of all ranges of range iterator i.
Node(void)
Default constructor.
virtual void post(Home home, IntRelType irt, int c, IntConLevel icl) const
Post expression to be in relation irt with c.
NodeType
Type of set expression.
SetExpr setunion(const SetVarArgs &x)
Union of set variables.
Integer valued set expressions.
Minimum element expression.
static const IntSet empty
Empty set.
Boolean integer variables.
LinIntExpr cardinality(const SetExpr &e)
Cardinality of set expression.
SetExpr inter(const SetVarArgs &x)
Intersection of set variables.
void min(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
BoolVar expr(Home home, const BoolExpr &e, IntConLevel icl)
Post Boolean expression and return its value.
Linear expressions over integer variables.
void rel(Home home, FloatVar x0, FloatRelType frt, FloatVal n)
Propagates .
The default consistency for a constraint.
unsigned int use
Nodes are reference counted.
struct Gecode::@536::NNF::@66::@68 a
For atomic nodes.
#define GECODE_MINIMODEL_EXPORT
SetExpr operator|(const SetExpr &l, const SetExpr &r)
Union of set expressions.
SetNonLinIntExprType
The expression type.
Gecode toplevel namespace
Maximum element expression.
Node * x
Pointer to corresponding Boolean expression node.
Home class for posting propagators
~SetExpr(void)
Destructor.
#define GECODE_NEVER
Assert that this command is never executed.
SetNonLinIntExpr(const SetExpr &e0, SetNonLinIntExprType t0)
Constructor.
bool decrement(void)
Decrement reference count and possibly free memory.
SetVar post(Home home) const
Post propagators for expression.
int p
Number of positive literals for node type.