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