Generated on Tue Feb 11 2025 17:33:26 for Gecode by doxygen 1.12.0
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
36namespace Gecode { namespace Int { namespace Unary {
37
38 template<class OptTask, class PL>
42
43 template<class OptTask, class PL>
47
48 template<class OptTask, class PL>
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()) {
60 for (int i=0; i<m; i++)
61 mt[i].init(t[i]);
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*
72 return new (home) OptProp<OptTask,PL>(home,*this);
73 }
74
75 template<class OptTask, class PL>
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
83
84 if (PL::basic)
85 GECODE_ES_CHECK(timetabling(home,*this,t));
86
87 if (PL::advanced) {
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);
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
NodeType t
Type of node.
int p
Number of positive literals for node type.
int n
Number of negative literals for node type.
Base-class for both propagators and branchers.
Definition core.hpp:628
int size(void) const
Return size of array (number of elements)
Definition array.hpp:1607
Home class for posting propagators
Definition core.hpp:856
Task array.
Definition task.hh:165
Propagator for tasks
Definition task.hh:424
Scheduling propagator for unary resource with mandatory tasks
Definition unary.hh:791
Scheduling propagator for unary resource with optional tasks
Definition unary.hh:814
virtual ExecStatus propagate(Space &home, const ModEventDelta &med)
Perform propagation.
Definition opt-prop.hpp:77
static ExecStatus post(Home home, TaskArray< OptTask > &t)
Post propagator that schedules tasks on unary resource.
Definition opt-prop.hpp:50
OptProp(Home home, TaskArray< OptTask > &t)
Constructor for creation.
Definition opt-prop.hpp:40
virtual Actor * copy(Space &home)
Perform copying during cloning.
Definition opt-prop.hpp:71
Computation spaces.
Definition core.hpp:1742
static ModEvent me(const ModEventDelta &med)
Definition view.hpp:552
int ModEventDelta
Modification event deltas.
Definition core.hpp:89
#define GECODE_ES_CHECK(es)
Check whether execution status es is failed or subsumed, and forward failure or subsumption.
Definition macros.hpp:91
ExecStatus timetabling(Space &home, Propagator &p, TaskArray< Task > &t)
Perform time-tabling propagation.
ExecStatus overload(TaskArray< ManTask > &t)
Check mandatory tasks t for overload.
Definition overload.hpp:39
ExecStatus subsumed(Space &home, Propagator &p, TaskArray< Task > &t)
Check tasks t for subsumption.
ExecStatus detectable(Space &home, TaskArray< ManTask > &t)
Propagate detectable precedences.
ExecStatus notfirstnotlast(Space &home, TaskArray< ManTask > &t)
Propagate not-first and not-last.
ExecStatus edgefinding(Space &home, TaskArray< Task > &t)
Propagate by edge-finding.
ExecStatus purge(Space &home, Propagator &p, TaskArray< OptTask > &t)
Purge optional tasks that are excluded and possibly rewrite propagator.
Definition purge.hpp:38
const Gecode::ModEvent ME_BOOL_VAL
Domain operation has resulted in a value (assigned variable)
Definition var-type.hpp:116
Gecode toplevel namespace
TFE post(PropagatorGroup g)
Only post functions (but not propagators) from g are considered.
Definition filter.cpp:138
ExecStatus
Definition core.hpp:472
@ ES_OK
Execution is okay.
Definition core.hpp:476
@ ES_NOFIX
Propagation has not computed fixpoint.
Definition core.hpp:475
#define forceinline
Definition config.hpp:187