Generated on Sat Feb 7 2015 02:01:21 for Gecode by doxygen 1.8.9.1
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  * Last modified:
10  * $Date: 2012-09-07 17:31:22 +0200 (Fri, 07 Sep 2012) $ by $Author: schulte $
11  * $Revision: 13068 $
12  *
13  * This file is part of Gecode, the generic constraint
14  * development environment:
15  * http://www.gecode.org
16  *
17  * Permission is hereby granted, free of charge, to any person obtaining
18  * a copy of this software and associated documentation files (the
19  * "Software"), to deal in the Software without restriction, including
20  * without limitation the rights to use, copy, modify, merge, publish,
21  * distribute, sublicense, and/or sell copies of the Software, and to
22  * permit persons to whom the Software is furnished to do so, subject to
23  * the following conditions:
24  *
25  * The above copyright notice and this permission notice shall be
26  * included in all copies or substantial portions of the Software.
27  *
28  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
29  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
30  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
31  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
32  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
33  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
34  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
35  *
36  */
37 
38 #include <algorithm>
39 
40 namespace Gecode { namespace Int { namespace Unary {
41 
42  template<class TaskView>
45  Region r(home);
46 
49 
50  int j = q.task();
51  while (q.left() > 1) {
52  if (ol.ect() > t[j].lct())
53  return ES_FAILED;
54  ol.shift(j);
55  ++q;
56  j = q.task();
57  while (!ol.lempty() && (ol.lect() > t[j].lct())) {
58  int i = ol.responsible();
59  GECODE_ME_CHECK(t[i].est(home,ol.ect()));
60  ol.lremove(i);
61  }
62  }
63 
64  return ES_OK;
65  }
66 
67  template<class Task>
73  return edgefinding(home,b);
74  }
75 
76 }}}
77 
78 // STATISTICS: int-prop
Omega-lambda trees for computing ect of task sets.
Definition: unary.hh:715
int left(void) const
How many tasks are left to be iterated.
Definition: iter.hpp:61
NodeType t
Type of node.
Definition: bool-expr.cpp:234
Task view array.
Definition: task.hh:233
bool lempty(void) const
Whether has responsible task.
Definition: tree.hpp:205
Task array.
Definition: task.hh:167
Handle to region.
Definition: region.hpp:61
Computation spaces.
Definition: core.hpp:1362
#define GECODE_ES_CHECK(es)
Check whether execution status es is failed or subsumed, and forward failure or subsumption.
Definition: macros.hpp:84
Gecode::IntArgs i(4, 1, 2, 3, 4)
Execution has resulted in failure.
Definition: core.hpp:525
NNF * r
Right subtree.
Definition: bool-expr.cpp:246
Allows to iterate over task views according to a specified order.
Definition: task.hh:309
int lect(void) const
Return earliest completion time of all tasks excluding lambda tasks.
Definition: tree.hpp:223
int responsible(void) const
Return responsible task.
Definition: tree.hpp:211
#define GECODE_ME_CHECK(me)
Check whether modification event me is failed, and forward failure.
Definition: macros.hpp:45
int task(void) const
Return current task position.
Definition: iter.hpp:72
ExecStatus
Definition: core.hpp:523
#define forceinline
Definition: config.hpp:132
void lremove(int i)
Remove task with index i from lambda.
Definition: tree.hpp:195
Execution is okay.
Definition: core.hpp:527
void shift(int i)
Shift task with index i from omega to lambda.
Definition: tree.hpp:165
ExecStatus edgefinding(Space &home, TaskViewArray< TaskView > &t)
struct Gecode::@518::NNF::@57::@58 b
For binary nodes (and, or, eqv)
Gecode toplevel namespace
int ect(void) const
Return earliest completion time of all tasks.
Definition: tree.hpp:217