main page
modules
namespaces
classes
files
Gecode home
Generated on Wed Jan 1 2020 10:37:59 for Gecode by
doxygen
1.8.16
gecode
int
unary
overload.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
namespace
Gecode
{
namespace
Int {
namespace
Unary {
35
36
// Overload checking for mandatory tasks
37
template
<
class
ManTask>
38
ExecStatus
39
overload
(
TaskArray<ManTask>
&
t
) {
40
TaskViewArray<typename TaskTraits<ManTask>::TaskViewFwd
>
f
(
t
);
41
sort<typename TaskTraits<ManTask>::TaskViewFwd,
STO_LCT
,
true
>(
f
);
42
43
Region
r
;
44
OmegaTree<typename TaskTraits<ManTask>::TaskViewFwd
> o(
r
,
f
);
45
46
for
(
int
i
=0;
i
<
f
.size();
i
++) {
47
o.
insert
(
i
);
48
if
(o.
ect
() >
f
[
i
].lct())
49
return
ES_FAILED
;
50
}
51
return
ES_OK
;
52
}
53
54
// Overload checking for optional tasks
55
template
<
class
OptTask,
class
PL>
56
ExecStatus
57
overload
(
Space
& home,
Propagator
&
p
,
TaskArray<OptTask>
&
t
) {
58
TaskViewArray<typename TaskTraits<OptTask>::TaskViewFwd
>
f
(
t
);
59
sort<typename TaskTraits<OptTask>::TaskViewFwd,
STO_LCT
,
true
>(
f
);
60
61
Region
r
;
62
OmegaLambdaTree<typename TaskTraits<OptTask>::TaskViewFwd
> ol(
r
,
f
,
false
);
63
64
bool
to_purge =
false
;
65
66
for
(
int
i
=0;
i
<
f
.size();
i
++) {
67
if
(
f
[
i
].
optional
()) {
68
ol.
linsert
(
i
);
69
}
else
if
(
f
[
i
].mandatory()) {
70
ol.
oinsert
(
i
);
71
if
(ol.
ect
() >
f
[
i
].lct())
72
return
ES_FAILED
;
73
}
74
while
(!ol.
lempty
() && (ol.
lect
() >
f
[
i
].lct())) {
75
int
j = ol.
responsible
();
76
GECODE_ME_CHECK
(
f
[j].excluded(home));
77
ol.
lremove
(j);
78
to_purge =
true
;
79
}
80
}
81
82
if
(to_purge)
83
GECODE_ES_CHECK
((purge<OptTask,PL>(home,
p
,
t
)));
84
return
ES_OK
;
85
}
86
87
}}}
88
89
// STATISTICS: int-prop
Gecode::Int::Unary::OmegaLambdaTree::lect
int lect(void) const
Return earliest completion time of all tasks excluding lambda tasks.
Definition:
tree.hpp:221
Gecode::Int::NoOverlap::optional
bool optional(const BoolVarArgs &m)
Definition:
no-overlap.cpp:41
Gecode::Int::Unary::OmegaLambdaTree
Omega-lambda trees for computing ect of task sets.
Definition:
unary.hh:715
t
NodeType t
Type of node.
Definition:
bool-expr.cpp:230
Gecode::Space
Computation spaces.
Definition:
core.hpp:1742
Gecode::Int::Unary::OmegaTree::insert
void insert(int i)
Insert task with index i.
Definition:
tree.hpp:65
Gecode::Int::STO_LCT
Sort by latest completion times.
Definition:
task.hh:286
Gecode
Gecode toplevel namespace
Gecode::Propagator
Base-class for propagators.
Definition:
core.hpp:1064
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:91
Gecode::Int::Unary::overload
ExecStatus overload(TaskArray< ManTask > &t)
Check mandatory tasks t for overload.
Definition:
overload.hpp:39
Gecode::Int::Unary::OmegaLambdaTree::responsible
int responsible(void) const
Return responsible task.
Definition:
tree.hpp:209
Gecode::Region
Handle to region.
Definition:
region.hpp:55
Gecode::r
Post propagator for SetVar SetOpType SetVar SetRelType r
Definition:
set.hh:767
Gecode::Int::Unary::OmegaLambdaTree::oinsert
void oinsert(int i)
Insert task with index i to omega.
Definition:
tree.hpp:175
Gecode::Int::Unary::OmegaLambdaTree::linsert
void linsert(int i)
Insert task with index i to lambda.
Definition:
tree.hpp:183
Gecode::Int::Unary::OmegaTree
Omega trees for computing ect of task sets.
Definition:
unary.hh:674
Gecode::Int::Unary::OmegaLambdaTree::ect
int ect(void) const
Return earliest completion time of all tasks.
Definition:
tree.hpp:215
Gecode::Int::Unary::OmegaLambdaTree::lempty
bool lempty(void) const
Whether has responsible task.
Definition:
tree.hpp:203
Gecode::Int::TaskArray< ManTask >
Gecode::Int::Unary::OmegaTree::ect
int ect(void) const
Return earliest completion time of all tasks.
Definition:
tree.hpp:80
Gecode::Int::TaskViewArray
Task view array.
Definition:
task.hh:233
GECODE_ME_CHECK
#define GECODE_ME_CHECK(me)
Check whether modification event me is failed, and forward failure.
Definition:
macros.hpp:52
Gecode::f
Post propagator for f(x \diamond_{\mathit{op}} y) \sim_r z \f$ void rel(Home home
Gecode::ES_FAILED
Execution has resulted in failure.
Definition:
core.hpp:474
Gecode::Int::Unary::OmegaLambdaTree::lremove
void lremove(int i)
Remove task with index i from lambda.
Definition:
tree.hpp:193
Test::Int::Basic::i
Gecode::IntArgs i({1, 2, 3, 4})
Gecode::ES_OK
Execution is okay.
Definition:
core.hpp:476
p
int p
Number of positive literals for node type.
Definition:
bool-expr.cpp:232
Gecode::ExecStatus
ExecStatus
Definition:
core.hpp:472