65#ifdef GECODE_HAS_FLOAT_VARS
69#ifdef GECODE_HAS_SET_VARS
84 static void*
operator new(
size_t size);
86 static void operator delete(
void* p,
size_t size);
102 BoolExpr::Node::operator
new(
size_t size) {
103 return heap.ralloc(size);
106 BoolExpr::Node::operator
delete(
void* p, size_t) {
113 if ((
l !=
nullptr) &&
l->decrement())
115 if ((
r !=
nullptr) &&
r->decrement())
123 BoolExpr::constant(
bool value) {
146 : BoolExpr(l,t,r,false) {}
150 if (accumulator && ((t ==
NT_AND) || (t ==
NT_OR)) &&
156 if (accumulator && ((t ==
NT_AND) || (t ==
NT_OR)) &&
163 int ls = ((l.n->
t == t) || (l.n->
t ==
NT_VAR)) ? l.n->
same : 1;
164 int rs = ((
r.n->t == t) || (
r.n->t ==
NT_VAR)) ?
r.n->same : 1;
198#ifdef GECODE_HAS_FLOAT_VARS
209#ifdef GECODE_HAS_SET_VARS
292 static NNF* nnf(Region& r, Node* n,
bool neg);
295 void post(Home home, NodeType t,
296 BoolVarArgs& bp, BoolVarArgs& bn,
298 const IntPropLevels& ipls)
const;
301 BoolVar
expr(Home home,
const IntPropLevels& ipls)
const;
304 void rel(Home home,
const IntPropLevels& ipls)
const;
306 static void*
operator new(
size_t s, Region&
r);
308 static void operator delete(
void*);
310 static void operator delete(
void*, Region&);
318 NNF::operator
delete(
void*) {}
321 NNF::operator
delete(
void*, Region&) {}
324 NNF::operator
new(
size_t s, Region&
r) {
329 NNF::expr(Home home,
const IntPropLevels& ipls)
const {
333 bool value = u.a.x->value != u.a.neg;
334 return BoolVar(home,value,value);
343 u.a.x->rl.post(home, b, !u.a.neg, ipls);
345#ifdef GECODE_HAS_FLOAT_VARS
347 u.a.x->rfl.post(home, b, !u.a.neg);
350#ifdef GECODE_HAS_SET_VARS
352 u.a.x->rs.post(home, b, !u.a.neg);
356 u.a.x->m->post(home, b, u.a.neg, ipls);
360 BoolVarArgs bp(p), bn(n);
368 BoolVarArgs bp(p), bn(n);
380 if (u.b.l->u.a.neg) n = !n;
382 l = u.b.l->expr(home,ipls);
387 if (u.b.r->u.a.neg) n = !n;
389 r = u.b.r->expr(home,ipls);
402 BoolVarArgs& bp, BoolVarArgs& bn,
404 const IntPropLevels& ipls)
const {
417 u.a.x->rl.post(home, b, !u.a.neg, ipls);
421#ifdef GECODE_HAS_FLOAT_VARS
425 u.a.x->rfl.post(home, b, !u.a.neg);
430#ifdef GECODE_HAS_SET_VARS
434 u.a.x->rs.post(home, b, !u.a.neg);
442 u.a.x->m->post(home, b, u.a.neg, ipls);
447 bp[ip++] =
expr(home, ipls);
451 u.b.l->post(home, t, bp, bn, ip, in, ipls);
452 u.b.r->post(home, t, bp, bn, ip, in, ipls);
457 NNF::rel(Home home,
const IntPropLevels& ipls)
const {
460 if (u.a.x->value == u.a.neg)
467 u.a.x->rl.post(home, !u.a.neg, ipls);
469#ifdef GECODE_HAS_FLOAT_VARS
471 u.a.x->rfl.post(home, !u.a.neg);
474#ifdef GECODE_HAS_SET_VARS
476 u.a.x->rs.post(home, !u.a.neg);
481 BoolVar
b(home,!u.a.neg,!u.a.neg);
482 u.a.x->m->post(home, b,
false, ipls);
486 u.b.l->rel(home, ipls);
487 u.b.r->rel(home, ipls);
491 BoolVarArgs bp(p), bn(n);
500 u.b.r->u.a.x->rl.post(home, u.b.l->u.a.x->x,
501 u.b.l->u.a.neg==u.b.r->u.a.neg, ipls);
504 u.b.l->u.a.x->rl.post(home, u.b.r->u.a.x->x,
505 u.b.l->u.a.neg==u.b.r->u.a.neg, ipls);
507 u.b.l->u.a.x->rl.post(home, u.b.r->expr(home,ipls),
508 !u.b.l->u.a.neg,ipls);
510 u.b.r->u.a.x->rl.post(home, u.b.l->expr(home,ipls),
511 !u.b.r->u.a.neg,ipls);
512#ifdef GECODE_HAS_FLOAT_VARS
515 u.b.r->u.a.x->rfl.post(home, u.b.l->u.a.x->x,
516 u.b.l->u.a.neg==u.b.r->u.a.neg);
519 u.b.l->u.a.x->rfl.post(home, u.b.r->u.a.x->x,
520 u.b.l->u.a.neg==u.b.r->u.a.neg);
522 u.b.l->u.a.x->rfl.post(home, u.b.r->expr(home,ipls),
525 u.b.r->u.a.x->rfl.post(home, u.b.l->expr(home,ipls),
528#ifdef GECODE_HAS_SET_VARS
531 u.b.r->u.a.x->rs.post(home, u.b.l->u.a.x->x,
532 u.b.l->u.a.neg==u.b.r->u.a.neg);
535 u.b.l->u.a.x->rs.post(home, u.b.r->u.a.x->x,
536 u.b.l->u.a.neg==u.b.r->u.a.neg);
538 u.b.l->u.a.x->rs.post(home, u.b.r->expr(home,ipls),
541 u.b.r->u.a.x->rs.post(home, u.b.l->expr(home,ipls),
554 NNF::nnf(Region& r,
Node* n,
bool neg) {
556 throw MiniModel::TooFewArguments(
"BoolExpr");
562 #ifdef GECODE_HAS_FLOAT_VARS
565 #ifdef GECODE_HAS_SET_VARS
569 NNF* x =
new (
r) NNF;
570 x->t = n->t; x->u.a.neg =
neg; x->u.a.x = n;
579 return nnf(r,n->l,!
neg);
584 NNF* x =
new (
r) NNF;
586 x->u.b.l = nnf(r,n->l,
neg);
587 x->u.b.r = nnf(r,n->r,
neg);
589 if ((x->u.b.l->t == t) ||
591 p_l=x->u.b.l->p; n_l=x->u.b.l->n;
596 if ((x->u.b.r->t == t) ||
598 p_r=x->u.b.r->p; n_r=x->u.b.r->n;
608 NNF* x =
new (
r) NNF;
610 x->u.b.l = nnf(r,n->l,
neg);
611 x->u.b.r = nnf(r,n->r,
false);
626 return NNF::nnf(r,n,
false)->expr(home,ipls);
632 return NNF::nnf(r,n,
false)->rel(home,ipls);
682 return e.
expr(home,ipls);
719 for (
int i=b.
size(); i--;)
737 x[i] =
a[i].
expr(home,ipls);
Boolean element expressions.
LinIntExpr idx
The linear expression for the index.
int n
The number of Boolean expressions.
virtual void post(Home home, BoolVar b, bool neg, const IntPropLevels &ipls)
Constrain b to be equivalent to the expression (negated if neg).
virtual ~BElementExpr(void)
Destructor.
BElementExpr(const BoolVarArgs &b, const LinIntExpr &idx)
Constructor.
BoolExpr * a
The Boolean expressions.
Miscealloneous Boolean expressions.
virtual ~Misc(void)
Destructor.
Node for Boolean expression
BoolVar x
Possibly a variable.
NodeType t
Type of expression.
bool value
Possibly a Boolean constant.
Node(void)
Default constructor.
LinFloatRel rfl
Possibly a reified float linear relation.
LinIntRel rl
Possibly a reified linear relation.
SetRel rs
Possibly a reified set relation.
bool decrement(void)
Decrement reference count and possibly free memory.
Misc * m
Possibly a misc Boolean expression.
unsigned int use
Nodes are reference counted.
int same
Number of variables in subtree with same type (for AND and OR).
friend BoolExpr operator||(const BoolExpr &, const BoolExpr &)
friend BoolExpr operator&&(const BoolExpr &, const BoolExpr &)
NodeType
Type of Boolean expression.
@ NT_RLINFLOAT
Reified linear relation.
@ NT_RLIN
Reified linear relation.
@ NT_CONST
Boolean constant.
@ NT_MISC
Other Boolean expression.
@ NT_RSET
Reified set relation.
const BoolExpr & operator=(const BoolExpr &e)
Assignment operator.
BoolVar expr(Home home, const IntPropLevels &ipls) const
Post propagators for expression.
~BoolExpr(void)
Destructor.
void rel(Home home, const IntPropLevels &ipls) const
Post propagators for relation.
Passing Boolean variables.
Boolean integer variables.
FloatNum size(void) const
Return size of float value (distance between maximum and minimum).
Home class for posting propagators
bool failed(void) const
Check whether corresponding space is failed.
Class for specifying integer propagation levels used by minimodel.
IntPropLevel element(void) const
Return integer propagation level for element constraints.
int val(void) const
Return assigned value.
Linear expressions over integer variables.
Linear relations over integer variables.
Class to set group information when a post function is executed.
Comparison relation (for two-sided comparisons).
bool assigned(void) const
Test whether view is assigned.
void post(Home home, Term *t, int n, FloatRelType frt, FloatVal c)
Post propagator for linear constraint over floats.
Heap heap
The single global heap.
#define GECODE_POST
Check for failure in a constraint post function.
void rel(Home home, FloatVar x0, FloatRelType frt, FloatVar x1)
Post propagator for .
void clause(Home home, BoolOpType o, const BoolVarArgs &x, const BoolVarArgs &y, BoolVar z, IntPropLevel ipl=IPL_DEF)
Post domain consistent propagator for Boolean clause with positive variables x and negative variables...
#define GECODE_MINIMODEL_EXPORT
Gecode toplevel namespace
IntVar expr(Home home, const LinIntExpr &e, const IntPropLevels &ipls=IntPropLevels::def)
Post linear expression and return its value.
Archive & operator<<(Archive &e, FloatNumBranch nl)
IntRelType neg(IntRelType irt)
Return negated relation type of irt.
void element(Home home, IntSharedArray n, IntVar x0, IntVar x1, IntPropLevel ipl=IPL_DEF)
Post domain consistent propagator for .
BoolExpr operator!(const BoolExpr &)
Negated Boolean expression.
BoolExpr operator^(const BoolExpr &, const BoolExpr &)
Exclusive-or of Boolean expressions.
TFE post(PropagatorGroup g)
Only post functions (but not propagators) from g are considered.
Archive & operator>>(Archive &e, FloatNumBranch &nl)
bool operator==(const FloatVal &x, const FloatVal &y)
bool operator!=(const FloatVal &x, const FloatVal &y)
Gecode::FloatVal b(9, 12)
Gecode::FloatVal a(-8, 5)
#define GECODE_NEVER
Assert that this command is never executed.