/usr/include/gecode/kernel/propagator.hpp is in libgecode-dev 4.4.0-5.
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 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 | /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
* Guido Tack <tack@gecode.org>
*
* Copyright:
* Christian Schulte, 2002
* Guido Tack, 2004
*
* Last modified:
* $Date: 2009-10-12 17:36:53 +0200 (Mon, 12 Oct 2009) $ by $Author: schulte $
* $Revision: 9878 $
*
* 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 {
/**
* \defgroup TaskPropPat Propagator patterns
*
* \ingroup TaskActor
*/
//@{
/**
* \brief Unary propagator
*
* Stores a single view of type \a View with propagation condition \a pc.
*
* If the propagation condition \a pc has the value PC_GEN_NONE, no
* subscriptions are created.
*
*/
template<class View, PropCond pc>
class UnaryPropagator : public Propagator {
protected:
/// Single view
View x0;
/// Constructor for cloning \a p
UnaryPropagator(Space& home, bool share, UnaryPropagator& p);
/// Constructor for rewriting \a p during cloning
UnaryPropagator(Space& home, bool share, Propagator& p,
View x0);
/// Constructor for creation
UnaryPropagator(Home home, View x0);
public:
/// Cost function (defined as PC_UNARY_LO)
virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
/// Delete propagator and return its size
virtual size_t dispose(Space& home);
};
/**
* \brief Binary propagator
*
* Stores two views of type \a View with propagation condition \a pc.
*
* If the propagation condition \a pc has the value PC_GEN_NONE, no
* subscriptions are created.
*
*/
template<class View, PropCond pc>
class BinaryPropagator : public Propagator {
protected:
/// Two views
View x0, x1;
/// Constructor for cloning \a p
BinaryPropagator(Space& home, bool share, BinaryPropagator& p);
/// Constructor for creation
BinaryPropagator(Home home, View x0, View x1);
/// Constructor for rewriting \a p during cloning
BinaryPropagator(Space& home, bool share, Propagator& p,
View x0, View x1);
public:
/// Cost function (defined as low binary)
virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
/// Delete propagator and return its size
virtual size_t dispose(Space& home);
};
/**
* \brief Ternary propagator
*
* Stores three views of type \a View with propagation condition \a pc.
*
* If the propagation condition \a pc has the value PC_GEN_NONE, no
* subscriptions are created.
*
*/
template<class View, PropCond pc>
class TernaryPropagator : public Propagator {
protected:
/// Three views
View x0, x1, x2;
/// Constructor for cloning \a p
TernaryPropagator(Space& home, bool share, TernaryPropagator& p);
/// Constructor for creation
TernaryPropagator(Home home, View x0, View x1, View x2);
/// Constructor for rewriting \a p during cloning
TernaryPropagator(Space& home, bool share, Propagator& p,
View x0, View x1, View x2);
public:
/// Cost function (defined as low ternary)
virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
/// Delete propagator and return its size
virtual size_t dispose(Space& home);
};
/**
* \brief n-ary propagator
*
* Stores array of views of type \a View with propagation condition \a pc.
*
* If the propagation condition \a pc has the value PC_GEN_NONE, no
* subscriptions are created.
*
*/
template<class View, PropCond pc>
class NaryPropagator : public Propagator {
protected:
/// Array of views
ViewArray<View> x;
/// Constructor for cloning \a p
NaryPropagator(Space& home, bool share, NaryPropagator& p);
/// Constructor for rewriting \a p during cloning
NaryPropagator(Space& home, bool share, Propagator& p,
ViewArray<View>& x);
/// Constructor for creation
NaryPropagator(Home home, ViewArray<View>& x);
public:
/// Cost function (defined as low linear)
virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
/// Delete propagator and return its size
virtual size_t dispose(Space& home);
};
/**
* \brief (n+1)-ary propagator
*
* Stores array of views and single view of type \a View with propagation
* condition \a pc.
*
* If the propagation condition \a pc has the value PC_GEN_NONE, no
* subscriptions are created.
*
*/
template<class View, PropCond pc>
class NaryOnePropagator : public Propagator {
protected:
/// Array of views
ViewArray<View> x;
/// Single view
View y;
/// Constructor for cloning \a p
NaryOnePropagator(Space& home, bool share, NaryOnePropagator& p);
/// Constructor for rewriting \a p during cloning
NaryOnePropagator(Space& home, bool share, Propagator& p,
ViewArray<View>& x, View y);
/// Constructor for creation
NaryOnePropagator(Home home, ViewArray<View>& x, View y);
public:
/// Cost function (defined as low linear)
virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
/// Delete propagator and return its size
virtual size_t dispose(Space& home);
};
/**
* \brief Mixed binary propagator
*
* Stores two views of type \a View0 and \a View1 with propagation
* conditions \a pc0 and \a pc1.
*
* If the propagation conditions \a pc0 or \a pc1 have the values
* PC_GEN_NONE, no subscriptions are created.
*
*/
template<class View0, PropCond pc0, class View1, PropCond pc1>
class MixBinaryPropagator : public Propagator {
protected:
/// View of type \a View0
View0 x0;
/// View of type \a View1
View1 x1;
/// Constructor for cloning
MixBinaryPropagator(Space& home,bool,MixBinaryPropagator&);
/// Constructor for creation
MixBinaryPropagator(Home home,View0,View1);
/// Constructor for rewriting \a p during cloning
MixBinaryPropagator(Space& home, bool share, Propagator& p,
View0 x0, View1 x1);
public:
/// Cost function (defined as low binary)
virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
/// Delete propagator and return its size
virtual size_t dispose(Space& home);
};
/**
* \brief Mixed ternary propagator
*
* Stores three views of type \a View0, \a View1, and \a View2
* with propagation conditions \a pc0, \a pc1, and \a pc2.
*
* If the propagation conditions \a pc0, \a pc1, \a pc2 have the values
* PC_GEN_NONE, no subscriptions are created.
*
*/
template<class View0, PropCond pc0, class View1, PropCond pc1,
class View2, PropCond pc2>
class MixTernaryPropagator : public Propagator {
protected:
/// View of type \a View0
View0 x0;
/// View of type \a View1
View1 x1;
/// View of type \a View2
View2 x2;
/// Constructor for cloning
MixTernaryPropagator(Space& home, bool share, MixTernaryPropagator& p);
/// Constructor for creation
MixTernaryPropagator(Home home, View0 x0, View1 x1, View2 x2);
/// Constructor for rewriting \a p during cloning
MixTernaryPropagator(Space& home, bool share, Propagator& p,
View0 x0, View1 x1, View2 x2);
public:
/// Cost function (defined as low ternary)
virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
/// Delete propagator and return its size
virtual size_t dispose(Space& home);
};
/**
* \brief Mixed (n+1)-ary propagator
*
* Stores array of views of type \a View0 with propagation condition \a pc0
* and a single view of type \a View1 with propagation condition \a pc1.
*
* If the propagation conditions \a pc0 or \a pc1 have the values
* PC_GEN_NONE, no subscriptions are created.
*
*/
template<class View0, PropCond pc0, class View1, PropCond pc1>
class MixNaryOnePropagator : public Propagator {
protected:
/// Array of views
ViewArray<View0> x;
/// Single view
View1 y;
/// Constructor for cloning \a p
MixNaryOnePropagator(Space& home, bool share, MixNaryOnePropagator& p);
/// Constructor for creation
MixNaryOnePropagator(Home home, ViewArray<View0>& x, View1 y);
/// Constructor for rewriting \a p during cloning
MixNaryOnePropagator(Space& home, bool share, Propagator& p,
ViewArray<View0>& x, View1 y);
public:
/// Cost function (defined as low linear)
virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
/// Delete propagator and return its size
virtual size_t dispose(Space& home);
};
//@}
/*
* Unary propagators
*
*/
template<class View, PropCond pc>
UnaryPropagator<View,pc>::UnaryPropagator(Home home, View y0)
: Propagator(home), x0(y0) {
if (pc != PC_GEN_NONE)
x0.subscribe(home,*this,pc);
}
template<class View, PropCond pc>
forceinline
UnaryPropagator<View,pc>::UnaryPropagator
(Space& home, bool share, UnaryPropagator<View,pc>& p)
: Propagator(home,share,p) {
x0.update(home,share,p.x0);
}
template<class View, PropCond pc>
forceinline
UnaryPropagator<View,pc>::UnaryPropagator
(Space& home, bool share, Propagator& p, View y0)
: Propagator(home,share,p) {
x0.update(home,share,y0);
}
template<class View, PropCond pc>
PropCost
UnaryPropagator<View,pc>::cost(const Space&, const ModEventDelta&) const {
return PropCost::unary(PropCost::LO);
}
template<class View, PropCond pc>
forceinline size_t
UnaryPropagator<View,pc>::dispose(Space& home) {
if (pc != PC_GEN_NONE)
x0.cancel(home,*this,pc);
(void) Propagator::dispose(home);
return sizeof(*this);
}
/*
* Binary propagators
*
*/
template<class View, PropCond pc>
BinaryPropagator<View,pc>::BinaryPropagator(Home home, View y0, View y1)
: Propagator(home), x0(y0), x1(y1) {
if (pc != PC_GEN_NONE) {
x0.subscribe(home,*this,pc);
x1.subscribe(home,*this,pc);
}
}
template<class View, PropCond pc>
forceinline
BinaryPropagator<View,pc>::BinaryPropagator
(Space& home, bool share, BinaryPropagator<View,pc>& p)
: Propagator(home,share,p) {
x0.update(home,share,p.x0);
x1.update(home,share,p.x1);
}
template<class View, PropCond pc>
forceinline
BinaryPropagator<View,pc>::BinaryPropagator
(Space& home, bool share, Propagator& p, View y0, View y1)
: Propagator(home,share,p) {
x0.update(home,share,y0);
x1.update(home,share,y1);
}
template<class View, PropCond pc>
PropCost
BinaryPropagator<View,pc>::cost(const Space&, const ModEventDelta&) const {
return PropCost::binary(PropCost::LO);
}
template<class View, PropCond pc>
forceinline size_t
BinaryPropagator<View,pc>::dispose(Space& home) {
if (pc != PC_GEN_NONE) {
x0.cancel(home,*this,pc);
x1.cancel(home,*this,pc);
}
(void) Propagator::dispose(home);
return sizeof(*this);
}
/*
* Ternary propagators
*
*/
template<class View, PropCond pc>
TernaryPropagator<View,pc>::TernaryPropagator
(Home home, View y0, View y1, View y2)
: Propagator(home), x0(y0), x1(y1), x2(y2) {
if (pc != PC_GEN_NONE) {
x0.subscribe(home,*this,pc);
x1.subscribe(home,*this,pc);
x2.subscribe(home,*this,pc);
}
}
template<class View, PropCond pc>
forceinline
TernaryPropagator<View,pc>::TernaryPropagator
(Space& home, bool share, TernaryPropagator<View,pc>& p)
: Propagator(home,share,p) {
x0.update(home,share,p.x0);
x1.update(home,share,p.x1);
x2.update(home,share,p.x2);
}
template<class View, PropCond pc>
forceinline
TernaryPropagator<View,pc>::TernaryPropagator
(Space& home, bool share, Propagator& p, View y0, View y1, View y2)
: Propagator(home,share,p) {
x0.update(home,share,y0);
x1.update(home,share,y1);
x2.update(home,share,y2);
}
template<class View, PropCond pc>
PropCost
TernaryPropagator<View,pc>::cost(const Space&, const ModEventDelta&) const {
return PropCost::ternary(PropCost::LO);;
}
template<class View, PropCond pc>
forceinline size_t
TernaryPropagator<View,pc>::dispose(Space& home) {
if (pc != PC_GEN_NONE) {
x0.cancel(home,*this,pc);
x1.cancel(home,*this,pc);
x2.cancel(home,*this,pc);
}
(void) Propagator::dispose(home);
return sizeof(*this);
}
/*
* Nary propagators
*
*/
template<class View, PropCond pc>
NaryPropagator<View,pc>::NaryPropagator
(Home home, ViewArray<View>& y)
: Propagator(home), x(y) {
if (pc != PC_GEN_NONE)
x.subscribe(home,*this,pc);
}
template<class View, PropCond pc>
forceinline
NaryPropagator<View,pc>::NaryPropagator
(Space& home, bool share, NaryPropagator<View,pc>& p)
: Propagator(home,share,p) {
x.update(home,share,p.x);
}
template<class View, PropCond pc>
forceinline
NaryPropagator<View,pc>::NaryPropagator
(Space& home, bool share, Propagator& p, ViewArray<View>& x0)
: Propagator(home,share,p) {
x.update(home,share,x0);
}
template<class View, PropCond pc>
PropCost
NaryPropagator<View,pc>::cost(const Space&, const ModEventDelta&) const {
return PropCost::linear(PropCost::LO,x.size());
}
template<class View, PropCond pc>
forceinline size_t
NaryPropagator<View,pc>::dispose(Space& home) {
if (pc != PC_GEN_NONE)
x.cancel(home,*this,pc);
(void) Propagator::dispose(home);
return sizeof(*this);
}
/*
* NaryOne (one additional variable) propagators
*
*/
template<class View, PropCond pc>
NaryOnePropagator<View,pc>::NaryOnePropagator
(Home home, ViewArray<View>& x0, View y0)
: Propagator(home), x(x0), y(y0) {
if (pc != PC_GEN_NONE) {
x.subscribe(home,*this,pc);
y.subscribe(home,*this,pc);
}
}
template<class View, PropCond pc>
forceinline
NaryOnePropagator<View,pc>::NaryOnePropagator
(Space& home, bool share, NaryOnePropagator<View,pc>& p)
: Propagator(home,share,p) {
x.update(home,share,p.x);
y.update(home,share,p.y);
}
template<class View, PropCond pc>
forceinline
NaryOnePropagator<View,pc>::NaryOnePropagator
(Space& home, bool share, Propagator& p, ViewArray<View>& x0, View y0)
: Propagator(home,share,p) {
x.update(home,share,x0);
y.update(home,share,y0);
}
template<class View, PropCond pc>
PropCost
NaryOnePropagator<View,pc>::cost(const Space&, const ModEventDelta&) const {
return PropCost::linear(PropCost::LO,x.size()+1);
}
template<class View, PropCond pc>
forceinline size_t
NaryOnePropagator<View,pc>::dispose(Space& home) {
if (pc != PC_GEN_NONE) {
x.cancel(home,*this,pc);
y.cancel(home,*this,pc);
}
(void) Propagator::dispose(home);
return sizeof(*this);
}
/*
* Mixed binary propagators
*
*/
template<class View0, PropCond pc0, class View1, PropCond pc1>
MixBinaryPropagator<View0,pc0,View1,pc1>::MixBinaryPropagator
(Home home, View0 y0, View1 y1)
: Propagator(home), x0(y0), x1(y1) {
if (pc0 != PC_GEN_NONE)
x0.subscribe(home,*this,pc0);
if (pc1 != PC_GEN_NONE)
x1.subscribe(home,*this,pc1);
}
template<class View0, PropCond pc0, class View1, PropCond pc1>
forceinline
MixBinaryPropagator<View0,pc0,View1,pc1>::MixBinaryPropagator
(Space& home, bool share, MixBinaryPropagator<View0,pc0,View1,pc1>& p)
: Propagator(home,share,p) {
x0.update(home,share,p.x0);
x1.update(home,share,p.x1);
}
template<class View0, PropCond pc0, class View1, PropCond pc1>
forceinline
MixBinaryPropagator<View0,pc0,View1,pc1>::MixBinaryPropagator
(Space& home, bool share, Propagator& p, View0 y0, View1 y1)
: Propagator(home,share,p) {
x0.update(home,share,y0);
x1.update(home,share,y1);
}
template<class View0, PropCond pc0, class View1, PropCond pc1>
PropCost
MixBinaryPropagator<View0,pc0,View1,pc1>::cost(const Space&,
const ModEventDelta&) const {
return PropCost::binary(PropCost::LO);
}
template<class View0, PropCond pc0, class View1, PropCond pc1>
forceinline size_t
MixBinaryPropagator<View0,pc0,View1,pc1>::dispose(Space& home) {
if (pc0 != PC_GEN_NONE)
x0.cancel(home,*this,pc0);
if (pc1 != PC_GEN_NONE)
x1.cancel(home,*this,pc1);
(void) Propagator::dispose(home);
return sizeof(*this);
}
/*
* Mixed ternary propagators
*
*/
template<class View0, PropCond pc0, class View1, PropCond pc1,
class View2, PropCond pc2>
MixTernaryPropagator<View0,pc0,View1,pc1,View2,pc2>::
MixTernaryPropagator(Home home, View0 y0, View1 y1, View2 y2)
: Propagator(home), x0(y0), x1(y1), x2(y2) {
if (pc0 != PC_GEN_NONE)
x0.subscribe(home,*this,pc0);
if (pc1 != PC_GEN_NONE)
x1.subscribe(home,*this,pc1);
if (pc2 != PC_GEN_NONE)
x2.subscribe(home,*this,pc2);
}
template<class View0, PropCond pc0, class View1, PropCond pc1,
class View2, PropCond pc2>
forceinline
MixTernaryPropagator<View0,pc0,View1,pc1,View2,pc2>::
MixTernaryPropagator(Space& home, bool share,
MixTernaryPropagator<View0,pc0,View1,pc1,
View2,pc2>& p)
: Propagator(home,share,p) {
x0.update(home,share,p.x0);
x1.update(home,share,p.x1);
x2.update(home,share,p.x2);
}
template<class View0, PropCond pc0, class View1, PropCond pc1,
class View2, PropCond pc2>
forceinline
MixTernaryPropagator<View0,pc0,View1,pc1,View2,pc2>::MixTernaryPropagator
(Space& home, bool share, Propagator& p, View0 y0, View1 y1, View2 y2)
: Propagator(home,share,p) {
x0.update(home,share,y0);
x1.update(home,share,y1);
x2.update(home,share,y2);
}
template<class View0, PropCond pc0, class View1, PropCond pc1,
class View2, PropCond pc2>
PropCost
MixTernaryPropagator<View0,pc0,View1,pc1,View2,pc2>::
cost(const Space&, const ModEventDelta&) const {
return PropCost::ternary(PropCost::LO);
}
template<class View0, PropCond pc0, class View1, PropCond pc1,
class View2, PropCond pc2>
forceinline size_t
MixTernaryPropagator<View0,pc0,View1,pc1,View2,pc2>::dispose(Space& home) {
if (pc0 != PC_GEN_NONE)
x0.cancel(home,*this,pc0);
if (pc1 != PC_GEN_NONE)
x1.cancel(home,*this,pc1);
if (pc2 != PC_GEN_NONE)
x2.cancel(home,*this,pc2);
(void) Propagator::dispose(home);
return sizeof(*this);
}
/*
* MixNaryOne (one additional variable) propagators
*
*/
template<class View0, PropCond pc0, class View1, PropCond pc1>
MixNaryOnePropagator<View0,pc0,View1,pc1>::MixNaryOnePropagator
(Home home, ViewArray<View0>& x0, View1 y0)
: Propagator(home), x(x0), y(y0) {
if (pc0 != PC_GEN_NONE)
x.subscribe(home,*this,pc0);
if (pc1 != PC_GEN_NONE)
y.subscribe(home,*this,pc1);
}
template<class View0, PropCond pc0, class View1, PropCond pc1>
forceinline
MixNaryOnePropagator<View0,pc0,View1,pc1>::MixNaryOnePropagator
(Space& home, bool share, MixNaryOnePropagator<View0,pc0,View1,pc1>& p)
: Propagator(home,share,p) {
x.update(home,share,p.x);
y.update(home,share,p.y);
}
template<class View0, PropCond pc0, class View1, PropCond pc1>
forceinline
MixNaryOnePropagator<View0,pc0,View1,pc1>::MixNaryOnePropagator
(Space& home, bool share, Propagator& p, ViewArray<View0>& x0, View1 y0)
: Propagator(home,share,p) {
x.update(home,share,x0);
y.update(home,share,y0);
}
template<class View0, PropCond pc0, class View1, PropCond pc1>
PropCost
MixNaryOnePropagator<View0,pc0,View1,pc1>::cost(const Space&,
const ModEventDelta&) const {
return PropCost::linear(PropCost::LO,x.size()+1);
}
template<class View0, PropCond pc0, class View1, PropCond pc1>
forceinline size_t
MixNaryOnePropagator<View0,pc0,View1,pc1>::dispose(Space& home) {
if (pc0 != PC_GEN_NONE)
x.cancel(home,*this,pc0);
if (pc1 != PC_GEN_NONE)
y.cancel(home,*this,pc1);
(void) Propagator::dispose(home);
return sizeof(*this);
}
}
// STATISTICS: kernel-prop
|