Generated on Tue Jan 26 2021 00:00:00 for Gecode by doxygen 1.9.1
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  * 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 Rel {
41 
42  template<class View0, class View1>
44  Eq<View0,View1>::Eq(Home home, View0 x, View1 y)
45  : MixBinaryPropagator<View0,PC_SET_ANY,View1,PC_SET_ANY>(home,x,y) {}
46 
47  template<class View0, class View1>
50  : MixBinaryPropagator<View0,PC_SET_ANY,View1,PC_SET_ANY>(home,p) {}
51 
52  template<class View0, class View1>
54  Eq<View0,View1>::post(Home home, View0 x, View1 y) {
55  if (!same(x,y))
56  (void) new (home) Eq(home,x,y);
57  return ES_OK;
58  }
59 
60  template<class View0, class View1>
61  Actor*
63  return new (home) Eq(home,*this);
64  }
65 
66  template<class View0, class View1>
69 
70  ModEvent me0 = View0::me(med);
71  ModEvent me1 = View1::me(med);
72 
73  Region r;
74 
75  if (testSetEventLB(me0,me1)) {
76  GlbRanges<View0> x0lb(x0);
77  GlbRanges<View1> x1lb(x1);
79  Iter::Ranges::Cache lbuc(r,lbu);
80  GECODE_ME_CHECK(x0.includeI(home,lbuc));
81  lbuc.reset();
82  GECODE_ME_CHECK(x1.includeI(home,lbuc));
83  }
84 
85  if (testSetEventUB(me0,me1)) {
86  LubRanges<View0> x0ub(x0);
87  LubRanges<View1> x1ub(x1);
89  Iter::Ranges::Cache ubic(r,ubi);
90  GECODE_ME_CHECK(x0.intersectI(home,ubic));
91  ubic.reset();
92  GECODE_ME_CHECK(x1.intersectI(home,ubic));
93  }
94 
95  if (testSetEventCard(me0,me1)) {
96  unsigned int max = std::min(x0.cardMax(),x1.cardMax());
97  unsigned int min = std::max(x0.cardMin(),x1.cardMin());
98  GECODE_ME_CHECK(x0.cardMax(home,max));
99  GECODE_ME_CHECK(x1.cardMax(home,max));
100  GECODE_ME_CHECK(x0.cardMin(home,min));
101  GECODE_ME_CHECK(x1.cardMin(home,min));
102  }
103 
104  if (x0.assigned()) {
105  assert (x1.assigned());
106  return home.ES_SUBSUMED(*this);
107  }
108  return shared(x0,x1) ? ES_NOFIX : ES_FIX;
109  }
110 
111 }}}
112 
113 // STATISTICS: set-prop
int p
Number of positive literals for node type.
Definition: bool-expr.cpp:232
Node * x
Pointer to corresponding Boolean expression node.
Definition: bool-expr.cpp:249
NNF * r
Right subtree.
Definition: bool-expr.cpp:242
Base-class for both propagators and branchers.
Definition: core.hpp:628
Home class for posting propagators
Definition: core.hpp:856
Range iterator cache
Range iterator for computing intersection (binary)
void reset(void)
Reset iterator to start.
Range iterator for computing union (binary)
Mixed binary propagator.
Definition: pattern.hpp:204
Handle to region.
Definition: region.hpp:55
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 set equality
Definition: rel.hh:150
Eq(Space &home, Eq &p)
Constructor for cloning p.
Definition: eq.hpp:49
virtual ExecStatus propagate(Space &home, const ModEventDelta &med)
Perform propagation.
Definition: eq.hpp:68
virtual Actor * copy(Space &home)
Copy propagator during cloning.
Definition: eq.hpp:62
static ExecStatus post(Home home, View0 x, View1 y)
Post propagator .
Definition: eq.hpp:54
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
Post propagator for SetVar SetOpType SetVar y
Definition: set.hh:767
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
const FloatNum max
Largest allowed float value.
Definition: float.hh:844
const FloatNum min
Smallest allowed float value.
Definition: float.hh:846
bool shared(const IntSet &, VX)
Definition: view-base.hpp:118
bool testSetEventLB(ModEvent me0, ModEvent me1, ModEvent me2)
Definition: common.hpp:83
bool same(VX, VY)
Test whether two views are in fact the same.
Definition: common.hpp:57
bool testSetEventCard(ModEvent me0, ModEvent me1, ModEvent me2)
Definition: common.hpp:95
bool testSetEventUB(ModEvent me0, ModEvent me1, ModEvent me2)
Definition: common.hpp:87
const Gecode::PropCond PC_SET_ANY
Propagate when any bound or the cardinality of a view changes.
Definition: var-type.hpp:248
#define forceinline
Definition: config.hpp:185