int-bin.hpp
Go to the documentation of this file.
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christian Schulte, 2003
*
* This file is part of Gecode, the generic constraint
* development environment:
* http://www.gecode.org
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
*/
namespace Gecode { namespace Int { namespace Linear {
/*
* Binary linear propagators
*
*/
template<class Val, class A, class B, PropCond pc>
forceinline
LinBin<Val,A,B,pc>::LinBin(Home home, A y0, B y1, Val c0)
: Propagator(home), x0(y0), x1(y1), c(c0) {
x0.subscribe(home,*this,pc);
x1.subscribe(home,*this,pc);
}
template<class Val, class A, class B, PropCond pc>
forceinline
LinBin<Val,A,B,pc>::LinBin(Space& home, LinBin<Val,A,B,pc>& p)
: Propagator(home,p), c(p.c) {
x0.update(home,p.x0);
x1.update(home,p.x1);
}
template<class Val, class A, class B, PropCond pc>
forceinline
LinBin<Val,A,B,pc>::LinBin(Space& home, Propagator& p,
A y0, B y1, Val c0)
: Propagator(home,p), c(c0) {
x0.update(home,y0);
x1.update(home,y1);
}
template<class Val, class A, class B, PropCond pc>
PropCost
LinBin<Val,A,B,pc>::cost(const Space&, const ModEventDelta&) const {
return PropCost::binary(PropCost::LO);
}
template<class Val, class A, class B, PropCond pc>
void
LinBin<Val,A,B,pc>::reschedule(Space& home) {
x0.reschedule(home,*this,pc);
x1.reschedule(home,*this,pc);
}
template<class Val, class A, class B, PropCond pc>
forceinline size_t
LinBin<Val,A,B,pc>::dispose(Space& home) {
x0.cancel(home,*this,pc);
x1.cancel(home,*this,pc);
(void) Propagator::dispose(home);
return sizeof(*this);
}
/*
* Binary reified linear propagators
*
*/
template<class Val, class A, class B, PropCond pc, class Ctrl>
forceinline
ReLinBin<Val,A,B,pc,Ctrl>::ReLinBin(Home home, A y0, B y1, Val c0, Ctrl b0)
: Propagator(home), x0(y0), x1(y1), c(c0), b(b0) {
x0.subscribe(home,*this,pc);
x1.subscribe(home,*this,pc);
b.subscribe(home,*this,PC_INT_VAL);
}
template<class Val, class A, class B, PropCond pc, class Ctrl>
forceinline
ReLinBin<Val,A,B,pc,Ctrl>::ReLinBin(Space& home,
ReLinBin<Val,A,B,pc,Ctrl>& p)
: Propagator(home,p), c(p.c) {
x0.update(home,p.x0);
x1.update(home,p.x1);
b.update(home,p.b);
}
template<class Val, class A, class B, PropCond pc, class Ctrl>
PropCost
ReLinBin<Val,A,B,pc,Ctrl>::cost(const Space&, const ModEventDelta&) const {
return PropCost::binary(PropCost::LO);
}
template<class Val, class A, class B, PropCond pc, class Ctrl>
void
ReLinBin<Val,A,B,pc,Ctrl>::reschedule(Space& home) {
x0.reschedule(home,*this,pc);
x1.reschedule(home,*this,pc);
b.reschedule(home,*this,PC_INT_VAL);
}
template<class Val, class A, class B, PropCond pc, class Ctrl>
forceinline size_t
ReLinBin<Val,A,B,pc,Ctrl>::dispose(Space& home) {
x0.cancel(home,*this,pc);
x1.cancel(home,*this,pc);
b.cancel(home,*this,PC_BOOL_VAL);
(void) Propagator::dispose(home);
return sizeof(*this);
}
/*
* Binary bounds consistent linear equality
*
*/
template<class Val, class A, class B>
forceinline
EqBin<Val,A,B>::EqBin(Home home, A x0, B x1, Val c)
: LinBin<Val,A,B,PC_INT_BND>(home,x0,x1,c) {}
template<class Val, class A, class B>
ExecStatus
EqBin<Val,A,B>::post(Home home, A x0, B x1, Val c) {
(void) new (home) EqBin<Val,A,B>(home,x0,x1,c);
return ES_OK;
}
template<class Val, class A, class B>
forceinline
EqBin<Val,A,B>::EqBin(Space& home, EqBin<Val,A,B>& p)
: LinBin<Val,A,B,PC_INT_BND>(home,p) {}
template<class Val, class A, class B>
forceinline
EqBin<Val,A,B>::EqBin(Space& home, Propagator& p,
A x0, B x1, Val c)
: LinBin<Val,A,B,PC_INT_BND>(home,p,x0,x1,c) {}
template<class Val, class A, class B>
Actor*
EqBin<Val,A,B>::copy(Space& home) {
return new (home) EqBin<Val,A,B>(home,*this);
}
enum BinMod {
BM_X0_MIN = 1<<0,
BM_X0_MAX = 1<<1,
BM_X1_MIN = 1<<2,
BM_X1_MAX = 1<<3,
BM_ALL = BM_X0_MIN|BM_X0_MAX|BM_X1_MIN|BM_X1_MAX
};
#define GECODE_INT_PV(CASE,TELL,UPDATE) \
if (bm & (CASE)) { \
bm -= (CASE); ModEvent me = (TELL); \
if (me_failed(me)) return ES_FAILED; \
if (me_modified(me)) bm |= (UPDATE); \
}
template<class Val, class A, class B>
ExecStatus
EqBin<Val,A,B>::propagate(Space& home, const ModEventDelta&) {
int bm = BM_ALL;
do {
GECODE_INT_PV(BM_X0_MIN, x0.gq(home,c-x1.max()), BM_X1_MAX);
GECODE_INT_PV(BM_X1_MIN, x1.gq(home,c-x0.max()), BM_X0_MAX);
GECODE_INT_PV(BM_X0_MAX, x0.lq(home,c-x1.min()), BM_X1_MIN);
GECODE_INT_PV(BM_X1_MAX, x1.lq(home,c-x0.min()), BM_X0_MIN);
} while (bm);
return x0.assigned() ? home.ES_SUBSUMED(*this) : ES_FIX;
}
#undef GECODE_INT_PV
/*
* Reified binary bounds consistent linear equality
*
*/
template<class Val, class A, class B, class Ctrl, ReifyMode rm>
forceinline
ReEqBin<Val,A,B,Ctrl,rm>::ReEqBin(Home home, A x0, B x1, Val c, Ctrl b)
: ReLinBin<Val,A,B,PC_INT_BND,Ctrl>(home,x0,x1,c,b) {}
template<class Val, class A, class B, class Ctrl, ReifyMode rm>
ExecStatus
ReEqBin<Val,A,B,Ctrl,rm>::post(Home home, A x0, B x1, Val c, Ctrl b) {
(void) new (home) ReEqBin<Val,A,B,Ctrl,rm>(home,x0,x1,c,b);
return ES_OK;
}
template<class Val, class A, class B, class Ctrl, ReifyMode rm>
forceinline
ReEqBin<Val,A,B,Ctrl,rm>::ReEqBin(Space& home,
ReEqBin<Val,A,B,Ctrl,rm>& p)
: ReLinBin<Val,A,B,PC_INT_BND,Ctrl>(home,p) {}
template<class Val, class A, class B, class Ctrl, ReifyMode rm>
Actor*
ReEqBin<Val,A,B,Ctrl,rm>::copy(Space& home) {
return new (home) ReEqBin<Val,A,B,Ctrl,rm>(home,*this);
}
template<class Val, class A, class B, class Ctrl, ReifyMode rm>
ExecStatus
ReEqBin<Val,A,B,Ctrl,rm>::propagate(Space& home, const ModEventDelta&) {
if (b.zero()) {
if (rm == RM_IMP)
return home.ES_SUBSUMED(*this);
GECODE_REWRITE(*this,(NqBin<Val,A,B>::post(home(*this),x0,x1,c)));
}
if (b.one()) {
if (rm == RM_PMI)
return home.ES_SUBSUMED(*this);
GECODE_REWRITE(*this,(EqBin<Val,A,B>::post(home(*this),x0,x1,c)));
}
if ((x0.min() + x1.min() > c) || (x0.max() + x1.max() < c)) {
if (rm != RM_PMI)
GECODE_ME_CHECK(b.zero_none(home));
return home.ES_SUBSUMED(*this);
}
if (x0.assigned() && x1.assigned()) {
assert(x0.val() + x1.val() == c);
if (rm != RM_IMP)
GECODE_ME_CHECK(b.one_none(home));
return home.ES_SUBSUMED(*this);
}
return ES_FIX;
}
/*
* Binary domain consistent linear disequality
*
*/
template<class Val, class A, class B>
forceinline
NqBin<Val,A,B>::NqBin(Home home, A x0, B x1, Val c)
: LinBin<Val,A,B,PC_INT_VAL>(home,x0,x1,c) {}
template<class Val, class A, class B>
ExecStatus
NqBin<Val,A,B>::post(Home home, A x0, B x1, Val c) {
(void) new (home) NqBin<Val,A,B>(home,x0,x1,c);
return ES_OK;
}
template<class Val, class A, class B>
forceinline
NqBin<Val,A,B>::NqBin(Space& home, NqBin<Val,A,B>& p)
: LinBin<Val,A,B,PC_INT_VAL>(home,p) {}
template<class Val, class A, class B>
Actor*
NqBin<Val,A,B>::copy(Space& home) {
return new (home) NqBin<Val,A,B>(home,*this);
}
template<class Val, class A, class B>
forceinline
NqBin<Val,A,B>::NqBin(Space& home, Propagator& p,
A x0, B x1, Val c)
: LinBin<Val,A,B,PC_INT_VAL>(home,p,x0,x1,c) {}
template<class Val, class A, class B>
PropCost
NqBin<Val,A,B>::cost(const Space&, const ModEventDelta&) const {
return PropCost::unary(PropCost::LO);
}
template<class Val, class A, class B>
ExecStatus
NqBin<Val,A,B>::propagate(Space& home, const ModEventDelta&) {
if (x0.assigned()) {
GECODE_ME_CHECK(x1.nq(home,c-x0.val()));
} else {
assert(x1.assigned());
GECODE_ME_CHECK(x0.nq(home,c-x1.val()));
}
return home.ES_SUBSUMED(*this);
}
/*
* Binary domain consistent less equal
*
*/
template<class Val, class A, class B>
forceinline
LqBin<Val,A,B>::LqBin(Home home, A x0, B x1, Val c)
: LinBin<Val,A,B,PC_INT_BND>(home,x0,x1,c) {}
template<class Val, class A, class B>
ExecStatus
LqBin<Val,A,B>::post(Home home, A x0, B x1, Val c) {
(void) new (home) LqBin<Val,A,B>(home,x0,x1,c);
return ES_OK;
}
template<class Val, class A, class B>
forceinline
LqBin<Val,A,B>::LqBin(Space& home, LqBin<Val,A,B>& p)
: LinBin<Val,A,B,PC_INT_BND>(home,p) {}
template<class Val, class A, class B>
Actor*
LqBin<Val,A,B>::copy(Space& home) {
return new (home) LqBin<Val,A,B>(home,*this);
}
template<class Val, class A, class B>
forceinline
LqBin<Val,A,B>::LqBin(Space& home, Propagator& p,
A x0, B x1, Val c)
: LinBin<Val,A,B,PC_INT_BND>(home,p,x0,x1,c) {}
template<class Val, class A, class B>
ExecStatus
LqBin<Val,A,B>::propagate(Space& home, const ModEventDelta&) {
GECODE_ME_CHECK(x0.lq(home,c-x1.min()));
GECODE_ME_CHECK(x1.lq(home,c-x0.min()));
return (x0.max()+x1.max() <= c) ? home.ES_SUBSUMED(*this) : ES_FIX;
}
/*
* Binary domain consistent greater equal
*
*/
template<class Val, class A, class B>
forceinline
GqBin<Val,A,B>::GqBin(Home home, A x0, B x1, Val c)
: LinBin<Val,A,B,PC_INT_BND>(home,x0,x1,c) {}
template<class Val, class A, class B>
ExecStatus
GqBin<Val,A,B>::post(Home home, A x0, B x1, Val c) {
(void) new (home) GqBin<Val,A,B>(home,x0,x1,c);
return ES_OK;
}
template<class Val, class A, class B>
forceinline
GqBin<Val,A,B>::GqBin(Space& home, GqBin<Val,A,B>& p)
: LinBin<Val,A,B,PC_INT_BND>(home,p) {}
template<class Val, class A, class B>
Actor*
GqBin<Val,A,B>::copy(Space& home) {
return new (home) GqBin<Val,A,B>(home,*this);
}
template<class Val, class A, class B>
forceinline
GqBin<Val,A,B>::GqBin(Space& home, Propagator& p,
A x0, B x1, Val c)
: LinBin<Val,A,B,PC_INT_BND>(home,p,x0,x1,c) {}
template<class Val, class A, class B>
ExecStatus
GqBin<Val,A,B>::propagate(Space& home, const ModEventDelta&) {
GECODE_ME_CHECK(x0.gq(home,c-x1.max()));
GECODE_ME_CHECK(x1.gq(home,c-x0.max()));
return (x0.min()+x1.min() >= c) ? home.ES_SUBSUMED(*this) : ES_FIX;
}
/*
* Reified binary domain consistent less equal
*
*/
template<class Val, class A, class B, ReifyMode rm>
forceinline
ReLqBin<Val,A,B,rm>::ReLqBin(Home home, A x0, B x1, Val c, BoolView b)
: ReLinBin<Val,A,B,PC_INT_BND,BoolView>(home,x0,x1,c,b) {}
template<class Val, class A, class B, ReifyMode rm>
ExecStatus
ReLqBin<Val,A,B,rm>::post(Home home, A x0, B x1, Val c, BoolView b) {
(void) new (home) ReLqBin<Val,A,B,rm>(home,x0,x1,c,b);
return ES_OK;
}
template<class Val, class A, class B, ReifyMode rm>
forceinline
ReLqBin<Val,A,B,rm>::ReLqBin(Space& home, ReLqBin<Val,A,B,rm>& p)
: ReLinBin<Val,A,B,PC_INT_BND,BoolView>(home,p) {}
template<class Val, class A, class B, ReifyMode rm>
Actor*
ReLqBin<Val,A,B,rm>::copy(Space& home) {
return new (home) ReLqBin<Val,A,B,rm>(home,*this);
}
template<class Val, class A, class B, ReifyMode rm>
ExecStatus
ReLqBin<Val,A,B,rm>::propagate(Space& home, const ModEventDelta&) {
if (b.one()) {
if (rm == RM_PMI)
return home.ES_SUBSUMED(*this);
GECODE_REWRITE(*this,(LqBin<Val,A,B>::post(home(*this),x0,x1,c)));
}
if (b.zero()) {
if (rm == RM_IMP)
return home.ES_SUBSUMED(*this);
GECODE_REWRITE(*this,(GqBin<Val,A,B>::post(home(*this),x0,x1,c+1)));
}
if (x0.max() + x1.max() <= c) {
if (rm != RM_IMP)
GECODE_ME_CHECK(b.one_none(home));
return home.ES_SUBSUMED(*this);
}
if (x0.min() + x1.min() > c) {
if (rm != RM_PMI)
GECODE_ME_CHECK(b.zero_none(home));
return home.ES_SUBSUMED(*this);
}
return ES_FIX;
}
}}}
// STATISTICS: int-prop
Gecode::Actor
Base-class for both propagators and branchers.
Definition core.hpp:628
Gecode::Actor::dispose
virtual size_t dispose(Space &home)
Delete actor and return its size.
Definition core.hpp:3252
Gecode::Home
Home class for posting propagators
Definition core.hpp:856
Gecode::Int::BoolView
Boolean view for Boolean variables.
Definition view.hpp:1380
Gecode::Int::Linear::EqBin
Propagator for bounds consistent binary linear equality
Definition linear.hh:134
Gecode::Int::Linear::EqBin::propagate
virtual ExecStatus propagate(Space &home, const ModEventDelta &med)
Perform propagation.
Definition int-bin.hpp:188
Gecode::Int::Linear::EqBin::EqBin
EqBin(Space &home, EqBin &p)
Constructor for cloning p.
Gecode::Int::Linear::EqBin::post
static ExecStatus post(Home home, A x0, B x1, Val c)
Post propagator for .
Definition int-bin.hpp:147
Gecode::Int::Linear::EqBin::copy
virtual Actor * copy(Space &home)
Create copy during cloning.
Definition int-bin.hpp:166
Gecode::Int::Linear::GqBin
Propagator for bounds consistent binary linear greater or equal
Definition linear.hh:271
Gecode::Int::Linear::GqBin::post
static ExecStatus post(Home home, A x0, B x1, Val c)
Post propagator for .
Definition int-bin.hpp:378
Gecode::Int::Linear::GqBin::copy
virtual Actor * copy(Space &home)
Create copy during cloning.
Definition int-bin.hpp:391
Gecode::Int::Linear::GqBin::propagate
virtual ExecStatus propagate(Space &home, const ModEventDelta &med)
Perform propagation.
Definition int-bin.hpp:403
Gecode::Int::Linear::GqBin::GqBin
GqBin(Space &home, GqBin &p)
Constructor for cloning p.
Gecode::Int::Linear::LinBin
Base-class for binary linear propagators.
Definition linear.hh:65
Gecode::Int::Linear::LinBin::dispose
virtual size_t dispose(Space &home)
Delete propagator and return its size.
Definition int-bin.hpp:80
Gecode::Int::Linear::LinBin::c
Val c
Value of type Val.
Definition linear.hh:72
Gecode::Int::Linear::LinBin::x1
B x1
View of type B.
Definition linear.hh:70
Gecode::Int::Linear::LinBin::x0
A x0
View of type A.
Definition linear.hh:68
Gecode::Int::Linear::LinBin::reschedule
virtual void reschedule(Space &home)
Schedule function.
Definition int-bin.hpp:73
Gecode::Int::Linear::LinBin::cost
virtual PropCost cost(const Space &home, const ModEventDelta &med) const
Cost function (defined as low binary).
Definition int-bin.hpp:67
Gecode::Int::Linear::LinBin::LinBin
LinBin(Space &home, LinBin &p)
Constructor for cloning p.
Gecode::Int::Linear::LqBin
Propagator for bounds consistent binary linear less or equal
Definition linear.hh:237
Gecode::Int::Linear::LqBin::post
static ExecStatus post(Home home, A x0, B x1, Val c)
Post propagator for .
Definition int-bin.hpp:332
Gecode::Int::Linear::LqBin::LqBin
LqBin(Space &home, LqBin &p)
Constructor for cloning p.
Gecode::Int::Linear::LqBin::copy
virtual Actor * copy(Space &home)
Create copy during cloning.
Definition int-bin.hpp:345
Gecode::Int::Linear::LqBin::propagate
virtual ExecStatus propagate(Space &home, const ModEventDelta &med)
Perform propagation.
Definition int-bin.hpp:357
Gecode::Int::Linear::NqBin
Propagator for bounds consistent binary linear disequality
Definition linear.hh:201
Gecode::Int::Linear::NqBin::propagate
virtual ExecStatus propagate(Space &home, const ModEventDelta &med)
Perform propagation.
Definition int-bin.hpp:309
Gecode::Int::Linear::NqBin::NqBin
NqBin(Space &home, NqBin &p)
Constructor for cloning p.
Gecode::Int::Linear::NqBin::cost
virtual PropCost cost(const Space &home, const ModEventDelta &med) const
Cost function (defined as low unary).
Definition int-bin.hpp:303
Gecode::Int::Linear::NqBin::post
static ExecStatus post(Home home, A x0, B x1, Val c)
Post propagator for .
Definition int-bin.hpp:276
Gecode::Int::Linear::NqBin::copy
virtual Actor * copy(Space &home)
Create copy during cloning.
Definition int-bin.hpp:289
Gecode::Int::Linear::ReEqBin
Propagator for reified bounds consistent binary linear equality
Definition linear.hh:168
Gecode::Int::Linear::ReEqBin::post
static ExecStatus post(Home home, A x0, B x1, Val c, Ctrl b)
Post propagator for .
Definition int-bin.hpp:217
Gecode::Int::Linear::ReEqBin::ReEqBin
ReEqBin(Space &home, ReEqBin &p)
Constructor for cloning p.
Gecode::Int::Linear::ReEqBin::propagate
virtual ExecStatus propagate(Space &home, const ModEventDelta &med)
Perform propagation.
Definition int-bin.hpp:237
Gecode::Int::Linear::ReEqBin::copy
virtual Actor * copy(Space &home)
Create copy during cloning.
Definition int-bin.hpp:231
Gecode::Int::Linear::ReLinBin
Base-class for reified binary linear propagators.
Definition linear.hh:98
Gecode::Int::Linear::ReLinBin::b
Ctrl b
Control view for reification.
Definition linear.hh:107
Gecode::Int::Linear::ReLinBin::dispose
virtual size_t dispose(Space &home)
Delete propagator and return its size.
Definition int-bin.hpp:127
Gecode::Int::Linear::ReLinBin::x1
B x1
View of type B.
Definition linear.hh:103
Gecode::Int::Linear::ReLinBin::c
Val c
Value of type Val.
Definition linear.hh:105
Gecode::Int::Linear::ReLinBin::cost
virtual PropCost cost(const Space &home, const ModEventDelta &med) const
Cost function (defined as low binary).
Definition int-bin.hpp:113
Gecode::Int::Linear::ReLinBin::ReLinBin
ReLinBin(Space &home, ReLinBin &p)
Constructor for cloning p.
Gecode::Int::Linear::ReLinBin::reschedule
virtual void reschedule(Space &home)
Schedule function.
Definition int-bin.hpp:119
Gecode::Int::Linear::ReLinBin::x0
A x0
View of type A.
Definition linear.hh:101
Gecode::Int::Linear::ReLqBin
Propagator for reified bounds consistent binary linear less or equal
Definition linear.hh:305
Gecode::Int::Linear::ReLqBin::post
static ExecStatus post(Home home, A x0, B x1, Val c, BoolView b)
Post propagator for .
Definition int-bin.hpp:424
Gecode::Int::Linear::ReLqBin::propagate
virtual ExecStatus propagate(Space &home, const ModEventDelta &med)
Perform propagation.
Definition int-bin.hpp:443
Gecode::Int::Linear::ReLqBin::copy
virtual Actor * copy(Space &home)
Create copy during cloning.
Definition int-bin.hpp:437
Gecode::Int::Linear::ReLqBin::ReLqBin
ReLqBin(Space &home, ReLqBin &p)
Constructor for cloning p.
Gecode::PropCost
Propagation cost.
Definition core.hpp:486
Gecode::PropCost::unary
static PropCost unary(PropCost::Mod m)
Single variable for modifier pcm.
Definition core.hpp:4813
Gecode::PropCost::binary
static PropCost binary(PropCost::Mod m)
Two variables for modifier pcm.
Definition core.hpp:4809
Gecode::PropCost::LO
@ LO
Cheap.
Definition core.hpp:513
Gecode::Propagator
Base-class for propagators.
Definition core.hpp:1064
Gecode::Propagator::Space
friend class Space
Definition core.hpp:1066
Gecode::Propagator::Propagator
Propagator(Home home)
Constructor for posting.
Definition core.hpp:3498
Gecode::Space
Computation spaces.
Definition core.hpp:1742
Gecode::Val
Gecode::Space::ES_SUBSUMED
ExecStatus ES_SUBSUMED(Propagator &p)
Definition core.hpp:3563
Gecode::ModEventDelta
int ModEventDelta
Modification event deltas.
Definition core.hpp:89
GECODE_ME_CHECK
#define GECODE_ME_CHECK(me)
Check whether modification event me is failed, and forward failure.
Definition macros.hpp:52
GECODE_REWRITE
#define GECODE_REWRITE(prop, post)
Rewrite propagator by executing post function.
Definition macros.hpp:116
Gecode::RM_IMP
@ RM_IMP
Implication for reification.
Definition int.hh:862
Gecode::RM_PMI
@ RM_PMI
Inverse implication for reification.
Definition int.hh:869
GECODE_INT_PV
#define GECODE_INT_PV(CASE, TELL, UPDATE)
Definition int-bin.hpp:179
Gecode::Int::Linear
Linear propagators
Gecode::Int::Linear::BinMod
BinMod
Describe which view has been modified how.
Definition int-bin.hpp:171
Gecode::Int::Linear::BM_X0_MAX
@ BM_X0_MAX
Definition int-bin.hpp:173
Gecode::Int::Linear::BM_ALL
@ BM_ALL
Definition int-bin.hpp:176
Gecode::Int::Linear::BM_X0_MIN
@ BM_X0_MIN
Definition int-bin.hpp:172
Gecode::Int::Linear::BM_X1_MAX
@ BM_X1_MAX
Definition int-bin.hpp:175
Gecode::Int::Linear::BM_X1_MIN
@ BM_X1_MIN
Definition int-bin.hpp:174
Gecode::Int
Finite domain integers.
Gecode::Int::PC_INT_VAL
const Gecode::PropCond PC_INT_VAL
Propagate when a view becomes assigned (single value).
Definition var-type.hpp:82
Gecode::Int::PC_INT_BND
const Gecode::PropCond PC_INT_BND
Propagate when minimum or maximum of a view changes.
Definition var-type.hpp:91
Gecode::Int::PC_BOOL_VAL
const Gecode::PropCond PC_BOOL_VAL
Propagate when a view becomes assigned (single value).
Definition var-type.hpp:126
Gecode
Gecode toplevel namespace
Gecode::ExecStatus
ExecStatus
Definition core.hpp:472
Gecode::ES_OK
@ ES_OK
Execution is okay.
Definition core.hpp:476
Gecode::ES_FIX
@ ES_FIX
Propagation has computed fixpoint.
Definition core.hpp:477
forceinline
#define forceinline
Definition config.hpp:187