Generated on Thu Feb 21 2013 23:11:42 for Gecode by doxygen 1.8.3.1
int-gq.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: 2011-08-18 17:41:50 +1000 (Thu, 18 Aug 2011) $ by $Author: tack $
11  * $Revision: 12311 $
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 
48  template<class VY>
49  inline ExecStatus
51  if (x.size() == 0) {
52  GECODE_ME_CHECK(y.lq(home,0));
53  return ES_OK;
54  }
55 
56  x.unique(home);
57 
58  if (x.size() == 1) {
59  GECODE_ME_CHECK(y.lq(home,1));
60  return ES_OK;
61  }
62 
63  GECODE_ME_CHECK(y.lq(home,x.size()));
64 
65  if (y.max() <= 1)
66  return ES_OK;
67 
68  if (y.min() == x.size()) {
69  assert(y.assigned());
70  return Distinct::Dom<IntView>::post(home,x);
71  }
72 
73  // Eliminate assigned views and store them into the value set
74  ValSet vs;
75  int n = x.size();
76  for (int i=n; i--; )
77  if (x[i].assigned()) {
78  vs.add(home, x[i].val());
79  x[i] = x[--n];
80  }
81 
82  GECODE_ME_CHECK(y.lq(home,n + vs.size()));
83 
84  if (n == 0) {
85  assert(vs.size() >= y.max());
86  return ES_OK;
87  }
88 
89  x.size(n);
90 
91  (void) new (home) GqInt<VY>(home, vs, x, y);
92  return ES_OK;
93  }
94 
95  template<class VY>
97  GqInt<VY>::GqInt(Space& home, bool share, GqInt<VY>& p)
98  : IntBase<VY>(home, share, p) {}
99 
100  template<class VY>
101  Propagator*
102  GqInt<VY>::copy(Space& home, bool share) {
103  return new (home) GqInt<VY>(home, share, *this);
104  }
105 
106  template<class VY>
107  ExecStatus
109  if (IntView::me(med) == ME_INT_VAL)
110  add(home);
111 
112  // Eliminate subsumed views
113  eliminate(home);
114 
115  GECODE_ME_CHECK(y.lq(home, x.size() + vs.size()));
116 
117  if (x.size() == 0)
118  return home.ES_SUBSUMED(*this);
119 
120  if (vs.size() >= y.max())
121  return home.ES_SUBSUMED(*this);
122 
123  GECODE_ES_CHECK(prune_upper(home,g));
124 
125  return ES_NOFIX;
126  }
127 
128 }}}
129 
130 // STATISTICS: int-prop