44 #ifndef __GECODE_INT_REL_HH__ 45 #define __GECODE_INT_REL_HH__ 54 namespace Gecode {
namespace Int {
namespace Rel {
70 template<
class View0,
class View1>
106 template<
class View0,
class View1>
203 template<
class View,
int o>
243 static void*
operator new(
size_t s,
Space& home);
245 static void operator delete(
void*
p);
247 static void operator delete(
void*
p,
Space& home);
253 bool empty(
void)
const;
255 int pop(
Space& home);
257 void push(
Space& home,
int p);
263 static const int n_threshold = 7;
317 template<
class View,
class CtrlView, ReifyMode rm>
343 template<
class View,
class CtrlView, ReifyMode rm>
369 template<
class View,
class CtrlView, ReifyMode rm>
396 template<
class View,
class CtrlView, ReifyMode rm>
521 template<
class View,
class CtrlView, ReifyMode rm>
548 template<
class View,
class CtrlView, ReifyMode rm>
636 RelTest rt, View& x0, View& y0, View x1, View y1);
bool empty(void) const
Test whether actor link is empty (points to itself)
virtual ExecStatus propagate(Space &home, const ModEventDelta &med)
Perform propagation.
int c
Integer constant to check.
Binary domain consistent equality propagator.
ActorLink * next(void) const
Routines for double-linked list.
View0 x0
View of type View0.
Reified unary propagator.
ExecStatus resubscribe(Space &home, Propagator &p, VX &x0, ViewArray< VX > &x, VY &x1, ViewArray< VY > &y)
int n_subsumed
Number of already subsumed advisors (or views)
Reified binary propagator.
static ExecStatus post(Home home, View0 x0, View1 x1)
Post domain consistent propagator .
int c
Integer constant to check.
int p
Position of view in view array.
Reified less or equal with integer propagator.
Base-class for propagators.
Lexical disequality propagator.
n-ary domain consistent equality propagator
View1 x1
View of type View1.
Base-class for both propagators and branchers.
bool run
Whether the propagator is currently running.
Reified less or equal propagator.
Nary disequality propagator.
int c
Integer constant to check.
Gecode::FloatVal c(-8, 8)
int p
Number of positive literals for node type.
int n
Number of negative literals for node type.
Council< Index > c
The advisor council.
RelTest
Result of testing relation.
Reified binary domain consistent equality propagator.
virtual Actor * copy(Space &home, bool share)
Copy propagator during cloning.
ModEventDelta med
A set of modification events (used during propagation)
Binary bounds consistent equality propagator.
Less or equal propagator.
Reified binary bounds consistent equality propagator.
virtual ExecStatus advise(Space &home, Advisor &a, const Delta &d)
Advise function.
struct Gecode::@519::NNF::@60::@62 a
For atomic nodes.
EqDom(Space &home, bool share, EqDom< View0, View1 > &p)
Constructor for cloning p.
n-ary less and less or equal propagator
Reified bounds consistent equality with integer propagator.
struct Gecode::@519::NNF::@60::@61 b
For binary nodes (and, or, eqv)
Node * x
Pointer to corresponding Boolean expression node.
Generic domain change information to be supplied to advisors.
Lexical ordering propagator.
bool strict
Determines whether propagator is strict or not.
Base-class for freelist-managed objects.
Binary disequality propagator.
virtual PropCost cost(const Space &home, const ModEventDelta &med) const
Cost function.
Positions in view array that have to be propagated.
n-ary bounds consistent equality propagator
int i
The position of the view in the view array.
Gecode toplevel namespace
Advisors for views (by position in array)
int ModEventDelta
Modification event deltas.
Reified domain consistent equality with integer propagator.
Home class for posting propagators
virtual size_t dispose(Space &home)
Delete propagator and return its size.
Pos * pos
Stack of positions.