Generated on Thu Jan 16 2025 00:00:00 for Gecode by doxygen 1.14.0
edge-finding.hpp
Go to the documentation of this file.
1/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
2/*
3 * Main authors:
4 * Christian Schulte <schulte@gecode.org>
5 *
6 * Copyright:
7 * Christian Schulte, 2009
8 *
9 * This file is part of Gecode, the generic constraint
10 * development environment:
11 * http://www.gecode.org
12 *
13 * Permission is hereby granted, free of charge, to any person obtaining
14 * a copy of this software and associated documentation files (the
15 * "Software"), to deal in the Software without restriction, including
16 * without limitation the rights to use, copy, modify, merge, publish,
17 * distribute, sublicense, and/or sell copies of the Software, and to
18 * permit persons to whom the Software is furnished to do so, subject to
19 * the following conditions:
20 *
21 * The above copyright notice and this permission notice shall be
22 * included in all copies or substantial portions of the Software.
23 *
24 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
28 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
29 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
30 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
31 *
32 */
33
34#include <algorithm>
35
36namespace Gecode { namespace Int { namespace Unary {
37
38 template<class TaskView>
41 Region r;
42
45
46 int j = q.task();
47 while (q.left() > 1) {
48 if (ol.ect() > t[j].lct())
49 return ES_FAILED;
50 ol.shift(j);
51 ++q;
52 j = q.task();
53 while (!ol.lempty() && (ol.lect() > t[j].lct())) {
54 int i = ol.responsible();
55 GECODE_ME_CHECK(t[i].est(home,ol.ect()));
56 ol.lremove(i);
57 }
58 }
59
60 return ES_OK;
61 }
62
63 template<class Task>
71
72}}}
73
74// STATISTICS: int-prop
Task array.
Definition task.hh:165
Task view array.
Definition task.hh:233
Allows to iterate over task views according to a specified order.
Definition task.hh:309
int task(void) const
Return current task position.
Definition iter.hpp:68
int left(void) const
How many tasks are left to be iterated.
Definition iter.hpp:57
Omega-lambda trees for computing ect of task sets.
Definition unary.hh:715
int responsible(void) const
Return responsible task.
Definition tree.hpp:209
void shift(int i)
Shift task with index i from omega to lambda.
Definition tree.hpp:163
void lremove(int i)
Remove task with index i from lambda.
Definition tree.hpp:193
bool lempty(void) const
Whether has responsible task.
Definition tree.hpp:203
int lect(void) const
Return earliest completion time of all tasks excluding lambda tasks.
Definition tree.hpp:221
int ect(void) const
Return earliest completion time of all tasks.
Definition tree.hpp:215
Handle to region.
Definition region.hpp:55
Computation spaces.
Definition core.hpp:1744
#define GECODE_ME_CHECK(me)
Check whether modification event me is failed, and forward failure.
Definition macros.hpp:52
#define GECODE_ES_CHECK(es)
Check whether execution status es is failed or subsumed, and forward failure or subsumption.
Definition macros.hpp:91
Int for unary resources
ExecStatus edgefinding(Space &home, TaskArray< Task > &t)
Propagate by edge-finding.
Finite domain integers.
Gecode toplevel namespace
Post propagator for SetVar SetOpType SetVar SetRelType r
Definition set.hh:773
ExecStatus
Definition core.hpp:472
@ ES_OK
Execution is okay.
Definition core.hpp:476
@ ES_FAILED
Execution has resulted in failure.
Definition core.hpp:474
#define forceinline
Definition config.hpp:194