main page
modules
namespaces
classes
files
Gecode home
Generated on Sat May 25 2013 18:00:33 for Gecode by
doxygen
1.8.3.1
gecode
int
dom.cpp
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, 2004
8
*
9
* Last modified:
10
* $Date: 2013-03-05 13:52:08 +0100 (Tue, 05 Mar 2013) $ by $Author: schulte $
11
* $Revision: 13434 $
12
*
13
* This file is part of Gecode, the generic constraint
14
* development environment:
15
* http://www.gecode.org
16
*
17
* Permission is hereby granted, free of charge, to any person obtaining
18
* a copy of this software and associated documentation files (the
19
* "Software"), to deal in the Software without restriction, including
20
* without limitation the rights to use, copy, modify, merge, publish,
21
* distribute, sublicense, and/or sell copies of the Software, and to
22
* permit persons to whom the Software is furnished to do so, subject to
23
* the following conditions:
24
*
25
* The above copyright notice and this permission notice shall be
26
* included in all copies or substantial portions of the Software.
27
*
28
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
29
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
30
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
31
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
32
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
33
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
34
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
35
*
36
*/
37
38
39
#include <
gecode/int/dom.hh
>
40
#include <
gecode/int/rel.hh
>
41
42
namespace
Gecode {
43
44
void
45
dom
(
Home
home,
IntVar
x
,
int
n
,
IntConLevel
) {
46
using namespace
Int;
47
Limits::check
(n,
"Int::dom"
);
48
if
(home.
failed
())
return
;
49
IntView
xv(x);
50
GECODE_ME_FAIL
(xv.
eq
(home,n));
51
}
52
53
void
54
dom
(
Home
home,
const
IntVarArgs
&
x
,
int
n
,
IntConLevel
) {
55
using namespace
Int;
56
Limits::check
(n,
"Int::dom"
);
57
if
(home.
failed
())
return
;
58
for
(
int
i
=x.
size
();
i
--; ) {
59
IntView
xv(x[
i
]);
60
GECODE_ME_FAIL
(xv.
eq
(home,n));
61
}
62
}
63
64
void
65
dom
(
Home
home,
IntVar
x
,
int
min
,
int
max
,
IntConLevel
) {
66
using namespace
Int;
67
Limits::check
(min,
"Int::dom"
);
68
Limits::check
(max,
"Int::dom"
);
69
if
(home.
failed
())
return
;
70
IntView
xv(x);
71
GECODE_ME_FAIL
(xv.
gq
(home,min));
72
GECODE_ME_FAIL
(xv.
lq
(home,max));
73
}
74
75
void
76
dom
(
Home
home,
const
IntVarArgs
&
x
,
int
min
,
int
max
,
IntConLevel
) {
77
using namespace
Int;
78
Limits::check
(min,
"Int::dom"
);
79
Limits::check
(max,
"Int::dom"
);
80
if
(home.
failed
())
return
;
81
for
(
int
i
=x.
size
();
i
--; ) {
82
IntView
xv(x[
i
]);
83
GECODE_ME_FAIL
(xv.
gq
(home,min));
84
GECODE_ME_FAIL
(xv.
lq
(home,max));
85
}
86
}
87
88
void
89
dom
(
Home
home,
IntVar
x
,
const
IntSet
& is,
IntConLevel
) {
90
using namespace
Int;
91
Limits::check
(is.
min
(),
"Int::dom"
);
92
Limits::check
(is.
max
(),
"Int::dom"
);
93
if
(home.
failed
())
return
;
94
IntView
xv(x);
95
IntSetRanges
ris(is);
96
GECODE_ME_FAIL
(xv.
inter_r
(home,ris,
false
));
97
}
98
99
void
100
dom
(
Home
home,
const
IntVarArgs
&
x
,
const
IntSet
& is,
IntConLevel
) {
101
using namespace
Int;
102
Limits::check
(is.
min
(),
"Int::dom"
);
103
Limits::check
(is.
max
(),
"Int::dom"
);
104
if
(home.
failed
())
return
;
105
for
(
int
i
= x.
size
();
i
--; ) {
106
IntSetRanges
ris(is);
107
IntView
xv(x[
i
]);
108
GECODE_ME_FAIL
(xv.
inter_r
(home,ris,
false
));
109
}
110
}
111
112
void
113
dom
(
Home
home,
IntVar
x
,
int
n
,
Reify
r
,
IntConLevel
) {
114
using namespace
Int;
115
Limits::check
(n,
"Int::dom"
);
116
if
(home.
failed
())
return
;
117
switch
(r.
mode
()) {
118
case
RM_EQV
:
119
GECODE_ES_FAIL
((
Rel::ReEqDomInt<IntView,BoolView,RM_EQV>
120
::
post
(home,x,n,r.
var
())));
121
break
;
122
case
RM_IMP
:
123
GECODE_ES_FAIL
((
Rel::ReEqDomInt<IntView,BoolView,RM_IMP>
124
::
post
(home,x,n,r.
var
())));
125
break
;
126
case
RM_PMI
:
127
GECODE_ES_FAIL
((
Rel::ReEqDomInt<IntView,BoolView,RM_PMI>
128
::
post
(home,x,n,r.
var
())));
129
break
;
130
default
:
throw
UnknownReifyMode
(
"Int::dom"
);
131
}
132
}
133
134
void
135
dom
(
Home
home,
IntVar
x
,
int
min
,
int
max
,
Reify
r
,
IntConLevel
) {
136
using namespace
Int;
137
Limits::check
(min,
"Int::dom"
);
138
Limits::check
(max,
"Int::dom"
);
139
if
(home.
failed
())
return
;
140
switch
(r.
mode
()) {
141
case
RM_EQV
:
142
GECODE_ES_FAIL
((
Dom::ReRange<IntView,RM_EQV>
143
::
post
(home,x,min,max,r.
var
())));
144
break
;
145
case
RM_IMP
:
146
GECODE_ES_FAIL
((
Dom::ReRange<IntView,RM_IMP>
147
::
post
(home,x,min,max,r.
var
())));
148
break
;
149
case
RM_PMI
:
150
GECODE_ES_FAIL
((
Dom::ReRange<IntView,RM_PMI>
151
::
post
(home,x,min,max,r.
var
())));
152
break
;
153
default
:
throw
UnknownReifyMode
(
"Int::dom"
);
154
}
155
}
156
157
158
void
159
dom
(
Home
home,
IntVar
x
,
const
IntSet
& is,
Reify
r
,
IntConLevel
) {
160
using namespace
Int;
161
Limits::check
(is.
min
(),
"Int::dom"
);
162
Limits::check
(is.
max
(),
"Int::dom"
);
163
if
(home.
failed
())
return
;
164
switch
(r.
mode
()) {
165
case
RM_EQV
:
166
GECODE_ES_FAIL
((
Dom::ReIntSet<IntView,RM_EQV>::post
(home,x,is,r.
var
())));
167
break
;
168
case
RM_IMP
:
169
GECODE_ES_FAIL
((
Dom::ReIntSet<IntView,RM_IMP>::post
(home,x,is,r.
var
())));
170
break
;
171
case
RM_PMI
:
172
GECODE_ES_FAIL
((
Dom::ReIntSet<IntView,RM_PMI>::post
(home,x,is,r.
var
())));
173
break
;
174
default
:
throw
UnknownReifyMode
(
"Int::dom"
);
175
}
176
}
177
178
void
179
dom
(
Home
home,
IntVar
x
,
IntVar
d
,
IntConLevel
) {
180
using namespace
Int;
181
if
(home.
failed
())
return
;
182
IntView
xv(x), dv(d);
183
if
(!
same
(xv,dv)) {
184
ViewRanges<IntView>
r
(dv);
185
GECODE_ME_FAIL
(xv.inter_r(home,r,
false
));
186
}
187
}
188
189
void
190
dom
(
Home
home,
BoolVar
x
,
BoolVar
d
,
IntConLevel
) {
191
using namespace
Int;
192
if
(home.
failed
())
return
;
193
if
(d.
one
())
194
GECODE_ME_FAIL
(
BoolView
(x).
one
(home));
195
else
if
(d.
zero
())
196
GECODE_ME_FAIL
(
BoolView
(x).
zero
(home));
197
}
198
199
void
200
dom
(
Home
home,
const
IntVarArgs
&
x
,
const
IntVarArgs
&
d
,
IntConLevel
) {
201
using namespace
Int;
202
if
(x.
size
() != d.
size
())
203
throw
ArgumentSizeMismatch
(
"Int::dom"
);
204
for
(
int
i
=x.
size
();
i
--; ) {
205
if
(home.
failed
())
return
;
206
IntView
xv(x[
i
]), dv(d[i]);
207
if
(!
same
(xv,dv)) {
208
ViewRanges<IntView>
r
(dv);
209
GECODE_ME_FAIL
(xv.inter_r(home,r,
false
));
210
}
211
}
212
}
213
214
void
215
dom
(
Home
home,
const
BoolVarArgs
&
x
,
const
BoolVarArgs
&
d
,
IntConLevel
) {
216
using namespace
Int;
217
if
(x.
size
() != d.
size
())
218
throw
ArgumentSizeMismatch
(
"Int::dom"
);
219
for
(
int
i
=x.
size
();
i
--; ) {
220
if
(home.
failed
())
return
;
221
if
(d[
i
].
one
())
222
GECODE_ME_FAIL
(
BoolView
(x[
i
]).
one
(home));
223
else
if
(d[i].zero())
224
GECODE_ME_FAIL
(
BoolView
(x[i]).
zero
(home));
225
}
226
}
227
228
}
229
230
// STATISTICS: int-post
231