Generated on Sat Feb 7 2015 02:01:30 for Gecode by doxygen 1.8.9.1
subofunion.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  * Contributing authors:
8  * Gabor Szokoli <szokoli@gecode.org>
9  *
10  * Copyright:
11  * Guido Tack, 2004
12  * Christian Schulte, 2004
13  * Gabor Szokoli, 2004
14  *
15  * Last modified:
16  * $Date: 2010-03-03 17:32:21 +0100 (Wed, 03 Mar 2010) $ by $Author: schulte $
17  * $Revision: 10364 $
18  *
19  * This file is part of Gecode, the generic constraint
20  * development environment:
21  * http://www.gecode.org
22  *
23  * Permission is hereby granted, free of charge, to any person obtaining
24  * a copy of this software and associated documentation files (the
25  * "Software"), to deal in the Software without restriction, including
26  * without limitation the rights to use, copy, modify, merge, publish,
27  * distribute, sublicense, and/or sell copies of the Software, and to
28  * permit persons to whom the Software is furnished to do so, subject to
29  * the following conditions:
30  *
31  * The above copyright notice and this permission notice shall be
32  * included in all copies or substantial portions of the Software.
33  *
34  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
35  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
36  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
37  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
38  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
39  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
40  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
41  *
42  */
43 
44 namespace Gecode { namespace Set { namespace RelOp {
45 
46  template<class View0, class View1, class View2>
47  Actor*
49  return new (home) SubOfUnion(home,share,*this);
50  }
51 
52  template<class View0, class View1, class View2>
55 
56  bool allassigned = x0.assigned() && x1.assigned() && x2.assigned();
57 
58  ModEvent me0 = View0::me(med);
59  ModEvent me1 = View1::me(med);
60  ModEvent me2 = View2::me(med);
61 
62  bool modified=false;
63 
64  do {
65  // lub(x2) <= lub(x0) u lub(x1)
66  if (modified || Rel::testSetEventUB(me0,me1))
67  {
68  LubRanges<View0> ub0(x0);
69  LubRanges<View1> ub1(x1);
71  GECODE_ME_CHECK(x2.intersectI(home,u));
72  }
73 
74  // x1 <= glb(x2)-lub(x0)
75  // x0 <= glb(x2)-lub(x1)
76  if (modified || Rel::testSetEventAnyB(me0,me1,me2)) {
77  {
78  modified = false;
79  GlbRanges<View2> lb2(x2);
80  LubRanges<View0> ub0(x0);
82  diff(lb2,ub0);
83  GECODE_ME_CHECK_MODIFIED(modified, x1.includeI(home,diff));
84  }
85  {
86  GlbRanges<View2> lb2(x2);
87  LubRanges<View1> ub1(x1);
89  diff(lb2,ub1);
90  GECODE_ME_CHECK_MODIFIED(modified, x0.includeI(home,diff));
91  }
92  } else {
93  modified = false;
94  }
95 
96  // cardinality propagation
97  if (modified ||
98  Rel::testSetEventCard(me0,me1,me2) ||
99  Rel::testSetEventLB(me0,me1)
100  ) {
101  GlbRanges<View0> lb0c(x0);
102  GlbRanges<View1> lb1c(x1);
104  inter(lb0c,lb1c);
105 
106  unsigned int m = Iter::Ranges::size(inter);
107 
108  if (m < x0.cardMax()+x1.cardMax()) {
109  GECODE_ME_CHECK_MODIFIED(modified,
110  x2.cardMax( home,
111  x0.cardMax()+x1.cardMax() - m ) );
112  }
113  if (m + x2.cardMin() > x1.cardMax()) {
114  GECODE_ME_CHECK_MODIFIED(modified,
115  x0.cardMin( home,
116  m+x2.cardMin()-x1.cardMax() ) );
117  }
118  if (m + x2.cardMin() > x0.cardMax()) {
119  GECODE_ME_CHECK_MODIFIED(modified,
120  x1.cardMin( home,
121  m+x2.cardMin()-x0.cardMax() ) );
122  }
123  }
124 
125  } while (modified);
126 
127  if (shared(x0,x1,x2)) {
128  if (allassigned) {
129  return home.ES_SUBSUMED(*this);
130  } else {
131  return ES_NOFIX;
132  }
133  } else {
134  if (x0.assigned() + x1.assigned() + x2.assigned() >= 2) {
135  return home.ES_SUBSUMED(*this);
136  } else {
137  return ES_FIX;
138  }
139  }
140 
141  }
142 
143  template<class View0, class View1, class View2>
146  View1 y1, View2 y2)
148  View2,PC_SET_ANY>(home,y0,y1,y2) {}
149 
150  template<class View0, class View1, class View2>
153  (Space& home, bool share, SubOfUnion<View0,View1,View2>& p)
155  View2,PC_SET_ANY>(home,share,p) {}
156 
157  template<class View0, class View1, class View2>
159  (Home home, View0 x0, View1 x1, View2 x2) {
160  (void) new (home) SubOfUnion<View0,View1,View2>(home,x0, x1, x2);
161  return ES_OK;
162  }
163 
164 }}}
165 
166 // STATISTICS: set-prop
bool testSetEventAnyB(ModEvent me0, ModEvent me1, ModEvent me2)
Definition: common.hpp:83
static ExecStatus post(Home home, View0 x, View1 y, View2 z)
Post propagator .
Definition: subofunion.hpp:159
ExecStatus ES_SUBSUMED(Propagator &p)
Definition: core.hpp:2973
int ModEvent
Type for modification events.
Definition: core.hpp:146
Range iterator for the greatest lower bound.
Definition: var-imp.hpp:363
Propagation has computed fixpoint.
Definition: core.hpp:528
virtual ExecStatus propagate(Space &home, const ModEventDelta &med)
Perform propagation.
Definition: subofunion.hpp:54
Computation spaces.
Definition: core.hpp:1362
#define GECODE_ME_CHECK_MODIFIED(modified, me)
Check whether me is failed or modified, and forward failure.
Definition: macros.hpp:57
Range iterator for the least upper bound.
Definition: var-imp.hpp:321
Propagator for the subset of union
Definition: rel-op.hh:95
int p
Number of positive literals for node type.
Definition: bool-expr.cpp:236
Range iterator for computing intersection (binary)
Mixed ternary propagator.
Definition: propagator.hpp:235
unsigned int size(I &i)
Size of all ranges of range iterator i.
SubOfUnion(Space &home, bool share, SubOfUnion &p)
Constructor for cloning p.
Definition: subofunion.hpp:153
#define GECODE_ME_CHECK(me)
Check whether modification event me is failed, and forward failure.
Definition: macros.hpp:45
const Gecode::PropCond PC_SET_ANY
Propagate when any bound or the cardinality of a view changes.
Definition: var-type.hpp:248
bool shared(View0 v0, View1 v1, View2 v2)
Definition: common.hpp:89
Range iterator for computing union (binary)
SetExpr inter(const SetVarArgs &x)
Intersection of set variables.
Definition: set-expr.cpp:696
union Gecode::@518::NNF::@57 u
Union depending on nodetype t.
bool testSetEventLB(ModEvent me0, ModEvent me1, ModEvent me2)
Definition: common.hpp:75
ExecStatus
Definition: core.hpp:523
#define forceinline
Definition: config.hpp:132
Execution is okay.
Definition: core.hpp:527
Propagation has not computed fixpoint.
Definition: core.hpp:526
bool testSetEventCard(ModEvent me0, ModEvent me1, ModEvent me2)
Definition: common.hpp:87
Gecode toplevel namespace
virtual Actor * copy(Space &home, bool)
Copy propagator during cloning.
Definition: subofunion.hpp:48
bool testSetEventUB(ModEvent me0, ModEvent me1, ModEvent me2)
Definition: common.hpp:79
Range iterator for computing set difference.
Definition: ranges-diff.hpp:47
int ModEventDelta
Modification event deltas.
Definition: core.hpp:173
Home class for posting propagators
Definition: core.hpp:717