main page
modules
namespaces
classes
files
Gecode home
Generated on Fri Aug 31 2012 16:21:28 for Gecode by
doxygen
1.8.1.2
gecode
int
unary
detectable.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: 2011-05-26 00:56:41 +1000 (Thu, 26 May 2011) $ by $Author: schulte $
11
* $Revision: 12022 $
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
namespace
Gecode {
namespace
Int {
namespace
Unary {
39
40
template
<
class
ManTaskView>
41
forceinline
ExecStatus
42
detectable
(
Space
& home,
TaskViewArray<ManTaskView>
& t) {
43
sort<ManTaskView,STO_ECT,true>(t);
44
45
Region
r
(home);
46
47
OmegaTree<ManTaskView>
o(r,t);
48
TaskViewIter<ManTaskView,STO_LST,true>
q(r,t);
49
int
* est = r.alloc<
int
>(t.
size
());
50
51
for
(
int
i
=0;
i
<t.
size
();
i
++) {
52
while
(q() && (t[
i
].ect() > t[q.
task
()].lst())) {
53
o.
insert
(q.
task
()); ++q;
54
}
55
est[
i
] = o.
ect
(
i
);
56
}
57
58
for
(
int
i
=t.
size
();
i
--; )
59
GECODE_ME_CHECK
(t[
i
].est(home,est[
i
]));
60
61
return
ES_OK
;
62
}
63
64
template
<
class
ManTask>
65
ExecStatus
66
detectable
(
Space
& home,
TaskArray<ManTask>
& t) {
67
TaskViewArray<typename TaskTraits<ManTask>::TaskViewFwd
> f(t);
68
GECODE_ES_CHECK
(
detectable
(home,f));
69
TaskViewArray<typename TaskTraits<ManTask>::TaskViewBwd
>
b
(t);
70
return
detectable
(home,b);
71
}
72
73
74
template
<
class
OptTaskView>
75
forceinline
ExecStatus
76
detectable
(
Space
& home,
Propagator
& p,
TaskViewArray<OptTaskView>
& t) {
77
sort<OptTaskView,STO_ECT,true>(t);
78
79
Region
r
(home);
80
81
OmegaTree<OptTaskView>
o(r,t);
82
ManTaskViewIter<OptTaskView,STO_LST,true>
q(r,t);
83
int
* est = r.alloc<
int
>(t.
size
());
84
85
for
(
int
i
=0;
i
<t.
size
();
i
++) {
86
while
(q() && (t[
i
].ect() > t[q.
task
()].lst())) {
87
o.
insert
(q.
task
()); ++q;
88
}
89
est[
i
] = o.
ect
(
i
);
90
}
91
92
int
n = t.
size
();
93
for
(
int
i
=n;
i
--; )
94
if
(t[
i
].mandatory()) {
95
GECODE_ME_CHECK
(t[
i
].est(home,est[
i
]));
96
}
else
if
(est[
i
] > t[
i
].lst()) {
97
GECODE_ME_CHECK
(t[
i
].excluded(home));
98
t[
i
].cancel(home,p,
Int::PC_INT_BND
); t[
i
]=t[--n];
99
}
100
t.
size
(n);
101
102
return
(t.
size
() < 2) ? home.
ES_SUBSUMED
(p) :
ES_OK
;
103
}
104
105
template
<
class
OptTask>
106
ExecStatus
107
detectable
(
Space
& home,
Propagator
& p,
TaskArray<OptTask>
& t) {
108
TaskViewArray<typename TaskTraits<OptTask>::TaskViewFwd
> f(t);
109
GECODE_ES_CHECK
(
detectable
(home,p,f));
110
TaskViewArray<typename TaskTraits<OptTask>::TaskViewBwd
>
b
(t);
111
return
detectable
(home,p,b);
112
}
113
114
}}}
115
116
// STATISTICS: int-prop