Generated on Mon Aug 27 2012 17:15:37 for Gecode by doxygen 1.8.1.2
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  * Last modified:
16  * $Date: 2011-08-09 02:04:53 +1000 (Tue, 09 Aug 2011) $ by $Author: schulte $
17  * $Revision: 12253 $
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 Rel {
45 
46  template<class View0, class View1>
48  Eq<View0,View1>::Eq(Home home, View0 x, View1 y)
49  : MixBinaryPropagator<View0,PC_SET_ANY,View1,PC_SET_ANY>(home,x,y) {}
50 
51  template<class View0, class View1>
53  Eq<View0,View1>::Eq(Space& home, bool share, Eq& p)
54  : MixBinaryPropagator<View0,PC_SET_ANY,View1,PC_SET_ANY>(home,share,p) {}
55 
56  template<class View0, class View1>
58  Eq<View0,View1>::post(Home home, View0 x, View1 y) {
59  (void) new (home) Eq(home,x,y);
60  return ES_OK;
61  }
62 
63  template<class View0, class View1>
64  Actor*
65  Eq<View0,View1>::copy(Space& home, bool share) {
66  return new (home) Eq(home,share,*this);
67  }
68 
69  template<class View0, class View1>
72 
73  ModEvent me0 = View0::me(med);
74  ModEvent me1 = View1::me(med);
75 
76  Region r(home);
77 
78  if (testSetEventLB(me0,me1)) {
79  GlbRanges<View0> x0lb(x0);
80  GlbRanges<View1> x1lb(x1);
82  Iter::Ranges::Cache lbuc(r,lbu);
83  GECODE_ME_CHECK(x0.includeI(home,lbuc));
84  lbuc.reset();
85  GECODE_ME_CHECK(x1.includeI(home,lbuc));
86  }
87 
88  if (testSetEventUB(me0,me1)) {
89  LubRanges<View0> x0ub(x0);
90  LubRanges<View1> x1ub(x1);
92  Iter::Ranges::Cache ubic(r,ubi);
93  GECODE_ME_CHECK(x0.intersectI(home,ubic));
94  ubic.reset();
95  GECODE_ME_CHECK(x1.intersectI(home,ubic));
96  }
97 
98  if (testSetEventCard(me0,me1) ) {
99  unsigned int max = std::min(x0.cardMax(),x1.cardMax());
100  unsigned int min = std::max(x0.cardMin(),x1.cardMin());
101  GECODE_ME_CHECK ( x0.cardMax(home,max) );
102  GECODE_ME_CHECK ( x1.cardMax(home,max) );
103  GECODE_ME_CHECK ( x0.cardMin(home,min) );
104  GECODE_ME_CHECK ( x1.cardMin(home,min) );
105  }
106 
107  if (x0.assigned()) {
108  assert (x1.assigned());
109  return home.ES_SUBSUMED(*this);
110  }
111  return shared(x0,x1) ? ES_NOFIX : ES_FIX;
112  }
113 
114 }}}
115 
116 // STATISTICS: set-prop