overload.hpp
Go to the documentation of this file.
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christian Schulte, 2009
*
* 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 Int { namespace Unary {
// Overload checking for mandatory tasks
template<class ManTask>
ExecStatus
overload(TaskArray<ManTask>& t) {
TaskViewArray<typename TaskTraits<ManTask>::TaskViewFwd> f(t);
sort<typename TaskTraits<ManTask>::TaskViewFwd,STO_LCT,true>(f);
Region r;
OmegaTree<typename TaskTraits<ManTask>::TaskViewFwd> o(r,f);
for (int i=0; i<f.size(); i++) {
o.insert(i);
if (o.ect() > f[i].lct())
return ES_FAILED;
}
return ES_OK;
}
// Overload checking for optional tasks
template<class OptTask, class PL>
ExecStatus
overload(Space& home, Propagator& p, TaskArray<OptTask>& t) {
TaskViewArray<typename TaskTraits<OptTask>::TaskViewFwd> f(t);
sort<typename TaskTraits<OptTask>::TaskViewFwd,STO_LCT,true>(f);
Region r;
OmegaLambdaTree<typename TaskTraits<OptTask>::TaskViewFwd> ol(r,f,false);
bool to_purge = false;
for (int i=0; i<f.size(); i++) {
if (f[i].optional()) {
ol.linsert(i);
} else if (f[i].mandatory()) {
ol.oinsert(i);
if (ol.ect() > f[i].lct())
return ES_FAILED;
}
while (!ol.lempty() && (ol.lect() > f[i].lct())) {
int j = ol.responsible();
GECODE_ME_CHECK(f[j].excluded(home));
ol.lremove(j);
to_purge = true;
}
}
if (to_purge)
GECODE_ES_CHECK((purge<OptTask,PL>(home,p,t)));
return ES_OK;
}
}}}
// STATISTICS: int-prop
Gecode::Int::TaskArray
Task array.
Definition task.hh:165
Gecode::Int::TaskViewArray
Task view array.
Definition task.hh:233
Gecode::Int::Unary::OmegaLambdaTree
Omega-lambda trees for computing ect of task sets.
Definition unary.hh:715
Gecode::Int::Unary::OmegaLambdaTree::responsible
int responsible(void) const
Return responsible task.
Definition tree.hpp:209
Gecode::Int::Unary::OmegaLambdaTree::lremove
void lremove(int i)
Remove task with index i from lambda.
Definition tree.hpp:193
Gecode::Int::Unary::OmegaLambdaTree::lempty
bool lempty(void) const
Whether has responsible task.
Definition tree.hpp:203
Gecode::Int::Unary::OmegaLambdaTree::oinsert
void oinsert(int i)
Insert task with index i to omega.
Definition tree.hpp:175
Gecode::Int::Unary::OmegaLambdaTree::lect
int lect(void) const
Return earliest completion time of all tasks excluding lambda tasks.
Definition tree.hpp:221
Gecode::Int::Unary::OmegaLambdaTree::linsert
void linsert(int i)
Insert task with index i to lambda.
Definition tree.hpp:183
Gecode::Int::Unary::OmegaLambdaTree::ect
int ect(void) const
Return earliest completion time of all tasks.
Definition tree.hpp:215
Gecode::Int::Unary::OmegaTree
Omega trees for computing ect of task sets.
Definition unary.hh:674
Gecode::Int::Unary::OmegaTree::insert
void insert(int i)
Insert task with index i.
Definition tree.hpp:65
Gecode::Int::Unary::OmegaTree::ect
int ect(void) const
Return earliest completion time of all tasks.
Definition tree.hpp:80
Gecode::Propagator
Base-class for propagators.
Definition core.hpp:1064
Gecode::Region
Handle to region.
Definition region.hpp:55
Gecode::Space
Computation spaces.
Definition core.hpp:1742
GECODE_ME_CHECK
#define GECODE_ME_CHECK(me)
Check whether modification event me is failed, and forward failure.
Definition macros.hpp:52
GECODE_ES_CHECK
#define GECODE_ES_CHECK(es)
Check whether execution status es is failed or subsumed, and forward failure or subsumption.
Definition macros.hpp:91
Gecode::Int::Unary
Int for unary resources
Gecode::Int::Unary::overload
ExecStatus overload(TaskArray< ManTask > &t)
Check mandatory tasks t for overload.
Definition overload.hpp:39
Gecode::Int
Finite domain integers.
Gecode::Int::sort
void sort(TaskViewArray< TaskView > &t)
Sort task view array t according to sto and inc (increasing or decreasing).
Definition sort.hpp:133
Gecode::Int::purge
ExecStatus purge(Space &home, Propagator &p, TaskArray< OptTask > &t)
Purge optional tasks that are excluded and possibly rewrite propagator.
Definition purge.hpp:38
Gecode::Int::STO_LCT
@ STO_LCT
Sort by latest completion times.
Definition task.hh:286
Gecode
Gecode toplevel namespace
Gecode::ExecStatus
ExecStatus
Definition core.hpp:472
Gecode::ES_OK
@ ES_OK
Execution is okay.
Definition core.hpp:476
Gecode::ES_FAILED
@ ES_FAILED
Execution has resulted in failure.
Definition core.hpp:474