Generated on Sat Feb 7 2015 02:01:20 for Gecode by doxygen 1.8.9.1
dom.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, 2007
8  *
9  * Last modified:
10  * $Date: 2011-09-06 14:19:49 +0200 (Tue, 06 Sep 2011) $ by $Author: schulte $
11  * $Revision: 12393 $
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 namespace Gecode { namespace Int { namespace Circuit {
39 
40  /*
41  * The actual propagator
42  *
43  */
44  template<class View, class Offset>
47  : Base<View,Offset>(home,x,o) {}
48 
49  template<class View, class Offset>
51  Dom<View,Offset>::Dom(Space& home, bool share, Dom<View,Offset>& p)
52  : Base<View,Offset>(home,share,p) {}
53 
54  template<class View, class Offset>
55  Actor*
56  Dom<View,Offset>::copy(Space& home, bool share) {
57  return new (home) Dom<View,Offset>(home,share,*this);
58  }
59 
60  template<class View, class Offset>
61  PropCost
62  Dom<View,Offset>::cost(const Space&, const ModEventDelta& med) const {
63  if (View::me(med) == Int::ME_INT_VAL)
64  return PropCost::linear(PropCost::LO, x.size());
65  else
66  return PropCost::quadratic(PropCost::HI, x.size());
67  }
68 
69  template<class View, class Offset>
72  if (View::me(med) == Int::ME_INT_VAL) {
73  GECODE_ES_CHECK((Int::Distinct::prop_val<View,true>(home,y)));
74  ExecStatus escv = connected(home);
75  if (escv != ES_FIX)
76  return escv;
77  if (y.size() < 2)
78  return home.ES_SUBSUMED(*this);
79  return home.ES_FIX_PARTIAL(*this,View::med(Int::ME_INT_DOM));
80  }
81 
82  if (dc.available()) {
83  GECODE_ES_CHECK(dc.sync(home));
84  } else {
85  GECODE_ES_CHECK(dc.init(home,y));
86  }
87  bool assigned;
88  GECODE_ES_CHECK(dc.propagate(home,assigned));
89 
90  ExecStatus esc = connected(home);
91  if (esc != ES_FIX)
92  return esc;
93 
94  // Elminiate assigned views from y, as they have been assigned
95  // and propagated by domain consistent propagation. This is required
96  // as we need to know how many assigned views actually exist.
97  if (assigned)
98  for (int i=y.size(); i--; )
99  if (y[i].assigned())
100  y.move_lst(i);
101 
102  return path(home);
103  }
104 
105  template<class View, class Offset>
106  ExecStatus
108  int n = x.size();
109  if (n == 1) {
110  GECODE_ME_CHECK(o(x[0]).eq(home,0));
111  } else if (n == 2) {
112  GECODE_ME_CHECK(o(x[0]).eq(home,1));
113  GECODE_ME_CHECK(o(x[1]).eq(home,0));
114  } else {
115  for (int i=n; i--; ) {
116  GECODE_ME_CHECK(o(x[i]).gq(home,0));
117  GECODE_ME_CHECK(o(x[i]).le(home,n));
118  GECODE_ME_CHECK(o(x[i]).nq(home,i));
119  }
120  (void) new (home) Dom<View,Offset>(home,x,o);
121  }
122  return ES_OK;
123  }
124 
125 }}}
126 
127 // STATISTICS: int-prop
128 
static PropCost quadratic(PropCost::Mod m, unsigned int n)
Quadratic complexity for modifier m and size measure n.
Definition: core.hpp:4032
static PropCost linear(PropCost::Mod m, unsigned int n)
Linear complexity for modifier pcm and size measure n.
Definition: core.hpp:4041
ExecStatus ES_SUBSUMED(Propagator &p)
Definition: core.hpp:2973
int size(void) const
Return size of array (number of elements)
Definition: array.hpp:1662
virtual ExecStatus propagate(Space &home, const ModEventDelta &med)
Perform propagation.
Definition: dom.hpp:71
Expensive.
Definition: core.hpp:564
void path(Home home, int offset, const IntVarArgs &x, IntVar s, IntVar e, IntConLevel icl)
Post propagator such that x forms a Hamiltonian path.
Definition: circuit.cpp:128
Propagation has computed fixpoint.
Definition: core.hpp:528
Computation spaces.
Definition: core.hpp:1362
Base-class for both propagators and branchers.
Definition: core.hpp:666
virtual Actor * copy(Space &home, bool share)
Copy propagator during cloning.
Definition: dom.hpp:56
#define GECODE_ES_CHECK(es)
Check whether execution status es is failed or subsumed, and forward failure or subsumption.
Definition: macros.hpp:84
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
const Gecode::ModEvent ME_INT_VAL
Domain operation has resulted in a value (assigned variable)
Definition: var-type.hpp:56
View arrays.
Definition: array.hpp:234
#define GECODE_ME_CHECK(me)
Check whether modification event me is failed, and forward failure.
Definition: macros.hpp:45
ExecStatus ES_FIX_PARTIAL(Propagator &p, const ModEventDelta &med)
Propagator p has computed partial fixpoint
Definition: core.hpp:2979
Converter with fixed offset.
Definition: view.hpp:617
Node * x
Pointer to corresponding Boolean expression node.
Definition: bool-expr.cpp:253
static ExecStatus post(Home home, ViewArray< View > &x, Offset &o)
Post propagator for circuit on x.
Definition: dom.hpp:107
Propagation cost.
Definition: core.hpp:537
const Gecode::ModEvent ME_INT_DOM
Domain operation has changed the domain.
Definition: var-type.hpp:72
ExecStatus
Definition: core.hpp:523
bool assigned(View x, int v)
Whether x is assigned to value v.
Definition: single.hpp:47
#define forceinline
Definition: config.hpp:132
Execution is okay.
Definition: core.hpp:527
virtual PropCost cost(const Space &home, const ModEventDelta &med) const
Cost function.
Definition: dom.hpp:62
int size(void) const
Return size of array (number of elements)
Definition: array.hpp:1215
Dom(Space &home, bool share, Dom &p)
Constructor for cloning p.
Gecode toplevel namespace
int ModEventDelta
Modification event deltas.
Definition: core.hpp:173
Home class for posting propagators
Definition: core.hpp:717
Base-class for circuit propagator.
Definition: circuit.hh:59
"Domain consistent" circuit propagator
Definition: circuit.hh:123