main page
modules
namespaces
classes
files
Gecode home
Generated on Tue Jan 28 2020 00:00:00 for Gecode by
doxygen
1.8.17
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: 2016-04-19 17:19:45 +0200 (Tue, 19 Apr 2016) $ by $Author: schulte $
11
* $Revision: 14967 $
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,
class
PL>
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
,PL::pc);
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,
class
PL>
106
ExecStatus
107
detectable
(
Space
& home,
Propagator
&
p
,
TaskArray<OptTask>
&
t
) {
108
TaskViewArray<typename TaskTraits<OptTask>::TaskViewFwd
>
f
(
t
);
109
GECODE_ES_CHECK
((
detectable
<
typename
TaskTraits<OptTask>::TaskViewFwd
,PL>
110
(home,
p
,
f
)));
111
TaskViewArray<typename TaskTraits<OptTask>::TaskViewBwd
>
b
(
t
);
112
return
detectable<typename TaskTraits<OptTask>::TaskViewBwd,PL>
113
(home,
p
,
b
);
114
}
115
116
}}}
117
118
// STATISTICS: int-prop
forceinline
#define forceinline
Definition:
config.hpp:173
Gecode::Space::ES_SUBSUMED
ExecStatus ES_SUBSUMED(Propagator &p)
Definition:
core.hpp:3614
Test::Int::Basic::i
Gecode::IntArgs i(4, 1, 2, 3, 4)
t
NodeType t
Type of node.
Definition:
bool-expr.cpp:234
Gecode::Int::ManTaskViewIter
Allows to iterate over mandatory task views according to a specified order.
Definition:
task.hh:343
Gecode::Space
Computation spaces.
Definition:
core.hpp:1748
Gecode::Int::Unary::OmegaTree::insert
void insert(int i)
Insert task with index i.
Definition:
tree.hpp:69
Gecode::Int::TaskTraits
Traits class for mapping tasks to task views.
Definition:
task.hh:161
Gecode
Gecode toplevel namespace
Gecode::Propagator
Base-class for propagators.
Definition:
core.hpp:1092
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:95
b
struct Gecode::@579::NNF::@61::@62 b
For binary nodes (and, or, eqv)
Gecode::Region
Handle to region.
Definition:
region.hpp:61
Gecode::r
Post propagator for SetVar SetOpType SetVar SetRelType r
Definition:
set.hh:784
Gecode::Int::TaskViewIter::task
int task(void) const
Return current task position.
Definition:
iter.hpp:72
Gecode::Int::Unary::OmegaTree
Omega trees for computing ect of task sets.
Definition:
unary.hh:678
Gecode::Int::TaskArray< ManTask >
Gecode::Int::Unary::OmegaTree::ect
int ect(void) const
Return earliest completion time of all tasks.
Definition:
tree.hpp:84
Gecode::Int::TaskViewArray
Task view array.
Definition:
task.hh:237
GECODE_ME_CHECK
#define GECODE_ME_CHECK(me)
Check whether modification event me is failed, and forward failure.
Definition:
macros.hpp:56
Gecode::f
Post propagator for f(x \diamond_{\mathit{op}} y) \sim_r z \f$ void rel(Home home
Gecode::Int::Unary::detectable
ExecStatus detectable(Space &home, TaskViewArray< ManTaskView > &t)
Definition:
detectable.hpp:42
n
int n
Number of negative literals for node type.
Definition:
bool-expr.cpp:238
Gecode::ES_OK
@ ES_OK
Execution is okay.
Definition:
core.hpp:544
p
int p
Number of positive literals for node type.
Definition:
bool-expr.cpp:236
Gecode::Int::TaskViewIter
Allows to iterate over task views according to a specified order.
Definition:
task.hh:313
Gecode::ExecStatus
ExecStatus
Definition:
core.hpp:540