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
not-first-not-last.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
#include <algorithm>
39
40
namespace
Gecode
{
namespace
Int {
namespace
Unary {
41
42
template
<
class
ManTaskView>
43
forceinline
ExecStatus
44
notlast
(
Space
& home,
TaskViewArray<ManTaskView>
&
t
) {
45
sort<ManTaskView,STO_LCT,true>(
t
);
46
47
Region
r
(home);
48
49
OmegaTree<ManTaskView>
o(
r
,
t
);
50
TaskViewIter<ManTaskView,STO_LST,true>
q(
r
,
t
);
51
int
* lct =
r
.alloc<
int
>(
t
.size());
52
53
for
(
int
i
=
t
.size();
i
--; )
54
lct[
i
] =
t
[
i
].lct();
55
56
for
(
int
i
=0;
i
<
t
.size();
i
++) {
57
int
j = -1;
58
while
(q() && (
t
[
i
].lct() >
t
[q.
task
()].lst())) {
59
if
((j >= 0) && (o.
ect
() >
t
[q.
task
()].lst()))
60
lct[q.
task
()] =
std::min
(lct[q.
task
()],
t
[j].lst());
61
j = q.
task
();
62
o.
insert
(j); ++q;
63
}
64
if
((j >= 0) && (o.
ect
(
i
) >
t
[
i
].lst()))
65
lct[
i
] =
std::min
(lct[
i
],
t
[j].lst());
66
}
67
68
for
(
int
i
=
t
.size();
i
--; )
69
GECODE_ME_CHECK
(
t
[
i
].lct(home,lct[
i
]));
70
71
return
ES_OK
;
72
}
73
74
template
<
class
ManTask>
75
ExecStatus
76
notfirstnotlast
(
Space
& home,
TaskArray<ManTask>
&
t
) {
77
TaskViewArray<typename TaskTraits<ManTask>::TaskViewFwd
>
f
(
t
);
78
GECODE_ES_CHECK
(
notlast
(home,
f
));
79
TaskViewArray<typename TaskTraits<ManTask>::TaskViewBwd
>
b
(
t
);
80
return
notlast
(home,
b
);
81
}
82
83
template
<
class
OptTaskView,
class
PL>
84
forceinline
ExecStatus
85
notlast
(
Space
& home,
Propagator
&
p
,
TaskViewArray<OptTaskView>
&
t
) {
86
sort<OptTaskView,STO_LCT,true>(
t
);
87
88
Region
r
(home);
89
90
OmegaTree<OptTaskView>
o(
r
,
t
);
91
ManTaskViewIter<OptTaskView,STO_LST,true>
q(
r
,
t
);
92
int
* lct =
r
.alloc<
int
>(
t
.size());
93
94
for
(
int
i
=
t
.size();
i
--; )
95
lct[
i
] =
t
[
i
].lct();
96
97
for
(
int
i
=0;
i
<
t
.size();
i
++) {
98
int
j = -1;
99
while
(q() && (
t
[
i
].lct() >
t
[q.
task
()].lst())) {
100
if
((j >= 0) && (o.
ect
() >
t
[q.
task
()].lst()))
101
lct[q.
task
()] =
std::min
(lct[q.
task
()],
t
[j].lst());
102
j = q.
task
();
103
o.
insert
(j); ++q;
104
}
105
if
((j >= 0) && (o.
ect
(
i
) >
t
[
i
].lst()))
106
lct[
i
] =
std::min
(lct[
i
],
t
[j].lst());
107
}
108
109
{
110
int
n
=
t
.size();
111
for
(
int
i
=
n
;
i
--; )
112
if
(
t
[
i
].mandatory()) {
113
GECODE_ME_CHECK
(
t
[
i
].lct(home,lct[
i
]));
114
}
else
if
(lct[
i
] <
t
[
i
].ect()) {
115
GECODE_ME_CHECK
(
t
[
i
].excluded(home));
116
t
[
i
].cancel(home,
p
,PL::pc);
t
[
i
]=
t
[--
n
];
117
}
118
t
.size(
n
);
119
}
120
121
return
(
t
.size() < 2) ? home.
ES_SUBSUMED
(
p
) :
ES_OK
;
122
}
123
124
template
<
class
OptTask,
class
PL>
125
ExecStatus
126
notfirstnotlast
(
Space
& home,
Propagator
&
p
,
TaskArray<OptTask>
&
t
) {
127
TaskViewArray<typename TaskTraits<OptTask>::TaskViewFwd
>
f
(
t
);
128
GECODE_ES_CHECK
((
notlast
<
typename
TaskTraits<OptTask>::TaskViewFwd
,PL>
129
(home,
p
,
f
)));
130
TaskViewArray<typename TaskTraits<OptTask>::TaskViewBwd
>
b
(
t
);
131
return
notlast<typename TaskTraits<OptTask>::TaskViewBwd,PL>(home,
p
,
b
);
132
}
133
134
}}}
135
136
// 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::Float::Limits::min
const FloatNum min
Smallest allowed float value.
Definition:
float.hh:850
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::notlast
ExecStatus notlast(Space &home, TaskViewArray< ManTaskView > &t)
Definition:
not-first-not-last.hpp:44
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::Unary::notfirstnotlast
ExecStatus notfirstnotlast(Space &home, TaskArray< ManTask > &t)
Propagate not-first and not-last.
Definition:
not-first-not-last.hpp:76
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
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