main page
modules
namespaces
classes
files
Gecode home
Generated on Fri Aug 31 2012 16:21:00 for Gecode by
doxygen
1.8.1.2
gecode
int
nvalues
int-lq.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
* Last modified:
10
* $Date: 2011-08-18 17:41:50 +1000 (Thu, 18 Aug 2011) $ by $Author: tack $
11
* $Revision: 12311 $
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
#include <
gecode/int/rel.hh
>
39
#include <
gecode/int/distinct.hh
>
40
41
namespace
Gecode {
namespace
Int {
namespace
NValues {
42
43
template
<
class
VY>
44
forceinline
45
LqInt<VY>::LqInt
(
Home
home,
ValSet
& vs,
ViewArray<IntView>
& x, VY y)
46
:
IntBase
<VY>(home,vs,x,y) {
47
home.
notice
(*
this
,
AP_WEAKLY
);
48
}
49
50
template
<
class
VY>
51
inline
ExecStatus
52
LqInt<VY>::post
(
Home
home,
ViewArray<IntView>
& x, VY y) {
53
if
(x.
size
() == 0) {
54
GECODE_ME_CHECK
(y.eq(home,0));
55
return
ES_OK
;
56
}
57
58
x.
unique
(home);
59
60
GECODE_ME_CHECK
(y.gq(home,1));
61
62
if
(x.
size
() == 1)
63
return
ES_OK
;
64
65
if
(y.max() == 1) {
66
assert(y.assigned());
67
return
Rel::NaryEqDom<IntView>::post
(home,x);
68
}
69
70
if
(y.min() >= x.
size
())
71
return
ES_OK
;
72
73
// Eliminate assigned views and store them into the value set
74
ValSet
vs;
75
int
n = x.
size
();
76
for
(
int
i
=n;
i
--; )
77
if
(x[
i
].
assigned
()) {
78
vs.
add
(home, x[
i
].val());
79
x[
i
] = x[--n];
80
}
81
82
GECODE_ME_CHECK
(y.gq(home,vs.
size
()));
83
84
if
(n == 0) {
85
assert(y.min() >= vs.
size
());
86
return
ES_OK
;
87
}
88
89
x.
size
(n);
90
91
(void)
new
(home)
LqInt<VY>
(home, vs, x, y);
92
return
ES_OK
;
93
}
94
95
template
<
class
VY>
96
forceinline
97
LqInt<VY>::LqInt
(
Space
& home,
bool
share,
LqInt<VY>
& p)
98
:
IntBase
<VY>(home, share, p) {}
99
100
template
<
class
VY>
101
Propagator
*
102
LqInt<VY>::copy
(
Space
& home,
bool
share) {
103
return
new
(home)
LqInt<VY>
(home, share, *
this
);
104
}
105
106
template
<
class
VY>
107
forceinline
size_t
108
LqInt<VY>::dispose
(
Space
& home) {
109
home.
ignore
(*
this
,
AP_WEAKLY
);
110
(void)
IntBase<VY>::dispose
(home);
111
return
sizeof
(*this);
112
}
113
114
template
<
class
VY>
115
ExecStatus
116
LqInt<VY>::propagate
(
Space
& home,
const
ModEventDelta
& med) {
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
123
if
(x.size() == 0)
124
return
home.
ES_SUBSUMED
(*
this
);
125
126
// All values must be in the value set
127
if
(y.max() == vs.size())
128
return
all_in_valset(home);
129
130
if
(x.size() + vs.size() <= y.min())
131
return
home.
ES_SUBSUMED
(*
this
);
132
133
// Compute positions of disjoint views
134
Region
r
(home);
135
int
* dis;
int
n_dis;
136
disjoint
(home,r,dis,n_dis);
137
138
// Some views might have been eliminated as they are subsumed
139
if
(x.size() == 0)
140
return
home.
ES_SUBSUMED
(*
this
);
141
142
// No lower bound pruning possible
143
if
(n_dis == 0)
144
return
ES_NOFIX
;
145
146
// Do lower bound-based pruning
147
GECODE_ES_CHECK
(prune_lower(home,dis,n_dis));
148
149
return
ES_NOFIX
;
150
}
151
152
}}}
153
154
// STATISTICS: int-prop