Generated on Sat Jul 29 2017 12:41:24 for Gecode by doxygen 1.8.13
re-eq.hpp
Go to the documentation of this file.
1 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
2 /*
3  * Main authors:
4  * Guido Tack <tack@gecode.org>
5  * Christian Schulte <schulte@gecode.org>
6  *
7  * Bugfixes provided by:
8  * Grégoire Dooms <dooms@info.ucl.ac.be>
9  *
10  * Copyright:
11  * Guido Tack, 2004
12  * Christian Schulte, 2004
13  *
14  * Last modified:
15  * $Date: 2016-06-29 17:28:17 +0200 (Wed, 29 Jun 2016) $ by $Author: schulte $
16  * $Revision: 15137 $
17  *
18  * This file is part of Gecode, the generic constraint
19  * development environment:
20  * http://www.gecode.org
21  *
22  * Permission is hereby granted, free of charge, to any person obtaining
23  * a copy of this software and associated documentation files (the
24  * "Software"), to deal in the Software without restriction, including
25  * without limitation the rights to use, copy, modify, merge, publish,
26  * distribute, sublicense, and/or sell copies of the Software, and to
27  * permit persons to whom the Software is furnished to do so, subject to
28  * the following conditions:
29  *
30  * The above copyright notice and this permission notice shall be
31  * included in all copies or substantial portions of the Software.
32  *
33  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
34  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
35  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
36  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
37  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
38  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
39  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
40  *
41  */
42 
43 namespace Gecode { namespace Set { namespace Rel {
44 
45  template<class View0, class View1, class CtrlView, ReifyMode rm>
47  ReEq<View0,View1,CtrlView,rm>::ReEq(Home home, View0 y0, View1 y1,
48  CtrlView y2)
49  : Propagator(home), x0(y0), x1(y1), b(y2) {
50  b.subscribe(home,*this, Gecode::Int::PC_INT_VAL);
51  x0.subscribe(home,*this, PC_SET_ANY);
52  x1.subscribe(home,*this, PC_SET_ANY);
53  }
54 
55  template<class View0, class View1, class CtrlView, ReifyMode rm>
58  : Propagator(home,share,p) {
59  x0.update(home,share,p.x0);
60  x1.update(home,share,p.x1);
61  b.update(home,share,p.b);
62  }
63 
64  template<class View0, class View1, class CtrlView, ReifyMode rm>
65  PropCost
68  }
69 
70  template<class View0, class View1, class CtrlView, ReifyMode rm>
71  void
73  b.reschedule(home,*this, Gecode::Int::PC_INT_VAL);
74  x0.reschedule(home,*this, PC_SET_ANY);
75  x1.reschedule(home,*this, PC_SET_ANY);
76  }
77 
78  template<class View0, class View1, class CtrlView, ReifyMode rm>
79  forceinline size_t
81  b.cancel(home,*this, Gecode::Int::PC_INT_VAL);
82  x0.cancel(home,*this, PC_SET_ANY);
83  x1.cancel(home,*this, PC_SET_ANY);
84  (void) Propagator::dispose(home);
85  return sizeof(*this);
86  }
87 
88  template<class View0, class View1, class CtrlView, ReifyMode rm>
91  CtrlView b) {
92  (void) new (home) ReEq<View0,View1,CtrlView,rm>(home,x0,x1,b);
93  return ES_OK;
94  }
95 
96  template<class View0, class View1, class CtrlView, ReifyMode rm>
97  Actor*
99  return new (home) ReEq<View0,View1,CtrlView,rm>(home,share,*this);
100  }
101 
102  template<class View0, class View1, class CtrlView, ReifyMode rm>
103  ExecStatus
105  const ModEventDelta&) {
106  if (b.one()) {
107  if (rm == RM_PMI)
108  return home.ES_SUBSUMED(*this);
109  GECODE_REWRITE(*this,(Eq<View0,View1>::post(home(*this),x0,x1)));
110  }
111  if (b.zero()) {
112  if (rm == RM_IMP)
113  return home.ES_SUBSUMED(*this);
114  GECODE_REWRITE(*this,(Distinct<View0,View1>::post(home(*this),x0,x1)));
115  }
116 
117  if (x0.assigned() && x1.assigned()) {
118  // directly test x0==x1
119  GlbRanges<View0> x0lb(x0);
120  GlbRanges<View1> x1lb(x1);
121  bool x0eqx1 = true;
122  for (; x0lb() && x1lb(); ++x0lb, ++x1lb) {
123  if (x0lb.min() != x1lb.min() ||
124  x0lb.max() != x1lb.max()) {
125  x0eqx1 = false;
126  break;
127  }
128  }
129  if (x0eqx1 && !x0lb() && !x1lb()) {
130  if (rm != RM_IMP)
131  GECODE_ME_CHECK(b.one_none(home));
132  return home.ES_SUBSUMED(*this);
133  } else {
134  if (rm != RM_PMI)
135  GECODE_ME_CHECK(b.zero_none(home));
136  return home.ES_SUBSUMED(*this);
137  }
138  }
139 
140  // check whether cardinalities still allow equality
141  if (x0.cardMin() > x1.cardMax() ||
142  x1.cardMin() > x0.cardMax()) {
143  if (rm != RM_PMI)
144  GECODE_ME_CHECK(b.zero_none(home));
145  return home.ES_SUBSUMED(*this);
146  }
147 
148  // check glb(x0) subset lub(x1)
149  GlbRanges<View0> x0lb(x0);
150  LubRanges<View1> x1ub(x1);
152  if ( diff1() ) {
153  if (rm != RM_PMI)
154  GECODE_ME_CHECK(b.zero_none(home));
155  return home.ES_SUBSUMED(*this);
156  }
157 
158  // check glb(x1) subset lub(x0)
159  GlbRanges<View1> x1lb(x1);
160  LubRanges<View0> x0ub(x0);
162  if ( diff2() ) {
163  if (rm != RM_PMI)
164  GECODE_ME_CHECK(b.zero_none(home));
165  return home.ES_SUBSUMED(*this);
166  }
167 
168  return ES_FIX;
169  }
170 
171 }}}
172 
173 // STATISTICS: set-prop
#define GECODE_REWRITE(prop, post)
Rewrite propagator by executing post function.
Definition: macros.hpp:120
Propagator for negated equality
Definition: rel.hh:267
static ExecStatus post(Home home, View0 x, View1 y, CtrlView b)
Post propagator for .
Definition: re-eq.hpp:90
int min(void) const
Return smallest value of range.
ReEq(Space &home, bool share, ReEq &)
Constructor for cloning p.
Definition: re-eq.hpp:57
Inverse implication for reification.
Definition: int.hh:850
ExecStatus ES_SUBSUMED(Propagator &p)
Definition: core.hpp:3614
Base-class for propagators.
Definition: core.hpp:1092
Range iterator for the greatest lower bound.
Definition: var-imp.hpp:363
Propagation has computed fixpoint.
Definition: core.hpp:545
Computation spaces.
Definition: core.hpp:1748
Range iterator for the least upper bound.
Definition: var-imp.hpp:321
Base-class for both propagators and branchers.
Definition: core.hpp:696
Reified equality propagator
Definition: rel.hh:174
int p
Number of positive literals for node type.
Definition: bool-expr.cpp:236
virtual Actor * copy(Space &home, bool)
Copy propagator during cloning.
Definition: re-eq.hpp:98
struct Gecode::@579::NNF::@61::@62 b
For binary nodes (and, or, eqv)
virtual PropCost cost(const Space &home, const ModEventDelta &med) const
Cost function (defined as PC_TERNARY_LO)
Definition: re-eq.hpp:66
#define GECODE_ME_CHECK(me)
Check whether modification event me is failed, and forward failure.
Definition: macros.hpp:56
const Gecode::PropCond PC_SET_ANY
Propagate when any bound or the cardinality of a view changes.
Definition: var-type.hpp:248
virtual size_t dispose(Space &home)
Delete actor and return its size.
Definition: core.hpp:3354
Propagation cost.
Definition: core.hpp:554
virtual size_t dispose(Space &home)
Delete propagator and return its size.
Definition: re-eq.hpp:80
ExecStatus
Definition: core.hpp:540
#define forceinline
Definition: config.hpp:173
virtual ExecStatus propagate(Space &home, const ModEventDelta &med)
Perform propagation.
Definition: re-eq.hpp:104
Propagator for set equality
Definition: rel.hh:150
Execution is okay.
Definition: core.hpp:544
int max(void) const
Return largest value of range.
static PropCost ternary(PropCost::Mod m)
Three variables for modifier pcm.
Definition: core.hpp:4850
Gecode toplevel namespace
Implication for reification.
Definition: int.hh:843
Range iterator for computing set difference.
Definition: ranges-diff.hpp:47
int ModEventDelta
Modification event deltas.
Definition: core.hpp:169
virtual void reschedule(Space &home)
Schedule function.
Definition: re-eq.hpp:72
Home class for posting propagators
Definition: core.hpp:922
const Gecode::PropCond PC_INT_VAL
Propagate when a view becomes assigned (single value)
Definition: var-type.hpp:82