edge-finding.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.
*
*/
#include <algorithm>
namespace Gecode { namespace Int { namespace Unary {
template<class TaskView>
forceinline ExecStatus
edgefinding(Space& home, TaskViewArray<TaskView>& t) {
Region r;
OmegaLambdaTree<TaskView> ol(r,t);
TaskViewIter<TaskView,STO_LCT,false> q(r,t);
int j = q.task();
while (q.left() > 1) {
if (ol.ect() > t[j].lct())
return ES_FAILED;
ol.shift(j);
++q;
j = q.task();
while (!ol.lempty() && (ol.lect() > t[j].lct())) {
int i = ol.responsible();
GECODE_ME_CHECK(t[i].est(home,ol.ect()));
ol.lremove(i);
}
}
return ES_OK;
}
template<class Task>
ExecStatus
edgefinding(Space& home, TaskArray<Task>& t) {
TaskViewArray<typename TaskTraits<Task>::TaskViewFwd> f(t);
GECODE_ES_CHECK(edgefinding(home,f));
TaskViewArray<typename TaskTraits<Task>::TaskViewBwd> b(t);
return edgefinding(home,b);
}
}}}
// STATISTICS: int-prop
Gecode::Int::TaskArray
Task array.
Definition task.hh:165
Gecode::Int::TaskViewArray
Task view array.
Definition task.hh:233
Gecode::Int::TaskViewIter
Allows to iterate over task views according to a specified order.
Definition task.hh:309
Gecode::Int::TaskViewIter::task
int task(void) const
Return current task position.
Definition iter.hpp:68
Gecode::Int::TaskViewIter::left
int left(void) const
How many tasks are left to be iterated.
Definition iter.hpp:57
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::shift
void shift(int i)
Shift task with index i from omega to lambda.
Definition tree.hpp:163
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::lect
int lect(void) const
Return earliest completion time of all tasks excluding lambda tasks.
Definition tree.hpp:221
Gecode::Int::Unary::OmegaLambdaTree::ect
int ect(void) const
Return earliest completion time of all tasks.
Definition tree.hpp:215
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::edgefinding
ExecStatus edgefinding(Space &home, TaskArray< Task > &t)
Propagate by edge-finding.
Definition edge-finding.hpp:65
Gecode::Int
Finite domain integers.
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
forceinline
#define forceinline
Definition config.hpp:187