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
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
* 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
// Overload checking for mandatory tasks
41
template
<
class
ManTask>
42
ExecStatus
43
overload
(
Space
& home,
TaskArray<ManTask>
&
t
) {
44
TaskViewArray<typename TaskTraits<ManTask>::TaskViewFwd
>
f
(
t
);
45
sort<typename TaskTraits<ManTask>::TaskViewFwd,
STO_LCT
,
true
>(
f
);
46
47
Region
r
(home);
48
OmegaTree<typename TaskTraits<ManTask>::TaskViewFwd
> o(
r
,
f
);
49
50
for
(
int
i
=0;
i
<
f
.size();
i
++) {
51
o.
insert
(
i
);
52
if
(o.
ect
() >
f
[
i
].lct())
53
return
ES_FAILED
;
54
}
55
return
ES_OK
;
56
}
57
58
// Overload checking for optional tasks
59
template
<
class
OptTask,
class
PL>
60
ExecStatus
61
overload
(
Space
& home,
Propagator
&
p
,
TaskArray<OptTask>
&
t
) {
62
TaskViewArray<typename TaskTraits<OptTask>::TaskViewFwd
>
f
(
t
);
63
sort<typename TaskTraits<OptTask>::TaskViewFwd,
STO_LCT
,
true
>(
f
);
64
65
Region
r
(home);
66
OmegaLambdaTree<typename TaskTraits<OptTask>::TaskViewFwd
> ol(
r
,
f
,
false
);
67
68
bool
to_purge =
false
;
69
70
for
(
int
i
=0;
i
<
f
.size();
i
++) {
71
if
(
f
[
i
].
optional
()) {
72
ol.
linsert
(
i
);
73
}
else
if
(
f
[
i
].mandatory()) {
74
ol.
oinsert
(
i
);
75
if
(ol.
ect
() >
f
[
i
].lct())
76
return
ES_FAILED
;
77
}
78
while
(!ol.
lempty
() && (ol.
lect
() >
f
[
i
].lct())) {
79
int
j = ol.
responsible
();
80
GECODE_ME_CHECK
(
f
[j].excluded(home));
81
ol.
lremove
(j);
82
to_purge =
true
;
83
}
84
}
85
86
if
(to_purge)
87
GECODE_ES_CHECK
((purge<OptTask,PL>(home,
p
,
t
)));
88
return
ES_OK
;
89
}
90
91
}}}
92
93
// 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:225
Gecode::Int::NoOverlap::optional
bool optional(const BoolVarArgs &m)
Definition:
no-overlap.cpp:45
Gecode::Int::Unary::OmegaLambdaTree
Omega-lambda trees for computing ect of task sets.
Definition:
unary.hh:719
Test::Int::Basic::i
Gecode::IntArgs i(4, 1, 2, 3, 4)
t
NodeType t
Type of node.
Definition:
bool-expr.cpp:234
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::STO_LCT
@ STO_LCT
Sort by latest completion times.
Definition:
task.hh:290
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
Gecode::Int::Unary::OmegaLambdaTree::responsible
int responsible(void) const
Return responsible task.
Definition:
tree.hpp:213
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::Unary::OmegaLambdaTree::oinsert
void oinsert(int i)
Insert task with index i to omega.
Definition:
tree.hpp:179
Gecode::Int::Unary::OmegaLambdaTree::linsert
void linsert(int i)
Insert task with index i to lambda.
Definition:
tree.hpp:187
Gecode::Int::Unary::OmegaTree
Omega trees for computing ect of task sets.
Definition:
unary.hh:678
Gecode::Int::Unary::OmegaLambdaTree::ect
int ect(void) const
Return earliest completion time of all tasks.
Definition:
tree.hpp:219
Gecode::Int::Unary::OmegaLambdaTree::lempty
bool lempty(void) const
Whether has responsible task.
Definition:
tree.hpp:207
Gecode::Int::Unary::overload
ExecStatus overload(Space &home, TaskArray< ManTask > &t)
Check mandatory tasks t for overload.
Definition:
overload.hpp:43
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::ES_FAILED
@ ES_FAILED
Execution has resulted in failure.
Definition:
core.hpp:542
Gecode::Int::Unary::OmegaLambdaTree::lremove
void lremove(int i)
Remove task with index i from lambda.
Definition:
tree.hpp:197
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::ExecStatus
ExecStatus
Definition:
core.hpp:540