main page
modules
namespaces
classes
files
Gecode home
Generated on Mon Feb 8 2021 00:00:00 for Gecode by
doxygen
1.8.20
gecode
int
unary
opt-prop.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
#include <algorithm>
35
36
namespace
Gecode
{
namespace
Int {
namespace
Unary {
37
38
template
<
class
OptTask,
class
PL>
39
forceinline
40
OptProp<OptTask,PL>::OptProp
(
Home
home,
TaskArray<OptTask>
&
t
)
41
:
TaskProp
<OptTask,PL>(home,
t
) {}
42
43
template
<
class
OptTask,
class
PL>
44
forceinline
45
OptProp<OptTask,PL>::OptProp
(
Space
& home,
OptProp<OptTask,PL>
&
p
)
46
:
TaskProp
<OptTask,PL>(home,
p
) {}
47
48
template
<
class
OptTask,
class
PL>
49
ExecStatus
50
OptProp<OptTask,PL>::post
(
Home
home,
TaskArray<OptTask>
&
t
) {
51
int
m=0, o=0;
52
for
(
int
i
=0;
i
<
t
.size();
i
++) {
53
if
(
t
[
i
].mandatory())
54
m++;
55
else
if
(
t
[
i
].
optional
())
56
o++;
57
}
58
if
(m ==
t
.size()) {
59
TaskArray<typename TaskTraits<OptTask>::ManTask
> mt(home,m);
60
for
(
int
i
=0;
i
<m;
i
++)
61
mt[
i
].init(
t
[
i
]);
62
return
ManProp<typename TaskTraits<OptTask>::ManTask
,PL>
::post
(home,mt);
63
}
64
if
(o+m > 1)
65
(void)
new
(home)
OptProp<OptTask,PL>
(home,
t
);
66
return
ES_OK
;
67
}
68
69
template
<
class
OptTask,
class
PL>
70
Actor
*
71
OptProp<OptTask,PL>::copy
(
Space
& home) {
72
return
new
(home)
OptProp<OptTask,PL>
(home,*
this
);
73
}
74
75
template
<
class
OptTask,
class
PL>
76
ExecStatus
77
OptProp<OptTask,PL>::propagate
(
Space
& home,
const
ModEventDelta
& med) {
78
// Did one of the Boolean views change?
79
if
(
BoolView::me
(med) ==
ME_BOOL_VAL
)
80
GECODE_ES_CHECK
((purge<OptTask,PL>(home,*
this
,
t
)));
81
82
GECODE_ES_CHECK
((overload<OptTask,PL>(home,*
this
,
t
)));
83
84
if
(PL::basic)
85
GECODE_ES_CHECK
(
timetabling
(home,*
this
,
t
));
86
87
if
(PL::advanced) {
88
GECODE_ES_CHECK
((detectable<OptTask,PL>(home,*
this
,
t
)));
89
GECODE_ES_CHECK
((notfirstnotlast<OptTask,PL>(home,*
this
,
t
)));
90
91
// Partition into mandatory and optional activities
92
int
n
=
t
.size();
93
int
i
=0, j=
n
-1;
94
while
(
true
) {
95
while
((
i
<
n
) &&
t
[
i
].mandatory())
i
++;
96
while
((j >= 0) && !
t
[j].mandatory()) j--;
97
if
(
i
>= j)
break
;
98
std::swap
(
t
[
i
],
t
[j]);
99
}
100
101
if
(
i
> 1) {
102
// Truncate array to only contain mandatory tasks
103
t
.size(
i
);
104
GECODE_ES_CHECK
(
edgefinding
(home,
t
));
105
// Restore to also include optional tasks
106
t
.size(
n
);
107
}
108
}
109
110
if
(!PL::basic)
111
GECODE_ES_CHECK
(
subsumed
(home,*
this
,
t
));
112
113
return
ES_NOFIX
;
114
}
115
116
}}}
117
118
// STATISTICS: int-prop
Gecode::Int::NoOverlap::optional
bool optional(const BoolVarArgs &m)
Definition:
no-overlap.cpp:41
Gecode::Int::Unary::edgefinding
ExecStatus edgefinding(Space &home, TaskViewArray< TaskView > &t)
Definition:
edge-finding.hpp:40
Gecode::Int::Unary::timetabling
ExecStatus timetabling(Space &home, Propagator &p, TaskArray< Task > &t)
Perform time-tabling propagation.
Definition:
time-tabling.hpp:40
Gecode::Int::Unary::OptProp
Scheduling propagator for unary resource with optional tasks
Definition:
unary.hh:814
t
NodeType t
Type of node.
Definition:
bool-expr.cpp:230
Gecode::Space
Computation spaces.
Definition:
core.hpp:1742
Gecode::Actor
Base-class for both propagators and branchers.
Definition:
core.hpp:628
Gecode::Int::ME_BOOL_VAL
const Gecode::ModEvent ME_BOOL_VAL
Domain operation has resulted in a value (assigned variable)
Definition:
var-type.hpp:116
Gecode
Gecode toplevel namespace
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::Home
Home class for posting propagators
Definition:
core.hpp:856
Gecode::VarImpView< BoolVar >::me
static ModEvent me(const ModEventDelta &med)
Return modification event for view type in med.
Definition:
view.hpp:552
Gecode::Int::TaskProp
Propagator for tasks
Definition:
task.hh:424
Gecode::post
TFE post(PropagatorGroup g)
Only post functions (but not propagators) from g are considered.
Definition:
filter.cpp:138
Gecode::swap
IntRelType swap(IntRelType irt)
Return swapped relation type of irt.
Definition:
irt.hpp:37
Gecode::Int::Unary::OptProp::propagate
virtual ExecStatus propagate(Space &home, const ModEventDelta &med)
Perform propagation.
Definition:
opt-prop.hpp:77
Gecode::Int::Unary::ManProp
Scheduling propagator for unary resource with mandatory tasks
Definition:
unary.hh:791
Gecode::Int::Unary::subsumed
ExecStatus subsumed(Space &home, Propagator &p, TaskArray< Task > &t)
Check tasks t for subsumption.
Definition:
subsumption.hpp:38
Gecode::Int::Unary::OptProp::post
static ExecStatus post(Home home, TaskArray< OptTask > &t)
Post propagator that schedules tasks on unary resource.
Definition:
opt-prop.hpp:50
Gecode::Int::Unary::OptProp::OptProp
OptProp(Home home, TaskArray< OptTask > &t)
Constructor for creation.
Definition:
opt-prop.hpp:40
Gecode::Int::TaskArray< OptTask >
forceinline
#define forceinline
Definition:
config.hpp:192
n
int n
Number of negative literals for node type.
Definition:
bool-expr.cpp:234
Gecode::ModEventDelta
int ModEventDelta
Modification event deltas.
Definition:
core.hpp:89
Gecode::ES_NOFIX
@ ES_NOFIX
Propagation has not computed fixpoint.
Definition:
core.hpp:475
Test::Int::Basic::i
Gecode::IntArgs i({1, 2, 3, 4})
Gecode::Int::Unary::OptProp::copy
virtual Actor * copy(Space &home)
Perform copying during cloning.
Definition:
opt-prop.hpp:71
Gecode::ES_OK
@ 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