39 namespace Gecode {
namespace Int {
namespace GCC {
103 for (
int i = k.
size();
i--; ) {
104 removed += k[
i].counter();
105 sum_min += k[
i].min();
111 for (
int i = k.
size();
i--; )
117 for (
int i = x.
size();
i--; )
129 for (
int i = k.
size();
i--; )
143 for (
int i = k.
size();
i--; ) {
144 int ci = count[
i] + k[
i].counter();
160 if ((req == non) && (n_r == 1)) {
162 for (
int i = x.
size();
i--; ) {
166 assert((single >= 0) && (single < k.
size()));
170 assert((single >= 0) && (single < k.
size()));
172 for (
int i = k.
size();
i--; )
180 for (
int i = k.
size();
i--; ) {
181 int ci = count[
i] + k[
i].counter();
182 if (ci == k[
i].
max()) {
184 rem.
set(static_cast<unsigned int>(
i));
189 if (ci > k[
i].
max()) {
194 if (Card::propagate) {
196 int occupied = t_noa -
ci;
207 for (
int i = n_x;
i--; ) {
213 if (rem.
get(static_cast<unsigned int>(idx)))
223 int* pr = r.alloc<
int>(k.
size());
227 pr[n_pr++] = k[
i.val()].card();
229 for (
int i = x.
size();
i--;) {
236 bool all_assigned =
true;
238 for (
int i = x.
size();
i--; ) {
246 all_assigned =
false;
251 for (
int i = k.
size();
i--; )
257 if (Card::propagate) {
261 for (
int i = k.
size();
i--; ) {
262 if (k[
i].counter() > k[
i].max()) {
265 allmax += k[
i].max() - k[
i].counter();
266 if (k[
i].counter() < k[
i].
min())
267 reqmin += k[
i].min() - k[
i].counter();
271 if ((x.
size() < reqmin) || (allmax < x.
size())) {
282 return prop_val<Card>(home, *
this,
x,
k);
291 if (isDistinct<Card>(x,k))
bool get(unsigned int i) const
Access value at bit i.
ViewArray< Card > k
Array containing either fixed cardinalities or CardViews.
Value consistent global cardinality propagator.
void reschedule(Space &home, Propagator &p, PropCond pc)
Re-schedule propagator p with propagation condition pc.
static ExecStatus post(Home home, ViewArray< IntView > &x, ViewArray< Card > &k)
Post propagator for views x and cardinalities k.
static PropCost linear(PropCost::Mod m, unsigned int n)
Linear complexity for modifier pcm and size measure n.
void update(Space &home, ViewArray< View > &a)
Update array to be a clone of array a.
ExecStatus ES_SUBSUMED(Propagator &p)
void count(Home home, const IntVarArgs &x, int n, IntRelType irt, int m, IntPropLevel)
Post propagator for .
Value iterator for array of integers
bool lookupValue(T &a, int v, int &i)
Return index of v in array a.
void max(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Val(Home home, ViewArray< IntView > &x, ViewArray< Card > &k)
Constructor for posting.
Base-class for propagators.
void subscribe(Space &home, Propagator &p, PropCond pc, bool schedule=true)
Subscribe propagator p with propagation condition pc to variable.
virtual PropCost cost(const Space &home, const ModEventDelta &med) const
Cost funtion returning high linear.
const unsigned int card
Maximum cardinality of an integer set.
Base-class for both propagators and branchers.
Value iterator for values in a bitset.
ViewArray< IntView > x
Views on which to perform value-propagation.
#define GECODE_ES_CHECK(es)
Check whether execution status es is failed or subsumed, and forward failure or subsumption.
int p
Number of positive literals for node type.
virtual size_t dispose(Space &home)
Destructor.
Gecode::IntArgs i(4, 1, 2, 3, 4)
void quicksort(Type *l, Type *r, Less &less)
Standard quick sort.
Execution has resulted in failure.
ExecStatus prop_val(Space &home, Propagator &p, ViewArray< IntView > &x, ViewArray< Card > &k)
virtual void reschedule(Space &home)
Schedule function.
virtual ExecStatus propagate(Space &home, const ModEventDelta &med)
Perform propagation.
void set(unsigned int i)
Set bit i.
void cancel(Space &home, Propagator &p, PropCond pc)
Cancel subscription of propagator p with propagation condition pc to all views.
#define GECODE_ME_CHECK(me)
Check whether modification event me is failed, and forward failure.
static ExecStatus post(Home home, ViewArray< View > &x)
Post propagator for view array x.
Post propagator for SetVar SetOpType SetVar SetRelType r
void min(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
virtual Actor * copy(Space &home)
Copy propagator during cloning.
virtual size_t dispose(Space &home)
Delete actor and return its size.
bool assigned(View x, int v)
Whether x is assigned to value v.
Post propagator for SetVar x
Propagation has not computed fixpoint.
Gecode toplevel namespace
int size(void) const
Return size of array (number of elements)
int ModEventDelta
Modification event deltas.
Home class for posting propagators
const Gecode::PropCond PC_INT_VAL
Propagate when a view becomes assigned (single value)