/usr/include/gecode/int/cumulative.hh 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 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 | /* -*- 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, 2009
* Guido Tack, 2010
*
* Last modified:
* $Date: 2013-03-11 06:26:07 +0100 (Mon, 11 Mar 2013) $ by $Author: tack $
* $Revision: 13487 $
*
* 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_CUMULATIVE_HH__
#define __GECODE_INT_CUMULATIVE_HH__
#include <gecode/int/task.hh>
#include <gecode/int/unary.hh>
/**
* \namespace Gecode::Int::Cumulative
*
* The edge-finding and overload-checking algorithms and data structures
* follow (mostly):
* Petr Vilím, Max Energy Filtering Algorithm for Discrete
* Cumulative Resources, CP-AI-OR, 2009.
* Petr Vilím, Edge Finding Filtering Algorithm for Discrete
* Cumulative Resources in O(kn log n), CP, 2009.
*
* \brief %Scheduling for cumulative resources
*/
namespace Gecode { namespace Int { namespace Cumulative {
/// Throw exception if multiplication of \a x and \a y overflows
void mul_check(long long int x, long long int y);
/// Throw exception if multiplication of \a x, \a y, and \a z overflows
void mul_check(long long int x, long long int y, long long int z);
}}}
#include <gecode/int/cumulative/limits.hpp>
namespace Gecode { namespace Int { namespace Cumulative {
/// Cumulative (mandatory) task with fixed processing time
class ManFixPTask : public Unary::ManFixPTask {
protected:
/// Required capacity
int _c;
public:
/// \name Constructors and initialization
//@{
/// Default constructor
ManFixPTask(void);
/// Initialize task with start time \a s, processing time \a p, and required resource \a c
ManFixPTask(IntVar s, int p, int c);
/// Initialize task with start time \a s, processing time \a p, and required resource \a c
void init(IntVar s, int p, int c);
/// Initialize from task \a t
void init(const ManFixPTask& t);
//@}
/// \name Value access
//@{
/// Return required capacity
int c(void) const;
/// Return required energy
long long int e(void) const;
//@}
/// \name Cloning
//@{
/// Update this task to be a clone of task \a t
void update(Space& home, bool share, ManFixPTask& t);
//@}
};
/**
* \brief Print task in format est:[p,c]:lct
* \relates ManFixPTask
*/
template<class Char, class Traits>
std::basic_ostream<Char,Traits>&
operator <<(std::basic_ostream<Char,Traits>& os, const ManFixPTask& t);
/// Cumulative (mandatory) task with fixed processing, start or end time
class ManFixPSETask : public Unary::ManFixPSETask {
protected:
/// Required capacity
int _c;
public:
/// \name Constructors and initialization
//@{
/// Default constructor
ManFixPSETask(void);
/**
* \brief Initialize task
*
* Depending on \a t, \a s is either the end time (if \a t is FIXS)
* or the start time of the task, \a p is the fixed parameter,
* and \a c is the required capacity.
*/
ManFixPSETask(TaskType t, IntVar s, int p, int c);
/**
* \brief Initialize task
*
* Depending on \a t, \a s is either the end time (if \a t is FIXS)
* or the start time of the task, \a p is the fixed parameter,
* and \a c is the required capacity.
*/
void init(TaskType t, IntVar s, int p, int c);
/// Initialize from task \a t
void init(const ManFixPSETask& t);
//@}
/// \name Value access
//@{
/// Return required capacity
int c(void) const;
/// Return required energy
long long int e(void) const;
//@}
/// \name Cloning
//@{
/// Update this task to be a clone of task \a t
void update(Space& home, bool share, ManFixPSETask& t);
//@}
};
/**
* \brief Print task in format est:[p,c]:lct
* \relates ManFixPSETask
*/
template<class Char, class Traits>
std::basic_ostream<Char,Traits>&
operator <<(std::basic_ostream<Char,Traits>& os, const ManFixPSETask& t);
/// Cumulative (mandatory) task with flexible processing time
class ManFlexTask : public Unary::ManFlexTask {
protected:
/// Required capacity
int _c;
public:
/// \name Constructors and initialization
//@{
/// Default constructor
ManFlexTask(void);
/// Initialize with start time \a s, processing time \a p, end time \a e
ManFlexTask(IntVar s, IntVar p, IntVar e, int c);
/// Initialize with start time \a s, processing time \a p, end time \a e
void init(IntVar s, IntVar p, IntVar e, int c);
/// Initialize from task \a t
void init(const ManFlexTask& t);
//@}
/// \name Value access
//@{
/// Return required capacity
int c(void) const;
/// Return required energy
long long int e(void) const;
//@}
/// \name Cloning
//@{
/// Update this task to be a clone of task \a t
void update(Space& home, bool share, ManFlexTask& t);
//@}
};
/**
* \brief Print task in format est:[p,c]:lct
* \relates ManFlexTask
*/
template<class Char, class Traits>
std::basic_ostream<Char,Traits>&
operator <<(std::basic_ostream<Char,Traits>& os, const ManFlexTask& t);
/// Cumulative optional task with fixed processing time
class OptFixPTask : public ManToOptTask<ManFixPTask> {
protected:
using ManToOptTask<ManFixPTask>::_m;
public:
/// \name Constructors and initialization
//@{
/// Default constructor
OptFixPTask(void);
/// Initialize with start time \a s, processing time \a p, required capacity \a c, and mandatory flag \a m
OptFixPTask(IntVar s, int p, int c, BoolVar m);
/// Initialize with start time \a s, processing time \a p, required capacity \a c, and mandatory flag \a m
void init(IntVar s, int p, int c, BoolVar m);
//@}
/// Cast to corresponding unary task
operator Unary::OptFixPTask (void);
};
/**
* \brief Print optional task in format est:[p,c]:lct:m
* \relates OptFixPTask
*/
template<class Char, class Traits>
std::basic_ostream<Char,Traits>&
operator <<(std::basic_ostream<Char,Traits>& os, const OptFixPTask& t);
/// Cumulative optional task with fixed processing, start or end time
class OptFixPSETask : public ManToOptTask<ManFixPSETask> {
protected:
using ManToOptTask<ManFixPSETask>::_m;
public:
/// \name Constructors and initialization
//@{
/// Default constructor
OptFixPSETask(void);
/// Initialize with start time \a s, processing time \a p, required capacity \a c, and mandatory flag \a m
OptFixPSETask(TaskType t, IntVar s, int p, int c, BoolVar m);
/// Initialize with start time \a s, processing time \a p, required capacity \a c, and mandatory flag \a m
void init(TaskType t, IntVar s, int p, int c, BoolVar m);
//@}
/// Cast to corresponding unary task
operator Unary::OptFixPSETask (void);
};
/**
* \brief Print optional task in format est:[p,c]:lct:m
* \relates OptFixPSETask
*/
template<class Char, class Traits>
std::basic_ostream<Char,Traits>&
operator <<(std::basic_ostream<Char,Traits>& os, const OptFixPSETask& t);
/// %Cumulative optional task with flexible processing time
class OptFlexTask : public ManToOptTask<ManFlexTask> {
protected:
using ManToOptTask<ManFlexTask>::_m;
public:
/// \name Constructors and initialization
//@{
/// Default constructor
OptFlexTask(void);
/// Initialize with start time \a s, processing time \a p, end time \a e, and mandatory flag \a m
OptFlexTask(IntVar s, IntVar p, IntVar e, int c, BoolVar m);
/// Initialize with start time \a s, processing time \a p, end time \a e, and mandatory flag \a m
void init(IntVar s, IntVar p, IntVar e, int c, BoolVar m);
//@}
/// Cast to corresponding unary task
operator Unary::OptFlexTask (void);
};
/**
* \brief Print optional task in format est:lst:pmin:pmax:c:ect:lct:m
* \relates OptFlexTask
*/
template<class Char, class Traits>
std::basic_ostream<Char,Traits>&
operator <<(std::basic_ostream<Char,Traits>& os, const OptFlexTask& t);
}}}
#include <gecode/int/cumulative/task.hpp>
namespace Gecode { namespace Int { namespace Cumulative {
/// Forward mandatory fixed task view
typedef ManFixPTask ManFixPTaskFwd;
/// Backward (dual) mandatory fixed task view
typedef FwdToBwd<ManFixPTaskFwd> ManFixPTaskBwd;
/// Forward mandatory fixed task view
typedef ManFixPSETask ManFixPSETaskFwd;
/// Backward (dual) mandatory fixed task view
typedef FwdToBwd<ManFixPSETaskFwd> ManFixPSETaskBwd;
/// Forward optional fixed task view
typedef OptFixPTask OptFixPTaskFwd;
/// Backward (dual) optional fixed task view
typedef FwdToBwd<OptFixPTaskFwd> OptFixPTaskBwd;
/// Forward optional fixed task view
typedef OptFixPSETask OptFixPSETaskFwd;
/// Backward (dual) optional fixed task view
typedef FwdToBwd<OptFixPSETaskFwd> OptFixPSETaskBwd;
/// Forward mandatory flexible task view
typedef ManFlexTask ManFlexTaskFwd;
/// Backward (dual) mandatory flexible task view
typedef FwdToBwd<ManFlexTaskFwd> ManFlexTaskBwd;
/// Forward optional flexible task view
typedef OptFlexTask OptFlexTaskFwd;
/// Backward (dual) optional flexible task view
typedef FwdToBwd<OptFlexTaskFwd> OptFlexTaskBwd;
/**
* \brief Print backward task view in format est:p:lct
* \relates ManFixPTaskBwd
*/
template<class Char, class Traits>
std::basic_ostream<Char,Traits>&
operator <<(std::basic_ostream<Char,Traits>& os, const ManFixPTaskBwd& t);
/**
* \brief Print backward task view in format est:p:lct
* \relates ManFixPSETaskBwd
*/
template<class Char, class Traits>
std::basic_ostream<Char,Traits>&
operator <<(std::basic_ostream<Char,Traits>& os, const ManFixPSETaskBwd& t);
/**
* \brief Print optional backward task view in format est:p:lct:m
* \relates OptFixPTaskBwd
*/
template<class Char, class Traits>
std::basic_ostream<Char,Traits>&
operator <<(std::basic_ostream<Char,Traits>& os, const OptFixPTaskBwd& t);
/**
* \brief Print optional backward task view in format est:p:lct:m
* \relates OptFixPSETaskBwd
*/
template<class Char, class Traits>
std::basic_ostream<Char,Traits>&
operator <<(std::basic_ostream<Char,Traits>& os, const OptFixPSETaskBwd& t);
}}}
#include <gecode/int/cumulative/task-view.hpp>
namespace Gecode { namespace Int {
/// Task view traits for forward task views
template<>
class TaskViewTraits<Cumulative::ManFixPTaskFwd> {
public:
/// The task type
typedef Cumulative::ManFixPTask Task;
};
/// Task view traits for backward task views
template<>
class TaskViewTraits<Cumulative::ManFixPTaskBwd> {
public:
/// The task type
typedef Cumulative::ManFixPTask Task;
};
/// Task view traits for forward task views
template<>
class TaskViewTraits<Cumulative::ManFixPSETaskFwd> {
public:
/// The task type
typedef Cumulative::ManFixPSETask Task;
};
/// Task view traits for backward task views
template<>
class TaskViewTraits<Cumulative::ManFixPSETaskBwd> {
public:
/// The task type
typedef Cumulative::ManFixPSETask Task;
};
/// Task view traits for forward optional task views
template<>
class TaskViewTraits<Cumulative::OptFixPTaskFwd> {
public:
/// The task type
typedef Cumulative::OptFixPTask Task;
};
/// Task view traits for backward task views
template<>
class TaskViewTraits<Cumulative::OptFixPTaskBwd> {
public:
/// The task type
typedef Cumulative::OptFixPTask Task;
};
/// Task view traits for forward optional task views
template<>
class TaskViewTraits<Cumulative::OptFixPSETaskFwd> {
public:
/// The task type
typedef Cumulative::OptFixPSETask Task;
};
/// Task view traits for backward task views
template<>
class TaskViewTraits<Cumulative::OptFixPSETaskBwd> {
public:
/// The task type
typedef Cumulative::OptFixPSETask Task;
};
/// Task view traits for forward task views
template<>
class TaskViewTraits<Cumulative::ManFlexTaskFwd> {
public:
/// The task type
typedef Cumulative::ManFlexTask Task;
};
/// Task view traits for backward task views
template<>
class TaskViewTraits<Cumulative::ManFlexTaskBwd> {
public:
/// The task type
typedef Cumulative::ManFlexTask Task;
};
/// Task view traits for forward optional task views
template<>
class TaskViewTraits<Cumulative::OptFlexTaskFwd> {
public:
/// The task type
typedef Cumulative::OptFlexTask Task;
};
/// Task view traits for backward task views
template<>
class TaskViewTraits<Cumulative::OptFlexTaskBwd> {
public:
/// The task type
typedef Cumulative::OptFlexTask Task;
};
/// Task traits for mandatory fixed tasks
template<>
class TaskTraits<Cumulative::ManFixPTask> {
public:
/// The forward task view type
typedef Cumulative::ManFixPTaskFwd TaskViewFwd;
/// The backward task view type
typedef Cumulative::ManFixPTaskBwd TaskViewBwd;
/// The corresponding unary task type
typedef Unary::ManFixPTask UnaryTask;
};
/// Task traits for mandatory fixed tasks
template<>
class TaskTraits<Cumulative::ManFixPSETask> {
public:
/// The forward task view type
typedef Cumulative::ManFixPSETaskFwd TaskViewFwd;
/// The backward task view type
typedef Cumulative::ManFixPSETaskBwd TaskViewBwd;
/// The corresponding unary task type
typedef Unary::ManFixPSETask UnaryTask;
};
/// Task traits for optional fixed tasks
template<>
class TaskTraits<Cumulative::OptFixPTask> {
public:
/// The forward task view type
typedef Cumulative::OptFixPTaskFwd TaskViewFwd;
/// The backward task view type
typedef Cumulative::OptFixPTaskBwd TaskViewBwd;
/// The corresponding mandatory task
typedef Cumulative::ManFixPTask ManTask;
/// The corresponding unary task type
typedef Unary::OptFixPTask UnaryTask;
};
/// Task traits for optional fixed tasks
template<>
class TaskTraits<Cumulative::OptFixPSETask> {
public:
/// The forward task view type
typedef Cumulative::OptFixPSETaskFwd TaskViewFwd;
/// The backward task view type
typedef Cumulative::OptFixPSETaskBwd TaskViewBwd;
/// The corresponding mandatory task
typedef Cumulative::ManFixPSETask ManTask;
/// The corresponding unary task type
typedef Unary::OptFixPSETask UnaryTask;
};
/// Task traits for mandatory flexible tasks
template<>
class TaskTraits<Cumulative::ManFlexTask> {
public:
/// The forward task view type
typedef Cumulative::ManFlexTaskFwd TaskViewFwd;
/// The backward task view type
typedef Cumulative::ManFlexTaskBwd TaskViewBwd;
/// The corresponding unary task type
typedef Unary::ManFlexTask UnaryTask;
};
/// Task traits for optional flexible tasks
template<>
class TaskTraits<Cumulative::OptFlexTask> {
public:
/// The forward task view type
typedef Cumulative::OptFlexTaskFwd TaskViewFwd;
/// The backward task view type
typedef Cumulative::OptFlexTaskBwd TaskViewBwd;
/// The corresponding mandatory task
typedef Cumulative::ManFlexTask ManTask;
/// The corresponding unary task type
typedef Unary::OptFlexTask UnaryTask;
};
}}
namespace Gecode { namespace Int { namespace Cumulative {
/// Node for an omega tree
class OmegaNode {
public:
/// Energy for subtree
long long int e;
/// Energy envelope for subtree
long long int env;
/// Initialize node from left child \a l and right child \a r
void init(const OmegaNode& l, const OmegaNode& r);
/// Update node from left child \a l and right child \a r
void update(const OmegaNode& l, const OmegaNode& r);
};
/// Omega trees for computing ect of task sets
template<class TaskView>
class OmegaTree : public TaskTree<TaskView,OmegaNode> {
protected:
using TaskTree<TaskView,OmegaNode>::tasks;
using TaskTree<TaskView,OmegaNode>::leaf;
using TaskTree<TaskView,OmegaNode>::root;
using TaskTree<TaskView,OmegaNode>::init;
using TaskTree<TaskView,OmegaNode>::update;
/// Capacity
int c;
public:
/// Initialize tree for tasks \a t and capacity \a c
OmegaTree(Region& r, int c, const TaskViewArray<TaskView>& t);
/// Insert task with index \a i
void insert(int i);
/// Remove task with index \a i
void remove(int i);
/// Return energy envelope of all tasks
long long int env(void) const;
};
/// Node for an extended omega tree
class ExtOmegaNode : public OmegaNode {
public:
/// Energy envelope for subtree
long long int cenv;
/// Initialize node from left child \a l and right child \a r
void init(const ExtOmegaNode& l, const ExtOmegaNode& r);
/// Update node from left child \a l and right child \a r
void update(const ExtOmegaNode& l, const ExtOmegaNode& r);
};
/// Omega trees for computing ect of task sets
template<class TaskView>
class ExtOmegaTree : public TaskTree<TaskView,ExtOmegaNode> {
protected:
using TaskTree<TaskView,ExtOmegaNode>::tasks;
using TaskTree<TaskView,ExtOmegaNode>::leaf;
using TaskTree<TaskView,ExtOmegaNode>::root;
using TaskTree<TaskView,ExtOmegaNode>::init;
using TaskTree<TaskView,ExtOmegaNode>::update;
using TaskTree<TaskView,ExtOmegaNode>::node;
using TaskTree<TaskView,ExtOmegaNode>::n_leaf;
using TaskTree<TaskView,ExtOmegaNode>::n_left;
using TaskTree<TaskView,ExtOmegaNode>::left;
using TaskTree<TaskView,ExtOmegaNode>::n_right;
using TaskTree<TaskView,ExtOmegaNode>::right;
using TaskTree<TaskView,ExtOmegaNode>::n_root;
using TaskTree<TaskView,ExtOmegaNode>::n_parent;
using TaskTree<TaskView,ExtOmegaNode>::n_nodes;
using TaskTree<TaskView,ExtOmegaNode>::_leaf;
/// Capacity
int c, ci;
public:
/// Initialize tree for tasks \a t and capacity \a c
template<class Node>
ExtOmegaTree(Region& r, int c, const TaskTree<TaskView,Node>& t);
/// Initialize tasks for current capacity \a ci
void init(int ci);
/// Compute update for task with index \a i
long long int env(int i);
};
/// Node for an omega lambda tree
class OmegaLambdaNode : public OmegaNode {
public:
/// Undefined task
static const int undef = -1;
/// Energy for subtree
long long int le;
/// Energy envelope for subtree
long long int lenv;
/// Node which is responsible for le
int resLe;
/// Node which is responsible for lenv
int resLenv;
/// Initialize node from left child \a l and right child \a r
void init(const OmegaLambdaNode& l, const OmegaLambdaNode& r);
/// Update node from left child \a l and right child \a r
void update(const OmegaLambdaNode& l, const OmegaLambdaNode& r);
};
/// Omega-lambda trees for computing ect of task sets
template<class TaskView>
class OmegaLambdaTree : public TaskTree<TaskView,OmegaLambdaNode> {
protected:
using TaskTree<TaskView,OmegaLambdaNode>::tasks;
using TaskTree<TaskView,OmegaLambdaNode>::leaf;
using TaskTree<TaskView,OmegaLambdaNode>::root;
using TaskTree<TaskView,OmegaLambdaNode>::init;
using TaskTree<TaskView,OmegaLambdaNode>::update;
/// Capacity
int c;
public:
/// Initialize tree for tasks \a t and capcity \a c with all tasks included in omega
OmegaLambdaTree(Region& r, int c, const TaskViewArray<TaskView>& t);
/// Shift task with index \a i from omega to lambda
void shift(int i);
/// Remove task with index \a i from lambda
void lremove(int i);
/// Whether has responsible task
bool lempty(void) const;
/// Return responsible task
int responsible(void) const;
/// Return energy envelope of all tasks
long long int env(void) const;
/// Return energy envelope of all tasks excluding lambda tasks
long long int lenv(void) const;
};
}}}
#include <gecode/int/cumulative/tree.hpp>
namespace Gecode { namespace Int { namespace Cumulative {
/// Perform basic propagation
template<class Task, class Cap>
ExecStatus basic(Space& home, bool& subsumed, Cap c, TaskArray<Task>& t);
/// Check mandatory tasks \a t for overload
template<class ManTask>
ExecStatus overload(Space& home, int c, TaskArray<ManTask>& t);
/// Propagate by edge finding
template<class Task>
ExecStatus edgefinding(Space& home, int c, TaskArray<Task>& t);
/**
* \brief Scheduling propagator for cumulative resource with mandatory tasks
*
* Requires \code #include <gecode/int/cumulative.hh> \endcode
* \ingroup FuncIntProp
*/
template<class ManTask, class Cap>
class ManProp : public TaskProp<ManTask,Int::PC_INT_DOM> {
protected:
using TaskProp<ManTask,Int::PC_INT_DOM>::t;
/// Resource capacity
Cap c;
/// Constructor for creation
ManProp(Home home, Cap c, TaskArray<ManTask>& t);
/// Constructor for cloning \a p
ManProp(Space& home, bool shared, ManProp& p);
public:
/// Perform copying during cloning
virtual Actor* copy(Space& home, bool share);
/// Perform propagation
virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
/// Post propagator that schedules tasks on cumulative resource
static ExecStatus post(Home home, Cap c, TaskArray<ManTask>& t);
/// Delete propagator and return its size
virtual size_t dispose(Space& home);
};
/**
* \brief Scheduling propagator for cumulative resource with optional tasks
*
* Requires \code #include <gecode/int/cumulative.hh> \endcode
* \ingroup FuncIntProp
*/
template<class OptTask, class Cap>
class OptProp : public TaskProp<OptTask,Int::PC_INT_DOM> {
protected:
using TaskProp<OptTask,Int::PC_INT_DOM>::t;
/// Resource capacity
Cap c;
/// Constructor for creation
OptProp(Home home, Cap c, TaskArray<OptTask>& t);
/// Constructor for cloning \a p
OptProp(Space& home, bool shared, OptProp& p);
public:
/// Perform copying during cloning
virtual Actor* copy(Space& home, bool share);
/// Perform propagation
virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
/// Post propagator that schedules tasks on cumulative resource
static ExecStatus post(Home home, Cap c, TaskArray<OptTask>& t);
/// Delete propagator and return its size
virtual size_t dispose(Space& home);
};
}}}
#include <gecode/int/cumulative/basic.hpp>
#include <gecode/int/cumulative/overload.hpp>
#include <gecode/int/cumulative/edge-finding.hpp>
#include <gecode/int/cumulative/man-prop.hpp>
#include <gecode/int/cumulative/opt-prop.hpp>
#endif
// STATISTICS: int-prop
|