Generated on Sat May 25 2013 18:00:41 for Gecode by doxygen 1.8.3.1
seq-u.cpp
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: 2012-09-07 17:31:22 +0200 (Fri, 07 Sep 2012) $ by $Author: schulte $
17  * $Revision: 13068 $
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 #include <gecode/set/sequence.hh>
45 
46 namespace Gecode { namespace Set { namespace Sequence {
47 
48  /*
49  * "Sequenced union" propagator
50  *
51  */
52 
53  Actor*
54  SeqU::copy(Space& home, bool share) {
55  return new (home) SeqU(home,share,*this);
56  }
57 
60  bool& modified, ViewArray<SetView>& x,
61  SetView& y) {
62  Region r(home);
64  for (int i=x.size(); i--; ){
65  GlbRanges<SetView> lb(x[i]);
66  XLBs[i]=lb;
67  }
69  GECODE_ME_CHECK_MODIFIED(modified, y.includeI(home,u));
70 
71  GLBndSet before(home);
72  for (int i=0; i<x.size(); i++) {
73  LubRanges<SetView> xiub(x[i]);
74  before.includeI(home, xiub);
75  BndSetRanges beforeR(before);
76  GlbRanges<SetView> ylb(y);
78  if (diff()) {
79  GECODE_ME_CHECK_MODIFIED(modified, x[i].exclude(home, diff.min(),
80  Limits::max));
81  }
82  }
83  before.dispose(home);
84 
85  GLBndSet after(home);
86  for (int i=x.size(); i--; ) {
87  LubRanges<SetView> xiub(x[i]);
88  after.includeI(home, xiub);
89  BndSetRanges afterR(after);
90  GlbRanges<SetView> ylb(y);
92  if (diff()) {
93  int max = diff.max();
94  for (; diff(); ++diff)
95  max = diff.max();
96  GECODE_ME_CHECK_MODIFIED(modified, x[i].exclude(home,
98  max));
99  }
100  }
101  after.dispose(home);
102 
103  return ES_FIX;
104  }
105 
106  //Enforces sequentiality and ensures y contains union of Xi lower bounds.
107  ExecStatus
108  SeqU::propagate(Space& home, const ModEventDelta& med) {
109  ModEvent me0 = SetView::me(med);
110  bool ubevent = Rel::testSetEventUB(me0);
111  bool anybevent = Rel::testSetEventAnyB(me0);
112  bool cardevent = Rel::testSetEventCard(me0);
113 
114  bool modified = false;
115  bool assigned=false;
116  bool oldModified = false;
117 
118  do {
119  oldModified = modified;
120  modified = false;
121 
122  if (oldModified || modified || anybevent || cardevent)
123  GECODE_ES_CHECK(propagateSeq(home,modified,assigned,x));
124  if (oldModified || modified || anybevent)
125  GECODE_ES_CHECK(propagateSeqUnion(home,modified,x,y));
126  if (oldModified || modified || ubevent)
128  if (oldModified || modified || ubevent)
130  if (oldModified || modified || anybevent)
132  if (oldModified || modified || cardevent || ubevent)
134 
135  } while (modified);
136 
137  for (int i=x.size(); i--;)
138  if (!x[i].assigned())
139  return ES_FIX;
140  return home.ES_SUBSUMED(*this);
141  }
142 
143 }}}
144 
145 // STATISTICS: set-prop