/usr/include/gecode/int/branch.hh is in libgecode-dev 5.1.0-2build1.
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 | /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christian Schulte, 2012
*
* Last modified:
* $Date: 2017-04-01 20:27:10 +0200 (Sat, 01 Apr 2017) $ by $Author: schulte $
* $Revision: 15623 $
*
* 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.
*
*/
#ifndef __GECODE_INT_BRANCH_HH__
#define __GECODE_INT_BRANCH_HH__
#include <gecode/int.hh>
/**
* \namespace Gecode::Int::Branch
* \brief Integer branchers
*/
namespace Gecode { namespace Int { namespace Branch {
/**
* \defgroup FuncIntViewSel Merit-based integer view selection for branchers
*
* Contains merit-based view selection strategies on integer
* views that can be used together with the generic view/value
* brancher classes.
*
* All merit-based view selection classes require
* \code #include <gecode/int/branch.hh> \endcode
* \ingroup Other
*/
/**
* \brief Merit class for mimimum of integer views
*
* Requires \code #include <gecode/int/branch.hh> \endcode
* \ingroup FuncIntViewSel
*/
template<class View>
class MeritMin : public MeritBase<View,int> {
public:
using typename MeritBase<View,int>::Var;
/// Constructor for initialization
MeritMin(Space& home, const VarBranch<Var>& vb);
/// Constructor for cloning
MeritMin(Space& home, bool shared, MeritMin& m);
/// Return minimum as merit for view \a x at position \a i
int operator ()(const Space& home, View x, int i);
};
/**
* \brief Merit class for maximum
*
* Requires \code #include <gecode/int/branch.hh> \endcode
* \ingroup FuncIntViewSel
*/
template<class View>
class MeritMax : public MeritBase<View,int> {
public:
using typename MeritBase<View,int>::Var;
/// Constructor for initialization
MeritMax(Space& home, const VarBranch<Var>& vb);
/// Constructor for cloning
MeritMax(Space& home, bool shared, MeritMax& m);
/// Return maximum as merit for view \a x at position \a i
int operator ()(const Space& home, View x, int i);
};
/**
* \brief Merit class for size
*
* Requires \code #include <gecode/int/branch.hh> \endcode
* \ingroup FuncIntViewSel
*/
template<class View>
class MeritSize : public MeritBase<View,unsigned int> {
public:
using typename MeritBase<View,unsigned int>::Var;
/// Constructor for initialization
MeritSize(Space& home, const VarBranch<Var>& vb);
/// Constructor for cloning
MeritSize(Space& home, bool shared, MeritSize& m);
/// Return size as merit for view \a x at position \a i
unsigned int operator ()(const Space& home, View x, int i);
};
/**
* \brief Merit class for degree over size
*
* Requires \code #include <gecode/int/branch.hh> \endcode
* \ingroup FuncIntViewSel
*/
template<class View>
class MeritDegreeSize : public MeritBase<View,double> {
public:
using typename MeritBase<View,double>::Var;
/// Constructor for initialization
MeritDegreeSize(Space& home, const VarBranch<Var>& vb);
/// Constructor for cloning
MeritDegreeSize(Space& home, bool shared, MeritDegreeSize& m);
/// Return degree over size as merit for view \a x at position \a i
double operator ()(const Space& home, View x, int i);
};
/**
* \brief Merit class for AFC over size
*
* Requires \code #include <gecode/int/branch.hh> \endcode
* \ingroup FuncIntViewSel
*/
template<class View>
class MeritAFCSize : public MeritBase<View,double> {
using typename MeritBase<View,double>::Var;
protected:
/// AFC information
AFC afc;
public:
/// Constructor for initialization
MeritAFCSize(Space& home, const VarBranch<Var>& vb);
/// Constructor for cloning
MeritAFCSize(Space& home, bool shared, MeritAFCSize& m);
/// Return AFC over size as merit for view \a x at position \a i
double operator ()(const Space& home, View x, int i);
/// Whether dispose must always be called (that is, notice is needed)
bool notice(void) const;
/// Dispose view selection
void dispose(Space& home);
};
/**
* \brief Merit class for action over size
*
* Requires \code #include <gecode/int/branch.hh> \endcode
* \ingroup FuncIntViewSel
*/
template<class View>
class MeritActionSize : public MeritBase<View,double> {
using typename MeritBase<View,double>::Var;
protected:
/// Action information
Action action;
public:
/// Constructor for initialization
MeritActionSize(Space& home, const VarBranch<Var>& vb);
/// Constructor for cloning
MeritActionSize(Space& home, bool shared, MeritActionSize& m);
/// Return action over size as merit for view \a x at position \a i
double operator ()(const Space& home, View x, int i);
/// Whether dispose must always be called (that is, notice is needed)
bool notice(void) const;
/// Dispose view selection
void dispose(Space& home);
};
/**
* \brief Merit class for CHB over size
*
* Requires \code #include <gecode/int/branch.hh> \endcode
* \ingroup FuncIntViewSel
*/
template<class View>
class MeritCHBSize : public MeritBase<View,double> {
using typename MeritBase<View,double>::Var;
protected:
/// CHB information
CHB chb;
public:
/// Constructor for initialization
MeritCHBSize(Space& home, const VarBranch<Var>& vb);
/// Constructor for cloning
MeritCHBSize(Space& home, bool shared, MeritCHBSize& m);
/// Return size over action as merit for view \a x at position \a i
double operator ()(const Space& home, View x, int i);
/// Whether dispose must always be called (that is, notice is needed)
bool notice(void) const;
/// Dispose view selection
void dispose(Space& home);
};
/**
* \brief Merit class for minimum regret
*
* Requires \code #include <gecode/int/branch.hh> \endcode
* \ingroup FuncIntViewSel
*/
template<class View>
class MeritRegretMin : public MeritBase<View,unsigned int> {
public:
using typename MeritBase<View,unsigned int>::Var;
/// Constructor for initialization
MeritRegretMin(Space& home, const VarBranch<Var>& vb);
/// Constructor for cloning
MeritRegretMin(Space& home, bool shared, MeritRegretMin& m);
/// Return minimum regret as merit for view \a x at position \a i
unsigned int operator ()(const Space& home, View x, int i);
};
/**
* \brief Merit class for maximum regret
*
* Requires \code #include <gecode/int/branch.hh> \endcode
* \ingroup FuncIntViewSel
*/
template<class View>
class MeritRegretMax : public MeritBase<View,unsigned int> {
public:
using typename MeritBase<View,unsigned int>::Var;
/// Constructor for initialization
MeritRegretMax(Space& home, const VarBranch<Var>& vb);
/// Constructor for cloning
MeritRegretMax(Space& home, bool shared, MeritRegretMax& m);
/// Return maximum regret as merit for view \a x at position \a i
unsigned int operator ()(const Space& home, View x, int i);
};
}}}
#include <gecode/int/branch/merit.hpp>
namespace Gecode { namespace Int { namespace Branch {
/// Return view selectors for integer views
GECODE_INT_EXPORT
ViewSel<IntView>* viewsel(Space& home, const IntVarBranch& ivb);
/// Return view selectors for Boolean views
GECODE_INT_EXPORT
ViewSel<BoolView>* viewsel(Space& home, const BoolVarBranch& bvb);
}}}
namespace Gecode { namespace Int { namespace Branch {
/**
* \defgroup FuncIntValSel Integer value selection for brancher
*
* Contains a description of value selection strategies on integer
* views that can be used together with the generic view/value
* branchers.
*
* All value selection classes require
* \code #include <gecode/int/branch.hh> \endcode
* \ingroup Other
*/
/**
* \brief Value selection class for mimimum of view
*
* Requires \code #include <gecode/int/branch.hh> \endcode
* \ingroup FuncIntValSel
*/
template<class View>
class ValSelMin : public ValSel<View,int> {
public:
using typename ValSel<View,int>::Var;
/// Constructor for initialization
ValSelMin(Space& home, const ValBranch<Var>& vb);
/// Constructor for cloning
ValSelMin(Space& home, bool shared, ValSelMin& vs);
/// Return value of view \a x at position \a i
int val(const Space& home, View x, int i);
};
/**
* \brief Value selection class for maximum of view
*
* Requires \code #include <gecode/int/branch.hh> \endcode
* \ingroup FuncIntValSel
*/
template<class View>
class ValSelMax : public ValSel<View,int> {
public:
using typename ValSel<View,int>::Var;
/// Constructor for initialization
ValSelMax(Space& home, const ValBranch<Var>& vb);
/// Constructor for cloning
ValSelMax(Space& home, bool shared, ValSelMax& vs);
/// Return value of view \a x at position \a i
int val(const Space& home, View x, int i);
};
/**
* \brief Value selection class for median of view
*
* Requires \code #include <gecode/int/branch.hh> \endcode
* \ingroup FuncIntValSel
*/
template<class View>
class ValSelMed : public ValSel<View,int> {
public:
using typename ValSel<View,int>::Var;
/// Constructor for initialization
ValSelMed(Space& home, const ValBranch<Var>& vb);
/// Constructor for cloning
ValSelMed(Space& home, bool shared, ValSelMed& vs);
/// Return value of view \a x at position i
int val(const Space& home, View x, int i);
};
/**
* \brief Value selection class for average of view
*
* Requires \code #include <gecode/int/branch.hh> \endcode
* \ingroup FuncIntValSel
*/
template<class View>
class ValSelAvg : public ValSel<View,int> {
public:
using typename ValSel<View,int>::Var;
/// Constructor for initialization
ValSelAvg(Space& home, const ValBranch<Var>& vb);
/// Constructor for cloning
ValSelAvg(Space& home, bool shared, ValSelAvg& vs);
/// Return value of view \a x at position \a i
int val(const Space& home, View x, int i);
};
/**
* \brief Value selection class for random value of view
*
* Requires \code #include <gecode/int/branch.hh> \endcode
* \ingroup FuncIntValSel
*/
template<class View>
class ValSelRnd : public ValSel<View,int> {
using typename ValSel<View,int>::Var;
protected:
/// The used random number generator
Rnd r;
public:
/// Constructor for initialization
ValSelRnd(Space& home, const ValBranch<Var>& vb);
/// Constructor for cloning
ValSelRnd(Space& home, bool shared, ValSelRnd& vs);
/// Return value of view \a x at position \a i
int val(const Space& home, View x, int i);
/// Whether dispose must always be called (that is, notice is needed)
bool notice(void) const;
/// Delete value selection
void dispose(Space& home);
};
/**
* \brief Value selection class for minimum range of integer view
*
* Requires \code #include <gecode/int/branch.hh> \endcode
* \ingroup FuncIntValSel
*/
class ValSelRangeMin : public ValSel<IntView,int> {
public:
/// Constructor for initialization
ValSelRangeMin(Space& home, const ValBranch<IntVar>& vb);
/// Constructor for cloning
ValSelRangeMin(Space& home, bool shared, ValSelRangeMin& vs);
/// Return value of integer view \a x at position \a i
int val(const Space& home, IntView x, int i);
};
/**
* \brief Value selection class for maximum range of integer view
*
* Requires \code #include <gecode/int/branch.hh> \endcode
* \ingroup FuncIntValSel
*/
class ValSelRangeMax : public ValSel<IntView,int> {
public:
/// Constructor for initialization
ValSelRangeMax(Space& home, const ValBranch<IntVar>& vb);
/// Constructor for cloning
ValSelRangeMax(Space& home, bool shared, ValSelRangeMax& vs);
/// Return value of integer view \a x at position \a i
int val(const Space& home, IntView x, int i);
};
}}}
#include <gecode/int/branch/val-sel.hpp>
namespace Gecode { namespace Int { namespace Branch {
/// No-good literal for equality
template<class View>
class EqNGL : public ViewValNGL<View,int,PC_INT_VAL> {
using ViewValNGL<View,int,PC_INT_VAL>::x;
using ViewValNGL<View,int,PC_INT_VAL>::n;
public:
/// Constructor for creation
EqNGL(Space& home, View x, int n);
/// Constructor for cloning \a ngl
EqNGL(Space& home, bool share, EqNGL& ngl);
/// Test the status of the no-good literal
virtual NGL::Status status(const Space& home) const;
/// Propagate the negation of the no-good literal
virtual ExecStatus prune(Space& home);
/// Create copy
virtual NGL* copy(Space& home, bool share);
};
/// No-good literal for disequality
template<class View>
class NqNGL : public ViewValNGL<View,int,PC_INT_DOM> {
using ViewValNGL<View,int,PC_INT_DOM>::x;
using ViewValNGL<View,int,PC_INT_DOM>::n;
public:
/// Constructor for creation
NqNGL(Space& home, View x, int n);
/// Constructor for cloning \a ngl
NqNGL(Space& home, bool share, NqNGL& ngl);
/// Test the status of the no-good literal
virtual NGL::Status status(const Space& home) const;
/// Propagate the negation of the no-good literal
virtual ExecStatus prune(Space& home);
/// Create copy
virtual NGL* copy(Space& home, bool share);
};
/// No-good literal for less or equal
template<class View>
class LqNGL : public ViewValNGL<View,int,PC_INT_BND> {
using ViewValNGL<View,int,PC_INT_BND>::x;
using ViewValNGL<View,int,PC_INT_BND>::n;
public:
/// Constructor for creation
LqNGL(Space& home, View x, int n);
/// Constructor for cloning \a ngl
LqNGL(Space& home, bool share, LqNGL& ngl);
/// Test the status of the no-good literal
virtual NGL::Status status(const Space& home) const;
/// Propagate the negation of the no-good literal
virtual ExecStatus prune(Space& home);
/// Create copy
virtual NGL* copy(Space& home, bool share);
};
/// No-good literal for greater or equal
template<class View>
class GqNGL : public ViewValNGL<View,int,PC_INT_BND> {
using ViewValNGL<View,int,PC_INT_BND>::x;
using ViewValNGL<View,int,PC_INT_BND>::n;
public:
/// Constructor for creation
GqNGL(Space& home, View x, int n);
/// Constructor for cloning \a ngl
GqNGL(Space& home, bool share, GqNGL& ngl);
/// Test the status of the no-good literal
virtual NGL::Status status(const Space& home) const;
/// Propagate the negation of the no-good literal
virtual ExecStatus prune(Space& home);
/// Create copy
virtual NGL* copy(Space& home, bool share);
};
}}}
#include <gecode/int/branch/ngl.hpp>
namespace Gecode { namespace Int { namespace Branch {
/**
* \defgroup FuncIntValCommit Integer value commit classes
*
* Contains the value commit classes for integer and Boolean
* views that can be used together with the generic view/value
* branchers.
*
* All value commit classes require
* \code #include <gecode/int/branch.hh> \endcode
* \ingroup Other
*/
/**
* \brief Value commit class for equality
*
* Requires \code #include <gecode/int/branch.hh> \endcode
* \ingroup FuncIntValCommit
*/
template<class View>
class ValCommitEq : public ValCommit<View,int> {
public:
using typename ValCommit<View,int>::Var;
/// Constructor for initialization
ValCommitEq(Space& home, const ValBranch<Var>& vb);
/// Constructor for cloning
ValCommitEq(Space& home, bool shared, ValCommitEq& vc);
/// Commit view \a x at position \a i to value \a n for alternative \a a
ModEvent commit(Space& home, unsigned int a, View x, int i, int n);
/// Create no-good literal for alternative \a a
NGL* ngl(Space& home, unsigned int a, View x, int n) const;
/// Print on \a o the alternative \a with view \a x at position \a i and value \a n
void print(const Space& home, unsigned int a, View x, int i, int n,
std::ostream& o) const;
};
/**
* \brief Value commit class for less or equal
*
* Requires \code #include <gecode/int/branch.hh> \endcode
* \ingroup FuncIntValCommit
*/
template<class View>
class ValCommitLq : public ValCommit<View,int> {
public:
using typename ValCommit<View,int>::Var;
/// Constructor for initialization
ValCommitLq(Space& home, const ValBranch<Var>& vb);
/// Constructor for cloning
ValCommitLq(Space& home, bool shared, ValCommitLq& vc);
/// Commit view \a x at position \a i to value \a n for alternative \a a
ModEvent commit(Space& home, unsigned int a, View x, int i, int n);
/// Create no-good literal for alternative \a a
NGL* ngl(Space& home, unsigned int a, View x, int n) const;
/// Print on \a o the alternative \a with view \a x at position \a i and value \a n
void print(const Space& home, unsigned int a, View x, int i, int n,
std::ostream& o) const;
};
/**
* \brief Value commit class for greater or equal
*
* Requires \code #include <gecode/int/branch.hh> \endcode
* \ingroup FuncIntValCommit
*/
template<class View>
class ValCommitGq : public ValCommit<View,int> {
public:
using typename ValCommit<View,int>::Var;
/// Constructor for initialization
ValCommitGq(Space& home, const ValBranch<Var>& vb);
/// Constructor for cloning
ValCommitGq(Space& home, bool shared, ValCommitGq& vc);
/// Commit view \a x at position \a i to value \a n for alternative \a a
ModEvent commit(Space& home, unsigned int a, View x, int i, int n);
/// Create no-good literal for alternative \a a
NGL* ngl(Space& home, unsigned int a, View x, int n) const;
/// Print on \a o the alternative \a with view \a x at position \a i and value \a n
void print(const Space& home, unsigned int a, View x, int i, int n,
std::ostream& o) const;
};
/**
* \brief Value commit class for greater
*
* Requires \code #include <gecode/int/branch.hh> \endcode
* \ingroup FuncIntValCommit
*/
template<class View>
class ValCommitGr : public ValCommit<View,int> {
public:
using typename ValCommit<View,int>::Var;
/// Constructor for initialization
ValCommitGr(Space& home, const ValBranch<Var>& vb);
/// Constructor for cloning
ValCommitGr(Space& home, bool shared, ValCommitGr& vc);
/// Commit view \a x at position \a i to value \a n for alternative \a a
ModEvent commit(Space& home, unsigned int a, View x, int i, int n);
/// Create no-good literal for alternative \a a
NGL* ngl(Space& home, unsigned int a, View x, int n) const;
/// Print on \a o the alternative \a with view \a x at position \a i and value \a n
void print(const Space& home, unsigned int a, View x, int i, int n,
std::ostream& o) const;
};
}}}
#include <gecode/int/branch/val-commit.hpp>
namespace Gecode { namespace Int { namespace Branch {
/// Return value and commit for integer views
GECODE_INT_EXPORT
ValSelCommitBase<IntView,int>*
valselcommit(Space& home, const IntValBranch& ivb);
/// Return value and commit for Boolean views
GECODE_INT_EXPORT
ValSelCommitBase<BoolView,int>*
valselcommit(Space& home, const BoolValBranch& bvb);
/// Return value and commit for integer views
GECODE_INT_EXPORT
ValSelCommitBase<IntView,int>*
valselcommit(Space& home, const IntAssign& ia);
/// Return value and commit for Boolean views
GECODE_INT_EXPORT
ValSelCommitBase<BoolView,int>*
valselcommit(Space& home, const BoolAssign& ba);
}}}
namespace Gecode { namespace Int { namespace Branch {
/**
* \brief %Brancher by view and values selection
*
*/
template<int n, bool min, class Filter, class Print>
class ViewValuesBrancher : public ViewBrancher<IntView,Filter,n> {
protected:
using ViewBrancher<IntView,Filter,n>::x;
using ViewBrancher<IntView,Filter,n>::f;
/// Print function
Print p;
/// Constructor for cloning \a b
ViewValuesBrancher(Space& home, bool shared, ViewValuesBrancher& b);
/// Constructor for creation
ViewValuesBrancher(Home home, ViewArray<IntView>& x,
ViewSel<IntView>* vs[n],
IntBranchFilter bf,
IntVarValPrint vvp);
public:
/// Return choice
virtual const Choice* choice(Space& home);
/// Return choice
virtual const Choice* choice(const Space& home, Archive& e);
/// Perform commit for choice \a c and alternative \a a
virtual ExecStatus commit(Space& home, const Choice& c, unsigned int a);
/// Create no-good literal for choice \a c and alternative \a a
virtual NGL* ngl(Space& home, const Choice& c, unsigned int a) const;
/**
* \brief Print branch for choice \a c and alternative \a a
*
* Prints an explanation of the alternative \a a of choice \a c
* on the stream \a o.
*
*/
virtual void print(const Space& home, const Choice& c, unsigned int a,
std::ostream& o) const;
/// Perform cloning
virtual Actor* copy(Space& home, bool share);
/// Post function for creation
static void post(Home home, ViewArray<IntView>& x,
ViewSel<IntView>* vs[n],
IntBranchFilter bf,
IntVarValPrint vvp);
/// Delete brancher and return its size
virtual size_t dispose(Space& home);
};
/// Post brancher for view and values
template<int n, bool min>
void postviewvaluesbrancher(Home home, ViewArray<IntView>& x,
ViewSel<IntView>* vs[n],
IntBranchFilter bf,
IntVarValPrint vvp);
}}}
#include <gecode/int/branch/view-values.hpp>
#endif
// STATISTICS: int-branch
|