Generated on Thu Jan 16 2025 00:00:00 for Gecode by doxygen 1.14.0
int-eq.hpp
Go to the documentation of this file.
1/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
2/*
3 * Main authors:
4 * Christian Schulte <schulte@gecode.org>
5 *
6 * Copyright:
7 * Christian Schulte, 2011
8 *
9 * This file is part of Gecode, the generic constraint
10 * development environment:
11 * http://www.gecode.org
12 *
13 * Permission is hereby granted, free of charge, to any person obtaining
14 * a copy of this software and associated documentation files (the
15 * "Software"), to deal in the Software without restriction, including
16 * without limitation the rights to use, copy, modify, merge, publish,
17 * distribute, sublicense, and/or sell copies of the Software, and to
18 * permit persons to whom the Software is furnished to do so, subject to
19 * the following conditions:
20 *
21 * The above copyright notice and this permission notice shall be
22 * included in all copies or substantial portions of the Software.
23 *
24 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
28 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
29 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
30 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
31 *
32 */
33
34#include <gecode/int/rel.hh>
36
37namespace Gecode { namespace Int { namespace NValues {
38
39 template<class VY>
42 : IntBase<VY>(home,vs,x,y) {
43 home.notice(*this, AP_WEAKLY);
44 }
45
46 template<class VY>
47 inline ExecStatus
49 if (x.size() == 0) {
50 GECODE_ME_CHECK(y.eq(home,0));
51 return ES_OK;
52 }
53
54 x.unique();
55
56 if (x.size() == 1) {
57 GECODE_ME_CHECK(y.eq(home,1));
58 return ES_OK;
59 }
60
61 GECODE_ME_CHECK(y.gq(home,1));
62 GECODE_ME_CHECK(y.lq(home,x.size()));
63
64 if (y.max() == 1) {
65 assert(y.assigned());
67 }
68
69 if (y.min() == x.size()) {
70 assert(y.assigned());
72 }
73
74 // Eliminate assigned views and store them into the value set
75 ValSet vs;
76 int n = x.size();
77 for (int i=n; i--; )
78 if (x[i].assigned()) {
79 vs.add(home, x[i].val());
80 x[i] = x[--n];
81 }
82
83 GECODE_ME_CHECK(y.gq(home,vs.size()));
84 GECODE_ME_CHECK(y.lq(home,n + vs.size()));
85
86 if (n == 0) {
87 assert(y.val() == vs.size());
88 return ES_OK;
89 }
90 x.size(n);
91 (void) new (home) EqInt<VY>(home, vs, x, y);
92 return ES_OK;
93 }
94
95 template<class VY>
98 : IntBase<VY>(home, p) {}
99
100 template<class VY>
103 return new (home) EqInt<VY>(home, *this);
104 }
105
106 template<class VY>
107 forceinline size_t
109 home.ignore(*this, AP_WEAKLY);
110 (void) IntBase<VY>::dispose(home);
111 return sizeof(*this);
112 }
113
114 template<class VY>
117 // Add assigned views to value set
118 if (IntView::me(med) == ME_INT_VAL)
119 add(home);
120
121 GECODE_ME_CHECK(y.gq(home, vs.size()));
122 GECODE_ME_CHECK(y.lq(home, x.size() + vs.size()));
123
124 if (x.size() == 0)
125 return home.ES_SUBSUMED(*this);
126
127 // All values must be in the value set
128 if (y.max() == vs.size())
129 return all_in_valset(home);
130
131 // Compute positions of disjoint views and eliminate subsumed views
132 Region r;
133 int* dis; int n_dis;
134 disjoint(home,r,dis,n_dis);
135
136 // The number might have changed due to elimination of subsumed views
137 GECODE_ME_CHECK(y.lq(home, x.size() + vs.size()));
138
139 if (x.size() == 0) {
140 assert(y.val() == vs.size());
141 return home.ES_SUBSUMED(*this);
142 }
143
145
146 // No lower bound pruning possible
147 if (n_dis == 0)
148 return ES_NOFIX;
149
150 // Only if the propagator is at fixpoint here, continue with
151 // propagating the lower bound
153 return ES_NOFIX;
154
155 // Do lower bound-based pruning
156 GECODE_ES_CHECK(prune_lower(home,dis,n_dis));
157
158 return ES_NOFIX;
159 }
160
161}}}
162
163// STATISTICS: int-prop
Home class for posting propagators
Definition core.hpp:856
void notice(Actor &a, ActorProperty p, bool duplicate=false)
Notice actor property.
Definition core.hpp:3223
static ExecStatus post(Home home, ViewArray< View > &x)
Post propagator for views x.
Definition dom.hpp:45
EqInt(Home home, ValSet &vs, ViewArray< IntView > &x, VY y)
Constructor for posting.
Definition int-eq.hpp:41
virtual Propagator * copy(Space &home)
Copy propagator during cloning.
Definition int-eq.hpp:102
virtual size_t dispose(Space &home)
Delete propagator and return its size.
Definition int-eq.hpp:108
static ExecStatus post(Home home, ViewArray< IntView > &x, VY y)
Post propagator for .
Definition int-eq.hpp:48
virtual ExecStatus propagate(Space &home, const ModEventDelta &med)
Perform propagation.
Definition int-eq.hpp:116
Graph g
View-value graph.
Definition nvalues.hh:196
virtual size_t dispose(Space &home)
Delete propagator and return its size.
Definition int-base.hpp:53
ValSet vs
Value set storing the values of already assigned views.
Definition nvalues.hh:138
ExecStatus prune_lower(Space &home, int *dis, int n_dis)
Definition int-base.hpp:130
void disjoint(Space &home, Region &r, int *&dis, int &n_dis)
Definition int-base.hpp:80
void add(Space &home)
Add values of assigned views to value set.
Definition int-base.hpp:68
ExecStatus all_in_valset(Space &home)
Propagate that all views must take values from value set.
Definition int-base.hpp:120
ExecStatus prune_upper(Space &home, Graph &g)
Definition int-base.hpp:298
IntBase(Home home, ValSet &vs, ViewArray< IntView > &x, VY y)
Constructor for posting.
Definition int-base.hpp:40
static ExecStatus post(Home home, ViewArray< View > &x)
Post domain consistent propagator .
Definition eq.hpp:270
Class for storing values of already assigned views.
Definition val-set.hh:44
Base-class for propagators.
Definition core.hpp:1066
friend class Space
Definition core.hpp:1068
ModEventDelta modeventdelta(void) const
Return the modification event delta.
Definition core.hpp:3527
ModEventDelta med
A set of modification events (used during propagation)
Definition core.hpp:1077
Handle to region.
Definition region.hpp:55
static ModEvent me(const ModEventDelta &med)
Definition view.hpp:552
View arrays.
Definition array.hpp:253
ExecStatus ES_SUBSUMED(Propagator &p)
Propagator p is subsumed
Definition core.hpp:3570
void ignore(Actor &a, ActorProperty p, bool duplicate=false)
Ignore actor property.
Definition core.hpp:4081
int ModEventDelta
Modification event deltas.
Definition core.hpp:89
#define GECODE_ME_CHECK(me)
Check whether modification event me is failed, and forward failure.
Definition macros.hpp:52
#define GECODE_ES_CHECK(es)
Check whether execution status es is failed or subsumed, and forward failure or subsumption.
Definition macros.hpp:91
@ AP_WEAKLY
Definition core.hpp:568
Number of values propagators.
Finite domain integers.
const Gecode::ModEvent ME_INT_VAL
Domain operation has resulted in a value (assigned variable)
Definition var-type.hpp:56
const Gecode::ModEvent ME_INT_NONE
Domain operation has not changed domain.
Definition var-type.hpp:54
Gecode toplevel namespace
Post propagator for SetVar SetOpType SetVar SetRelType r
Definition set.hh:773
ExecStatus
Definition core.hpp:472
@ ES_OK
Execution is okay.
Definition core.hpp:476
@ ES_NOFIX
Propagation has not computed fixpoint.
Definition core.hpp:475
#define forceinline
Definition config.hpp:194