main page
modules
namespaces
classes
files
Gecode home
Generated on Sat Nov 9 2013 19:18:28 for Gecode by
doxygen
1.8.4
gecode
int
unary
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>
43
forceinline
ExecStatus
44
edgefinding
(
Space
& home,
TaskViewArray<TaskView>
&
t
) {
45
Region
r
(home);
46
47
OmegaLambdaTree<TaskView>
ol(r,t);
48
TaskViewIter<TaskView,STO_LCT,false>
q(r,t);
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>
68
ExecStatus
69
edgefinding
(
Space
& home,
TaskArray<Task>
&
t
) {
70
TaskViewArray<typename TaskTraits<Task>::TaskViewFwd
> f(t);
71
GECODE_ES_CHECK
(
edgefinding
(home,f));
72
TaskViewArray<typename TaskTraits<Task>::TaskViewBwd
>
b
(t);
73
return
edgefinding
(home,b);
74
}
75
76
}}}
77
78
// STATISTICS: int-prop