Generated on Sat Feb 7 2015 02:01:30 for Gecode by doxygen 1.8.9.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
bool testSetEventAnyB(ModEvent me0, ModEvent me1, ModEvent me2)
Definition: common.hpp:83
const int min
Smallest allowed integer in integer set.
Definition: set.hh:101
ViewArray< SetView > x
Array of views.
Definition: propagator.hpp:175
ExecStatus ES_SUBSUMED(Propagator &p)
Definition: core.hpp:2973
ExecStatus unionNXiUB(Space &home, bool &modified, ViewArray< View0 > &x, View1 &y, GLBndSet &)
Definition: common.hpp:299
T * alloc(long unsigned int n)
Allocate block of n objects of type T from region.
Definition: region.hpp:326
int max(void) const
Return largest value of range.
void max(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Definition: arithmetic.cpp:57
SeqU(Space &home, bool share, SeqU &p)
Constructor for cloning p.
Definition: seq-u.hpp:56
int ModEvent
Type for modification events.
Definition: core.hpp:146
ExecStatus partitionNXiLB(Space &home, bool &modified, ViewArray< View0 > &x, View1 &y, GLBndSet &unionOfDets)
Definition: common.hpp:518
Handle to region.
Definition: region.hpp:61
Propagation has computed fixpoint.
Definition: core.hpp:528
const int max
Largest allowed integer in integer set.
Definition: set.hh:99
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
ModEvent exclude(Space &home, View &x, int s)
Prune view x to exclude all values from s.
Definition: set-op.hpp:141
int min(void) const
Return smallest value of range.
#define GECODE_ES_CHECK(es)
Check whether execution status es is failed or subsumed, and forward failure or subsumption.
Definition: macros.hpp:84
Gecode::IntArgs i(4, 1, 2, 3, 4)
Range iterator for least upper bound of set variable views
Definition: set.hpp:205
virtual Actor * copy(Space &home, bool)
Copy propagator during cloning.
Definition: seq-u.cpp:54
NNF * r
Right subtree.
Definition: bool-expr.cpp:246
Range iterator for greatest lower bound of set variable views
Definition: set.hpp:236
virtual ExecStatus propagate(Space &home, const ModEventDelta &med)
Perform propagation.
Definition: seq-u.cpp:108
Range iterator for integer sets.
Definition: var-imp.hpp:189
ExecStatus partitionNYUB(Space &home, bool &modified, ViewArray< View0 > &x, View1 &y, GLBndSet &unionOfDets)
Definition: common.hpp:592
ModEvent includeI(Space &home, I &i)
Include range sequence described by i in greatest lower bound.
Definition: set.hpp:155
ExecStatus propagateSeqUnion(Space &home, bool &modified, ViewArray< SetView > &x, SetView &y)
Definition: seq-u.cpp:59
bool includeI(Space &home, I &i)
Include the set represented by i in this set.
Definition: integerset.hpp:300
void dispose(Space &home)
Free memory used by this set.
Definition: integerset.hpp:64
union Gecode::@518::NNF::@57 u
Union depending on nodetype t.
Set view for set variables
Definition: view.hpp:60
Node * x
Pointer to corresponding Boolean expression node.
Definition: bool-expr.cpp:253
ExecStatus
Definition: core.hpp:523
bool assigned(View x, int v)
Whether x is assigned to value v.
Definition: single.hpp:47
static ModEvent me(const ModEventDelta &med)
Return modification event for view type in med.
Growing sets of integers.
Definition: var-imp.hpp:209
ExecStatus propagateSeq(Space &home, bool &modified, bool &assigned, ViewArray< SetView > &x)
Definition: common.hpp:47
ExecStatus partitionNCard(Space &home, bool &modified, ViewArray< View0 > &x, View1 &y, GLBndSet &unionOfDets)
Definition: common.hpp:313
int size(void) const
Return size of array (number of elements)
Definition: array.hpp:1215
bool testSetEventCard(ModEvent me0, ModEvent me1, ModEvent me2)
Definition: common.hpp:87
Gecode toplevel namespace
Range iterator for appending arbitrarily many iterators.
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
bool before(const ConstSetView &x, const ConstSetView &y)
Definition: const.hpp:698