44 namespace Gecode {
namespace Int {
81 namespace Gecode {
namespace Int {
128 unsigned int width(
void)
const;
168 void dispose(
Space& home);
171 static void*
operator new(
size_t s,
Space& home);
173 static void*
operator new(
size_t s,
void*
p);
175 static void operator delete(
void*);
177 static void operator delete(
void*,
Space&);
179 static void operator delete(
void*,
void*);
225 unsigned int size(
void)
const;
227 unsigned int width(
void)
const;
229 unsigned int regret_min(
void)
const;
231 unsigned int regret_max(
void)
const;
241 bool range(
void)
const;
247 bool in(
int n)
const;
249 bool in(
long long int n)
const;
263 bool closer_min(
int b)
const;
378 static int min(
const Delta&
d);
381 static int max(
const Delta&
d);
383 static bool any(
const Delta&
d);
411 bool operator ()(
void)
const;
414 void operator ++(
void);
424 unsigned int width(
void)
const;
454 bool operator ()(
void)
const;
457 void operator ++(
void);
467 unsigned int width(
void)
const;
481 namespace Gecode {
namespace Int {
492 friend class ::Gecode::BoolVar;
518 static const int BITS = 2;
521 static const BoolStatus ZERO = 0;
523 static const BoolStatus ONE = 3;
525 static const BoolStatus NONE = 2;
527 BoolStatus status(
void)
const;
542 unsigned int size(
void)
const;
544 unsigned int width(
void)
const;
546 unsigned int regret_min(
void)
const;
548 unsigned int regret_max(
void)
const;
553 bool zero(
void)
const;
556 bool one(
void)
const;
558 bool none(
void)
const;
563 bool range(
void)
const;
569 bool in(
int n)
const;
571 bool in(
long long int n)
const;
700 static int min(
const Delta&
d);
702 static int max(
const Delta&
d);
704 static bool any(
const Delta&
d);
706 static bool zero(
const Delta&
d);
const FloatNum max
Largest allowed float value.
bool one(const Gecode::FloatValArgs &a)
Check whether has only one coefficients.
void cancel(Space &home, Propagator &p, IntSet &y)
unsigned int BoolStatus
Type for status of a Boolean variable.
RangeList * _lst
Link the last element.
bool any(const View &x)
Test whether x is neither positive nor negative.
int ModEvent
Type for modification events.
Base-class for propagators.
Base-class for Int-variable implementations.
Boolean variable implementation.
struct Gecode::@579::NNF::@61::@63 a
For atomic nodes.
Gecode::FloatVal c(-8, 8)
int _max
Maximum of range.
int p
Number of positive literals for node type.
const FloatNum min
Smallest allowed float value.
Gecode::IntArgs i(4, 1, 2, 3, 4)
int n
Number of negative literals for node type.
int PropCond
Type for propagation conditions.
void subscribe(Space &home, Propagator &p, IntSet &y)
unsigned int size(I &i)
Size of all ranges of range iterator i.
struct Gecode::@579::NNF::@61::@62 b
For binary nodes (and, or, eqv)
void range(Home home, const IntVarArgs &x, SetVar y, SetVar z)
Post constraint .
Range iterator for ranges of integer variable implementation.
Backward iterator for ranges of integer variable implementations.
unsigned int holes
Size of holes in the domain.
Boolean integer variables.
Integer delta information for advisors.
Post propagator for f(x \diamond_{\mathit{op}} y) \sim_r z \f$ void rel(Home home
Integer variable implementation.
RangeList dom
Domain information.
Generic domain change information to be supplied to advisors.
Lists of ranges (intervals)
bool assigned(View x, int v)
Whether x is assigned to value v.
IntDelta(void)
Create integer delta as providing no information.
Base-class for Bool-variable implementations.
Base-class for freelist-managed objects.
Post propagator for SetVar x
Gecode toplevel namespace
int _min
Minimum of range.
#define GECODE_INT_EXPORT
void reschedule(Space &home, Propagator &p, IntSet &y)
int ModEventDelta
Modification event deltas.