Generated on Thu Feb 14 2013 20:59:32 for Gecode by doxygen 1.8.3.1
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: 2011-05-26 00:56:41 +1000 (Thu, 26 May 2011) $ by $Author: schulte $
11  * $Revision: 12022 $
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>
45  : TaskProp<OptTask,Int::PC_INT_BND>(home,t) {}
46 
47  template<class OptTask>
50  : TaskProp<OptTask,Int::PC_INT_BND>(home,shared,p) {}
51 
52  template<class OptTask>
55  int m=0, o=0;
56  for (int i=t.size(); i--; ) {
57  if (t[i].mandatory())
58  m++;
59  else if (t[i].optional())
60  o++;
61  }
62  if (m == t.size()) {
64  for (int i=m; i--; )
65  mt[i].init(t[i]);
67  }
68  if (o+m > 1)
69  (void) new (home) OptProp<OptTask>(home,t);
70  return ES_OK;
71  }
72 
73  template<class OptTask>
74  Actor*
75  OptProp<OptTask>::copy(Space& home, bool share) {
76  return new (home) OptProp<OptTask>(home,share,*this);
77  }
78 
79  template<class OptTask>
80  ExecStatus
82  // Did one of the Boolean views change?
84  GECODE_ES_CHECK((purge<OptTask,Int::PC_INT_BND>(home,*this,t)));
85 
86  GECODE_ES_CHECK(overload(home,*this,t));
87 
88  GECODE_ES_CHECK(detectable(home,*this,t));
89  GECODE_ES_CHECK(notfirstnotlast(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  GECODE_ES_CHECK(subsumed(home,*this,t));
110 
111  return ES_NOFIX;
112  }
113 
114 }}}
115 
116 // STATISTICS: int-prop