/usr/include/gecode/set/rel/lq.hpp is in libgecode-dev 4.2.1-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 | /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Guido Tack <tack@gecode.org>
*
* Copyright:
* Guido Tack, 2011
*
* Last modified:
* $Date: 2013-02-08 16:47:00 +0100 (Fri, 08 Feb 2013) $ by $Author: schulte $
* $Revision: 13278 $
*
* This file is part of Gecode, the generic constraint
* development environment:
* http://www.gecode.org
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
*/
namespace Gecode { namespace Set { namespace Rel {
/**
* \brief Representation of the characteristic functions of two sets
*/
class CharacteristicSets {
protected:
/// Size of the combined upper bounds
unsigned int xsize;
/// Storage for the characteristic functions
Support::BitSetBase b;
/// Elements in the combined upper bounds
int* ub;
/// Whether lower bound of x was updated
bool xlm;
/// Whether upper bound of x was updated
bool xum;
/// Whether lower bound of y was updated
bool ylm;
/// Whether upper bound of y was updated
bool yum;
/// Set bit \a i to value \a j
void set(int i, bool j) {
if (j)
b.set(i);
else
b.clear(i);
}
/// \brief Value iterator for characteristic function
class CSIter {
public:
/// Pointer to the underlying set
CharacteristicSets* cs;
/// Current position
unsigned int i;
/// Offset from start of bitset
int xoff;
/// Offset for each element (0=lower bound, 1=upper bound)
int yoff;
/// Move iterator to next element
void operator++ (void) {
i++;
while (i<cs->xsize && !cs->b.get(xoff+2*i+yoff))
i++;
}
/// Default constructor
CSIter(void) {}
/// Constructor
CSIter(CharacteristicSets& cs0, int xoff0, int yoff0)
: cs(&cs0), i(static_cast<unsigned int>(-1)),
xoff(xoff0), yoff(yoff0) {
++(*this);
}
/// Test if iterator is finished
bool operator() (void) const { return i<cs->xsize; }
/// Value of current iterator position
int val(void) const { return cs->ub[i]; }
};
public:
/// Constructor
template<class View0, class View1>
CharacteristicSets(Region& re, View0 x, View1 y);
/// Return minimum of element \a i for variable x
bool xmin(int i) const { return b.get(2*i); }
/// Return maximum of element \a i for variable x
bool xmax(int i) const { return b.get(2*i+1); }
/// Return minimum of element \a i for variable y
bool ymin(int i) const { return b.get(2*xsize+2*i); }
/// Return maximum of element \a i for variable y
bool ymax(int i) const { return b.get(2*xsize+2*i+1); }
/// Set minimum of element \a i for variable x to \a j
void xmin(int i, bool j) { set(2*i,j); }
/// Set maximum of element \a i for variable x to \a j
void xmax(int i, bool j) { set(2*i+1,j); }
/// Set minimum of element \a i for variable y to \a j
void ymin(int i, bool j) { set(2*xsize+2*i,j); }
/// Set maximum of element \a i for variable y to \a j
void ymax(int i, bool j) { set(2*xsize+2*i+1,j); }
/// Update upper bound of \f$x_i\f$ to \a j
ModEvent xlq(int i, bool j) {
if (!j) {
if (xmin(i)) return ME_SET_FAILED;
if (xmax(i)) {
xmax(i,false);
xum=true;
}
}
return ME_SET_NONE;
}
/// Update lower bound of \f$x_i\f$ to \a j
ModEvent xgq(int i, bool j) {
if (j) {
if (!xmax(i)) return ME_SET_FAILED;
if (!xmin(i)) {
xmin(i,true);
xlm=true;
}
}
return ME_SET_NONE;
}
/// Update upper bound of \f$y_i\f$ to \a j
ModEvent ylq(int i, bool j) {
if (!j) {
if (ymin(i)) return ME_SET_FAILED;
if (ymax(i)) {
ymax(i,false);
yum=true;
}
}
return ME_SET_NONE;
}
/// Update lower bound of \f$y_i\f$ to \a j
ModEvent ygq(int i, bool j) {
if (j) {
if (!ymax(i)) return ME_SET_FAILED;
if (!ymin(i)) {
ymin(i,true);
ylm=true;
}
}
return ME_SET_NONE;
}
/// Return size of combined upper bounds
int size(void) const { return xsize; }
/// Prune \a x and \a y using computed bounds
template<class View0, class View1>
ExecStatus prune(Space& home, View0 x, View1 y) {
if (xlm) {
CSIter i(*this,0,0);
Iter::Values::ToRanges<CSIter> ir(i);
GECODE_ME_CHECK(x.includeI(home,ir));
}
if (xum) {
CSIter i(*this,0,1);
Iter::Values::ToRanges<CSIter> ir(i);
GECODE_ME_CHECK(x.intersectI(home,ir));
}
if (ylm) {
CSIter i(*this,2*xsize,0);
Iter::Values::ToRanges<CSIter> ir(i);
GECODE_ME_CHECK(y.includeI(home,ir));
}
if (yum) {
CSIter i(*this,2*xsize,1);
Iter::Values::ToRanges<CSIter> ir(i);
GECODE_ME_CHECK(y.intersectI(home,ir));
}
return ES_OK;
}
};
template<class View0, class View1>
CharacteristicSets::CharacteristicSets(Region& re,View0 x, View1 y)
: xlm(false), xum(false), ylm(false), yum(false) {
LubRanges<View0> xlub(x);
LubRanges<View1> ylub(y);
Iter::Ranges::Union<LubRanges<View0>,LubRanges<View1> > xylub(xlub,ylub);
Iter::Ranges::Cache xylubc(re,xylub);
xsize = Iter::Ranges::size(xylubc);
b.init(re,4*xsize);
ub = re.alloc<int>(xsize);
xylubc.reset();
Iter::Ranges::ToValues<Iter::Ranges::Cache> xylubv(xylubc);
LubRanges<View0> xur(x);
GlbRanges<View0> xlr(x);
LubRanges<View1> yur(y);
GlbRanges<View1> ylr(y);
Iter::Ranges::ToValues<LubRanges<View0> > xuv(xur);
Iter::Ranges::ToValues<GlbRanges<View0> > xlv(xlr);
Iter::Ranges::ToValues<LubRanges<View1> > yuv(yur);
Iter::Ranges::ToValues<GlbRanges<View1> > ylv(ylr);
for (int i=0; xylubv(); ++xylubv, ++i) {
ub[i] = xylubv.val();
if (xlv() && xylubv.val()==xlv.val()) {
b.set(2*i);
++xlv;
}
if (xuv() && xylubv.val()==xuv.val()) {
b.set(2*i+1);
++xuv;
}
if (ylv() && xylubv.val()==ylv.val()) {
b.set(2*xsize+2*i);
++ylv;
}
if (yuv() && xylubv.val()==yuv.val()) {
b.set(2*xsize+2*i+1);
++yuv;
}
}
}
template<class View0, class View1, bool strict>
forceinline
Lq<View0,View1,strict>::Lq(Home home, View0 x, View1 y)
: MixBinaryPropagator<View0,PC_SET_ANY,View1,PC_SET_ANY>(home,x,y) {}
template<class View0, class View1, bool strict>
forceinline
Lq<View0,View1,strict>::Lq(Space& home, bool share, Lq& p)
: MixBinaryPropagator<View0,PC_SET_ANY,View1,PC_SET_ANY>(home,share,p) {}
template<class View0, class View1, bool strict>
ExecStatus
Lq<View0,View1,strict>::post(Home home, View0 x, View1 y) {
if (strict)
GECODE_ME_CHECK(y.cardMin(home,1));
(void) new (home) Lq(home,x,y);
return ES_OK;
}
template<class View0, class View1, bool strict>
Actor*
Lq<View0,View1,strict>::copy(Space& home, bool share) {
return new (home) Lq(home,share,*this);
}
template<class View0, class View1, bool strict>
ExecStatus
Lq<View0,View1,strict>::propagate(Space& home, const ModEventDelta&) {
if ( (!strict) && x1.cardMax()==0) {
GECODE_ME_CHECK(x0.cardMax(home,0));
}
if (x0.cardMax()==0) {
return home.ES_SUBSUMED(*this);
}
if (x0.glbMin() < x1.lubMin())
return ES_FAILED;
if (x1.glbMin() < x0.lubMin())
return home.ES_SUBSUMED(*this);
bool assigned = x0.assigned() && x1.assigned();
Region re(home);
CharacteristicSets cs(re,x0,x1);
/*
* State 1
*
*/
int i=0;
int firsti=0;
int n=cs.size();
while ((i<n) && cs.xmin(i) == cs.ymax(i)) {
// case: =, >=
GECODE_ME_CHECK(cs.xlq(i,cs.ymax(i)));
GECODE_ME_CHECK(cs.ygq(i,cs.xmin(i)));
i++;
}
if (i == n) {// case: $
if (strict) {
return ES_FAILED;
} else {
GECODE_ES_CHECK(cs.prune(home,x0,x1));
return home.ES_SUBSUMED(*this);
}
}
// Possible cases left: <, <=, > (yields failure), ?
GECODE_ME_CHECK(cs.xlq(i,cs.ymax(i)));
GECODE_ME_CHECK(cs.ygq(i,cs.xmin(i)));
if (cs.xmax(i) < cs.ymin(i)) { // case: < (after tell)
GECODE_ES_CHECK(cs.prune(home,x0,x1));
return home.ES_SUBSUMED(*this);
}
firsti=i;
/*
* State 2
* prefix: (?|<=)
*
*/
i++;
while ((i < n) &&
(cs.xmin(i) == cs.ymax(i)) &&
(cs.xmax(i) == cs.ymin(i))) { // case: =
i++;
}
if (i == n) { // case: $
if (strict)
goto rewrite_le;
else
goto rewrite_lq;
}
if (cs.xmax(i) < cs.ymin(i)) // case: <
goto rewrite_lq;
if (cs.xmin(i) > cs.ymax(i)) // case: >
goto rewrite_le;
if (cs.xmax(i) <= cs.ymin(i)) {
// case: <= (invariant: not =, <)
/*
* State 3
* prefix: (?|<=),<=
*
*/
i++;
while ((i < n) && (cs.xmax(i) == cs.ymin(i))) {// case: <=, =
i++;
}
if (i == n) { // case: $
if (strict) {
GECODE_ES_CHECK(cs.prune(home,x0,x1));
return assigned ? home.ES_SUBSUMED(*this) : ES_NOFIX;
} else {
goto rewrite_lq;
}
}
if (cs.xmax(i) < cs.ymin(i)) // case: <
goto rewrite_lq;
GECODE_ES_CHECK(cs.prune(home,x0,x1));
return assigned ? home.ES_SUBSUMED(*this) : ES_NOFIX;
}
if (cs.xmin(i) >= cs.ymax(i)) {
// case: >= (invariant: not =, >)
/*
* State 4
* prefix: (?|<=) >=
*
*/
i++;
while ((i < n) && (cs.xmin(i) == cs.ymax(i))) {
// case: >=, =
i++;
}
if (i == n) { // case: $
if (strict) {
goto rewrite_le;
} else {
GECODE_ES_CHECK(cs.prune(home,x0,x1));
return assigned ? home.ES_SUBSUMED(*this) : ES_NOFIX;
}
}
if (cs.xmin(i) > cs.ymax(i)) // case: >
goto rewrite_le;
GECODE_ES_CHECK(cs.prune(home,x0,x1));
return assigned ? home.ES_SUBSUMED(*this) : ES_NOFIX;
}
GECODE_ES_CHECK(cs.prune(home,x0,x1));
return assigned ? home.ES_SUBSUMED(*this) : ES_NOFIX;
rewrite_le:
GECODE_ME_CHECK(cs.xlq(firsti,false));
GECODE_ME_CHECK(cs.ygq(firsti,true));
GECODE_ES_CHECK(cs.prune(home,x0,x1));
return home.ES_SUBSUMED(*this);
rewrite_lq:
GECODE_ES_CHECK(cs.prune(home,x0,x1));
return assigned ? home.ES_SUBSUMED(*this) : ES_NOFIX;
}
}}}
// STATISTICS: set-prop
|