Generated on Sat Jan 20 2018 22:21:14 for Gecode by doxygen 1.8.13
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  * 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 OptTask, class PL>
45  : TaskProp<OptTask,PL>(home,t) {}
46 
47  template<class OptTask, class PL>
51  : TaskProp<OptTask,PL>(home,shared,p) {}
52 
53  template<class OptTask, class PL>
56  int m=0, o=0;
57  for (int i=t.size(); i--; ) {
58  if (t[i].mandatory())
59  m++;
60  else if (t[i].optional())
61  o++;
62  }
63  if (m == t.size()) {
65  for (int i=m; i--; )
66  mt[i].init(t[i]);
68  }
69  if (o+m > 1)
70  (void) new (home) OptProp<OptTask,PL>(home,t);
71  return ES_OK;
72  }
73 
74  template<class OptTask, class PL>
75  Actor*
76  OptProp<OptTask,PL>::copy(Space& home, bool share) {
77  return new (home) OptProp<OptTask,PL>(home,share,*this);
78  }
79 
80  template<class OptTask, class PL>
83  // Did one of the Boolean views change?
84  if (BoolView::me(med) == ME_BOOL_VAL)
85  GECODE_ES_CHECK((purge<OptTask,PL>(home,*this,t)));
86 
87  GECODE_ES_CHECK((overload<OptTask,PL>(home,*this,t)));
88 
89  if (PL::basic)
90  GECODE_ES_CHECK(timetabling(home,*this,t));
91 
92  if (PL::advanced) {
93  GECODE_ES_CHECK((detectable<OptTask,PL>(home,*this,t)));
94  GECODE_ES_CHECK((notfirstnotlast<OptTask,PL>(home,*this,t)));
95 
96  // Partition into mandatory and optional activities
97  int n = t.size();
98  int i=0, j=n-1;
99  while (true) {
100  while ((i < n) && t[i].mandatory()) i++;
101  while ((j >= 0) && !t[j].mandatory()) j--;
102  if (i >= j) break;
103  std::swap(t[i],t[j]);
104  }
105 
106  if (i > 1) {
107  // Truncate array to only contain mandatory tasks
108  t.size(i);
110  // Restore to also include optional tasks
111  t.size(n);
112  }
113  }
114 
115  if (!PL::basic)
116  GECODE_ES_CHECK(subsumed(home,*this,t));
117 
118  return ES_NOFIX;
119  }
120 
121 }}}
122 
123 // STATISTICS: int-prop
NodeType t
Type of node.
Definition: bool-expr.cpp:234
ExecStatus timetabling(Space &home, Propagator &p, TaskArray< Task > &t)
Perform time-tabling propagation.
Scheduling propagator for unary resource with mandatory tasks
Definition: unary.hh:795
Propagator for tasks
Definition: task.hh:428
Computation spaces.
Definition: core.hpp:1748
Base-class for both propagators and branchers.
Definition: core.hpp:696
#define GECODE_ES_CHECK(es)
Check whether execution status es is failed or subsumed, and forward failure or subsumption.
Definition: macros.hpp:95
int p
Number of positive literals for node type.
Definition: bool-expr.cpp:236
Gecode::IntArgs i(4, 1, 2, 3, 4)
int n
Number of negative literals for node type.
Definition: bool-expr.cpp:238
ModEventDelta med
A set of modification events (used during propagation)
Definition: core.hpp:1103
virtual ExecStatus propagate(Space &home, const ModEventDelta &med)
Perform propagation.
Definition: opt-prop.hpp:82
ExecStatus subsumed(Space &home, Propagator &p, TaskArray< Task > &t)
Check tasks t for subsumption.
Definition: subsumption.hpp:42
Scheduling propagator for unary resource with optional tasks
Definition: unary.hh:818
static ExecStatus post(Home home, TaskArray< OptTask > &t)
Post propagator that schedules tasks on unary resource.
Definition: opt-prop.hpp:55
ExecStatus
Definition: core.hpp:540
static ModEvent me(const ModEventDelta &med)
Return modification event for view type in med.
Definition: view.hpp:514
#define forceinline
Definition: config.hpp:173
virtual Actor * copy(Space &home, bool share)
Perform copying during cloning.
Definition: opt-prop.hpp:76
OptProp(Home home, TaskArray< OptTask > &t)
Constructor for creation.
Definition: opt-prop.hpp:44
Execution is okay.
Definition: core.hpp:544
ExecStatus edgefinding(Space &home, TaskViewArray< TaskView > &t)
Propagation has not computed fixpoint.
Definition: core.hpp:543
bool shared(const ConstView< ViewA > &, const ConstView< ViewB > &)
Test whether views share same variable.
Definition: view.hpp:702
Gecode toplevel namespace
TaskArray< OptTask > t
Tasks.
Definition: task.hh:431
bool optional(const BoolVarArgs &m)
Definition: no-overlap.cpp:45
int ModEventDelta
Modification event deltas.
Definition: core.hpp:169
Home class for posting propagators
Definition: core.hpp:922
IntRelType swap(IntRelType irt)
Return swapped relation type of irt.
Definition: irt.hpp:41
const Gecode::ModEvent ME_BOOL_VAL
Domain operation has resulted in a value (assigned variable)
Definition: var-type.hpp:116
int size(void) const
Return size of array (number of elements)
Definition: array.hpp:67