38 #ifdef GECODE_HAS_SET_VARS 74 static void*
operator new(
size_t size);
76 static void operator delete(
void*
p,
size_t size);
86 SetExpr::Node::operator
new(
size_t size) {
90 SetExpr::Node::operator
delete(
void*
p, size_t) {
136 static NNF* nnf(Region&
r, Node* n,
bool neg);
138 void post(Home home, NodeType t, SetVarArgs&
b,
int&
i)
const;
149 static void*
operator new(
size_t s, Region&
r);
151 static void operator delete(
void*);
153 static void operator delete(
void*, Region&);
161 NNF::operator
delete(
void*) {}
164 NNF::operator
delete(
void*, Region&) {}
167 NNF::operator
new(
size_t s, Region&
r) {
187 rel(home,
u.a.x->x, srt, bc);
191 rel(home,
u.a.x->x, srt, s);
197 IntSetRanges sr(
u.a.x->s);
198 Set::RangesCompl<IntSetRanges> src(sr);
208 dom(home, s, srt, ss);
213 IntVar iv =
u.a.x->e.post(home,
IPL_DEF);
238 rel(home, bc, srt, s);
257 rel(home, bc, srt, s);
294 rel(home, br, srt, bc);
305 rel(home, br, srt, s);
332 rel(home,
u.a.x->x, srt, bc, b);
336 rel(home,
u.a.x->x, srt, s, b);
342 IntSetRanges sr(
u.a.x->s);
343 Set::RangesCompl<IntSetRanges> src(sr);
366 dom(home, s, invsrt, ss, b);
371 IntVar iv =
u.a.x->e.post(home,
IPL_DEF);
376 rel(home,ic,srt,s,b);
378 rel(home,iv,srt,s,b);
390 rel(home, br, srt, s, b);
401 rel(home, br, srt, s, b);
421 rel(home, br, srt, bc);
428 rel(home, br, srt, s, b);
461 u.b.l->post(home, t, b, i);
462 u.b.r->post(home, t, b, i);
469 post(home,srt,n->u.a.x->x);
475 default: n_srt = srt;
477 n->post(home,n_srt,
this);
491 post(home,srt,n->u.a.x->x,b);
497 default: n_srt = srt;
499 n->post(home,b,
true,n_srt,
this);
506 }
else if (srt ==
SRT_EQ) {
508 }
else if (srt ==
SRT_NQ) {
511 BoolVar nb(home,0,1);
513 post(home,nb,
true,srt,n);
518 NNF::nnf(Region&
r,
Node* n,
bool neg) {
524 NNF*
x =
new (
r) NNF;
525 x->t = n->t; x->neg =
neg; x->u.a.x = n;
534 return nnf(r,n->l,!neg);
541 t = n->t; xneg =
neg; neg =
false;
547 NNF* x =
new (
r) NNF;
550 x->u.b.l = nnf(r,n->l,neg);
551 x->u.b.r = nnf(r,n->r,neg);
554 p_l=x->u.b.l->p; n_l=x->u.b.l->n;
560 p_r=x->u.b.r->p; n_r=x->u.b.r->n;
631 if (n != NULL && n->decrement())
640 if (n != NULL && n->decrement())
653 NNF::nnf(r,n,
false)->post(home,
SRT_EQ,s);
660 return NNF::nnf(r,n,
false)->post(home,srt,NNF::nnf(r,e.n,
false));
666 return NNF::nnf(r,n,
false)->post(home,b,t,srt,
667 NNF::nnf(r,e.n,
false));
700 for (
int i=1; i<x.
size(); i++)
709 for (
int i=1; i<x.
size(); i++)
718 for (
int i=1; i<x.
size(); i++)
723 namespace MiniModel {
740 IntVar m = result(home,ret);
759 if (t==SNLE_CARD && irt!=
IRT_NQ) {
764 static_cast<unsigned int>(
c));
769 static_cast<unsigned int>(c-1));
773 static_cast<unsigned int>(
c),
778 static_cast<unsigned int>(c+1),
783 static_cast<unsigned int>(
c),
784 static_cast<unsigned int>(c));
789 }
else if (t==SNLE_MIN && (irt==
IRT_GR || irt==
IRT_GQ)) {
792 }
else if (t==SNLE_MAX && (irt==
IRT_LE || irt==
IRT_LQ)) {
796 rel(home,
post(home,NULL,ipl), irt, c);
804 }
else if (t==SNLE_MAX && (irt==
IRT_LE || irt==
IRT_LQ)) {
808 rel(home,
post(home,NULL,ipl), irt, c, b);
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.
const SetExpr & operator=(const SetExpr &e)
Assignment operator.
int size(void) const
Return size of array (number of elements)
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.
SetExpr operator&(const SetExpr &l, const SetExpr &r)
Intersection of set expressions.
void rfree(void *p)
Free memory block starting at p.
LinIntExpr e
Possibly a linear expression.
void max(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
virtual void post(Home home, IntRelType irt, int c, BoolVar b, IntPropLevel ipl) const
Post reified expression to be in relation irt with c.
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.
virtual void post(Home home, IntRelType irt, int c, IntPropLevel ipl) const
Post 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.
SetExpr setdunion(const SetVarArgs &x)
Disjoint union of set variables.
Gecode::FloatVal c(-8, 8)
IntRelType neg(IntRelType irt)
Return negated relation type of irt.
int n
Number of negative literals for node type.
IntSet s
Possibly a constant.
Gecode::IntArgs i({1, 2, 3, 4})
IntRelType
Relation types for integers.
FloatVal operator+(const FloatVal &x)
NodeType t
Type of expression.
Class to set group information when a post function is executed.
virtual IntVar post(Home home, IntVar *ret, IntPropLevel) const
Post expression.
Simple propagation levels.
SetExpr(void)
Default constructor.
bool failed(void) const
Check whether corresponding space is failed.
unsigned int size(I &i)
Size of all ranges of range iterator i.
Node(void)
Default constructor.
NodeType
Type of set expression.
SetExpr setunion(const SetVarArgs &x)
Union of set variables.
Integer valued set expressions.
Minimum element expression.
bool same(VarArgArray< Var > x, VarArgArray< Var > y)
static const IntSet empty
Empty set.
BoolVar expr(Home home, const BoolExpr &e, IntPropLevel ipl)
Post Boolean expression and return its value.
Boolean integer variables.
LinIntExpr cardinality(const SetExpr &e)
Cardinality of set expression.
Post propagator for SetVar SetOpType SetVar SetRelType r
SetExpr inter(const SetVarArgs &x)
Intersection of set variables.
void min(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
IntPropLevel
Propagation levels for integer propagators.
Linear expressions over integer variables.
Heap heap
The single global heap.
void rel(Home home, FloatVar x0, FloatRelType frt, FloatVal n)
Propagates .
unsigned int use
Nodes are reference counted.
Post propagator for SetVar x
#define GECODE_MINIMODEL_EXPORT
SetExpr operator|(const SetExpr &l, const SetExpr &r)
Union of set expressions.
SetNonLinIntExprType
The expression type.
Gecode toplevel namespace
union Gecode::@612::NNF::@68 u
Union depending on nodetype t.
Maximum element expression.
struct Gecode::@612::NNF::@68::@69 b
For binary nodes (and, or, eqv)
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.
struct Gecode::@612::NNF::@68::@70 a
For atomic nodes.
int p
Number of positive literals for node type.