34 namespace Gecode {
namespace Int {
namespace Linear {
40 template<
class Val,
class A,
class B,
class C, PropCond pc>
44 x0.subscribe(home,*
this,pc);
45 x1.subscribe(home,*
this,pc);
46 x2.subscribe(home,*
this,pc);
49 template<
class Val,
class A,
class B,
class C, PropCond pc>
58 template<
class Val,
class A,
class B,
class C, PropCond pc>
61 A y0, B y1, C y2, Val c0)
68 template<
class Val,
class A,
class B,
class C, PropCond pc>
71 return PropCost::ternary(PropCost::LO);
74 template<
class Val,
class A,
class B,
class C, PropCond pc>
77 x0.reschedule(home,*
this,pc);
78 x1.reschedule(home,*
this,pc);
79 x2.reschedule(home,*
this,pc);
82 template<
class Val,
class A,
class B,
class C, PropCond pc>
85 x0.cancel(home,*
this,pc);
86 x1.cancel(home,*
this,pc);
87 x2.cancel(home,*
this,pc);
88 (void) Propagator::dispose(home);
97 template<
class Val,
class A,
class B,
class C>
102 template<
class Val,
class A,
class B,
class C>
110 template<
class Val,
class A,
class B,
class C>
115 template<
class Val,
class A,
class B,
class C>
121 template<
class Val,
class A,
class B,
class C>
138 #define GECODE_INT_PV(CASE,TELL,UPDATE) \ 140 bm -= (CASE); ModEvent me = (TELL); \ 141 if (me_failed(me)) return ES_FAILED; \ 142 if (me_modified(me)) bm |= (UPDATE); \ 145 template<
class Val,
class A,
class B,
class C>
163 return (
x0.assigned() &&
x1.assigned()) ?
176 template<
class Val,
class A,
class B,
class C>
181 template<
class Val,
class A,
class B,
class C>
189 template<
class Val,
class A,
class B,
class C>
194 template<
class Val,
class A,
class B,
class C>
200 template<
class Val,
class A,
class B,
class C>
207 template<
class Val,
class A,
class B,
class C>
210 if (
x0.assigned() &&
x1.assigned()) {
214 if (
x0.assigned() &&
x2.assigned()) {
218 if (
x1.assigned() &&
x2.assigned()) {
232 template<
class Val,
class A,
class B,
class C>
237 template<
class Val,
class A,
class B,
class C>
245 template<
class Val,
class A,
class B,
class C>
250 template<
class Val,
class A,
class B,
class C>
257 template<
class Val,
class A,
class B,
class C>
263 template<
class Val,
class A,
class B,
class C>
269 return (
x0.max()+
x1.max()+
x2.max() <=
c) ?
virtual Actor * copy(Space &home)
Create copy during cloning.
static ExecStatus post(Home home, A x0, B x1, C x2, Val c)
Post propagator for .
ExecStatus ES_SUBSUMED(Propagator &p)
NqTer(Space &home, NqTer &p)
Constructor for cloning p.
Propagator for bounds consistent ternary linear equality
Base-class for propagators.
Base-class for ternary linear propagators.
Propagation has computed fixpoint.
Base-class for both propagators and branchers.
Propagator for bounds consistent ternary linear less or equal
Gecode::FloatVal c(-8, 8)
int p
Number of positive literals for node type.
const Gecode::PropCond PC_INT_BND
Propagate when minimum or maximum of a view changes.
static ExecStatus post(Home home, A x0, B x1, C x2, Val c)
Post propagator for .
EqTer(Space &home, EqTer &p)
Constructor for cloning p.
TerMod
Describe which view has been modified how.
#define GECODE_ME_CHECK(me)
Check whether modification event me is failed, and forward failure.
virtual ExecStatus propagate(Space &home, const ModEventDelta &med)
Perform propagation.
static ExecStatus post(Home home, A x0, B x1, C x2, Val c)
Post propagator for .
virtual ExecStatus propagate(Space &home, const ModEventDelta &med)
Perform propagation.
virtual Actor * copy(Space &home)
Create copy during cloning.
Gecode toplevel namespace
LqTer(Space &home, LqTer &p)
Constructor for cloning p.
void reschedule(Space &home, Propagator &p, IntSet &y)
virtual Actor * copy(Space &home)
Create copy during cloning.
Propagator for bounds consistent ternary linear disquality
LinTer(Space &home, LinTer &p)
Constructor for cloning p.
int ModEventDelta
Modification event deltas.
virtual ExecStatus propagate(Space &home, const ModEventDelta &med)
Perform propagation.
Home class for posting propagators
#define GECODE_INT_PV(CASE, TELL, UPDATE)
const Gecode::PropCond PC_INT_VAL
Propagate when a view becomes assigned (single value)