Generated on Sat Feb 7 2015 02:01:21 for Gecode by doxygen 1.8.9.1
int-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  * Christian Schulte <schulte@gecode.org>
5  *
6  * Copyright:
7  * Christian Schulte, 2011
8  *
9  * Last modified:
10  * $Date: 2012-09-07 17:31:22 +0200 (Fri, 07 Sep 2012) $ by $Author: schulte $
11  * $Revision: 13068 $
12  *
13  * This file is part of Gecode, the generic constraint
14  * development environment:
15  * http://www.gecode.org
16  *
17  * Permission is hereby granted, free of charge, to any person obtaining
18  * a copy of this software and associated documentation files (the
19  * "Software"), to deal in the Software without restriction, including
20  * without limitation the rights to use, copy, modify, merge, publish,
21  * distribute, sublicense, and/or sell copies of the Software, and to
22  * permit persons to whom the Software is furnished to do so, subject to
23  * the following conditions:
24  *
25  * The above copyright notice and this permission notice shall be
26  * included in all copies or substantial portions of the Software.
27  *
28  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
29  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
30  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
31  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
32  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
33  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
34  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
35  *
36  */
37 
38 #include <gecode/int/rel.hh>
39 #include <gecode/int/distinct.hh>
40 
41 namespace Gecode { namespace Int { namespace NValues {
42 
43  template<class VY>
46  : IntBase<VY>(home,vs,x,y) {
47  home.notice(*this, AP_WEAKLY);
48  }
49 
50  template<class VY>
51  inline ExecStatus
53  if (x.size() == 0) {
54  GECODE_ME_CHECK(y.eq(home,0));
55  return ES_OK;
56  }
57 
58  x.unique(home);
59 
60  if (x.size() == 1) {
61  GECODE_ME_CHECK(y.eq(home,1));
62  return ES_OK;
63  }
64 
65  GECODE_ME_CHECK(y.gq(home,1));
66  GECODE_ME_CHECK(y.lq(home,x.size()));
67 
68  if (y.max() == 1) {
69  assert(y.assigned());
70  return Rel::NaryEqDom<IntView>::post(home,x);
71  }
72 
73  if (y.min() == x.size()) {
74  assert(y.assigned());
75  return Distinct::Dom<IntView>::post(home,x);
76  }
77 
78  // Eliminate assigned views and store them into the value set
79  ValSet vs;
80  int n = x.size();
81  for (int i=n; i--; )
82  if (x[i].assigned()) {
83  vs.add(home, x[i].val());
84  x[i] = x[--n];
85  }
86 
87  GECODE_ME_CHECK(y.gq(home,vs.size()));
88  GECODE_ME_CHECK(y.lq(home,n + vs.size()));
89 
90  if (n == 0) {
91  assert(y.val() == vs.size());
92  return ES_OK;
93  }
94  x.size(n);
95  (void) new (home) EqInt<VY>(home, vs, x, y);
96  return ES_OK;
97  }
98 
99  template<class VY>
101  EqInt<VY>::EqInt(Space& home, bool share, EqInt<VY>& p)
102  : IntBase<VY>(home, share, p) {}
103 
104  template<class VY>
105  Propagator*
106  EqInt<VY>::copy(Space& home, bool share) {
107  return new (home) EqInt<VY>(home, share, *this);
108  }
109 
110  template<class VY>
111  forceinline size_t
113  home.ignore(*this, AP_WEAKLY);
114  (void) IntBase<VY>::dispose(home);
115  return sizeof(*this);
116  }
117 
118  template<class VY>
119  ExecStatus
121  // Add assigned views to value set
122  if (IntView::me(med) == ME_INT_VAL)
123  add(home);
124 
125  GECODE_ME_CHECK(y.gq(home, vs.size()));
126  GECODE_ME_CHECK(y.lq(home, x.size() + vs.size()));
127 
128  if (x.size() == 0)
129  return home.ES_SUBSUMED(*this);
130 
131  // All values must be in the value set
132  if (y.max() == vs.size())
133  return all_in_valset(home);
134 
135  // Compute positions of disjoint views and eliminate subsumed views
136  Region r(home);
137  int* dis; int n_dis;
138  disjoint(home,r,dis,n_dis);
139 
140  // The number might have changed due to elimination of subsumed views
141  GECODE_ME_CHECK(y.lq(home, x.size() + vs.size()));
142 
143  if (x.size() == 0) {
144  assert(y.val() == vs.size());
145  return home.ES_SUBSUMED(*this);
146  }
147 
148  GECODE_ES_CHECK(prune_upper(home,g));
149 
150  // No lower bound pruning possible
151  if (n_dis == 0)
152  return ES_NOFIX;
153 
154  // Only if the propagator is at fixpoint here, continue with
155  // propagating the lower bound
157  return ES_NOFIX;
158 
159  // Do lower bound-based pruning
160  GECODE_ES_CHECK(prune_lower(home,dis,n_dis));
161 
162  return ES_NOFIX;
163  }
164 
165 }}}
166 
167 // STATISTICS: int-prop
int size(void) const
Return size (number of values)
Definition: val-set.hpp:85
ExecStatus ES_SUBSUMED(Propagator &p)
Definition: core.hpp:2973
EqInt(Home home, ValSet &vs, ViewArray< IntView > &x, VY y)
Constructor for posting.
Definition: int-eq.hpp:45
Equal to number of values propagator for integer views.
Definition: nvalues.hh:191
Base-class for propagators.
Definition: core.hpp:755
static ExecStatus post(Home home, ViewArray< View > &x)
Post propagator for views x.
Definition: dom.hpp:49
virtual ExecStatus propagate(Space &home, const ModEventDelta &med)
Perform propagation.
Definition: int-eq.hpp:120
Handle to region.
Definition: region.hpp:61
void unique(const Space &home)
Remove all duplicate views from array (changes element order)
Definition: array.hpp:1498
Computation spaces.
Definition: core.hpp:1362
#define GECODE_ES_CHECK(es)
Check whether execution status es is failed or subsumed, and forward failure or subsumption.
Definition: macros.hpp:84
int p
Number of positive literals for node type.
Definition: bool-expr.cpp:236
Gecode::IntArgs i(4, 1, 2, 3, 4)
int n
Number of negative literals for node type.
Definition: bool-expr.cpp:238
NNF * r
Right subtree.
Definition: bool-expr.cpp:246
const Gecode::ModEvent ME_INT_VAL
Domain operation has resulted in a value (assigned variable)
Definition: var-type.hpp:56
virtual Propagator * copy(Space &home, bool share)
Copy propagator during cloning.
Definition: int-eq.hpp:106
ModEventDelta modeventdelta(void) const
Return the modification event delta.
Definition: core.hpp:2957
#define GECODE_ME_CHECK(me)
Check whether modification event me is failed, and forward failure.
Definition: macros.hpp:45
void notice(Actor &a, ActorProperty p, bool duplicate=false)
Notice actor property.
Definition: core.hpp:2849
Node * x
Pointer to corresponding Boolean expression node.
Definition: bool-expr.cpp:253
void ignore(Actor &a, ActorProperty p, bool duplicate=false)
Ignore actor property.
Definition: core.cpp:169
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.
bool disjoint(I &i, J &j)
Check whether range iterators i and j are disjoint.
#define forceinline
Definition: config.hpp:132
Execution is okay.
Definition: core.hpp:527
Propagation has not computed fixpoint.
Definition: core.hpp:526
Class for storing values of already assigned views.
Definition: val-set.hh:48
int size(void) const
Return size of array (number of elements)
Definition: array.hpp:1215
Gecode toplevel namespace
static ExecStatus post(Home home, ViewArray< View > &x)
Post domain consistent propagator .
Definition: eq.hpp:214
Number of values propagator for integer views base class.
Definition: nvalues.hh:136
int ModEventDelta
Modification event deltas.
Definition: core.hpp:173
Home class for posting propagators
Definition: core.hpp:717
virtual size_t dispose(Space &home)
Delete propagator and return its size.
Definition: int-eq.hpp:112
void add(Space &home, int v)
Add value v to value set.
Definition: val-set.hpp:49
const Gecode::ModEvent ME_INT_NONE
Domain operation has not changed domain.
Definition: var-type.hpp:54
static ExecStatus post(Home home, ViewArray< IntView > &x, VY y)
Post propagator for .
Definition: int-eq.hpp:52