Generated on Fri Jan 28 2022 04:43:06 for Gecode by doxygen 1.8.13
int.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  * Mikael Lagerkvist <lagerkvist@gecode.org>
6  *
7  * Copyright:
8  * Christian Schulte, 2005
9  * Mikael Lagerkvist, 2006
10  *
11  * This file is part of Gecode, the generic constraint
12  * development environment:
13  * http://www.gecode.org
14  *
15  * Permission is hereby granted, free of charge, to any person obtaining
16  * a copy of this software and associated documentation files (the
17  * "Software"), to deal in the Software without restriction, including
18  * without limitation the rights to use, copy, modify, merge, publish,
19  * distribute, sublicense, and/or sell copies of the Software, and to
20  * permit persons to whom the Software is furnished to do so, subject to
21  * the following conditions:
22  *
23  * The above copyright notice and this permission notice shall be
24  * included in all copies or substantial portions of the Software.
25  *
26  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
27  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
28  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
29  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
30  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
31  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
32  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
33  *
34  */
35 
36 namespace Test { namespace Int {
37 
38  /*
39  * Assignments
40  *
41  */
42  inline
44  : n(n0), d(d0) {}
45  inline int
46  Assignment::size(void) const {
47  return n;
48  }
49  inline
51 
52 
53  inline
55  : Assignment(n,d),
56  dsv(new Gecode::IntSetValues[static_cast<unsigned int>(n)]) {
57  for (int i=n; i--; )
58  dsv[i].init(d);
59  }
60  inline bool
62  return dsv[0]();
63  }
64  inline int
66  assert((i>=0) && (i<n));
67  return dsv[i].val();
68  }
69  inline
71  delete [] dsv;
72  }
73 
74 
75  forceinline int
77  unsigned int skip = Base::rand(d.size());
78  for (Gecode::IntSetRanges it(d); true; ++it) {
79  if (it.width() > skip)
80  return it.min() + static_cast<int>(skip);
81  skip -= it.width();
82  }
84  return 0;
85  }
86 
87  inline
89  : Assignment(n,d), vals(new int[n]), a(a0) {
90  for (int i=n; i--; )
91  vals[i] = randval();
92  }
93 
94  inline bool
96  return a>0;
97  }
98  inline int
100  assert((i>=0) && (i<n));
101  return vals[i];
102  }
103  inline
105  delete [] vals;
106  }
107 
108  forceinline int
110  unsigned int skip = Base::rand(d.size());
111  for (Gecode::IntSetRanges it(d); true; ++it) {
112  if (it.width() > skip)
113  return it.min() + static_cast<int>(skip);
114  skip -= it.width();
115  }
116  GECODE_NEVER;
117  return 0;
118  }
119 
120  inline
122  int n1, const Gecode::IntSet& d1,
123  int a0)
124  : Assignment(n0+n1,d0),vals(new int[n0+n1]),a(a0),_n1(n1),_d1(d1) {
125  for (int i=n0; i--; )
126  vals[i] = randval(d);
127  for (int i=n1; i--; )
128  vals[n0+i] = randval(_d1);
129  }
130 
131  inline bool
133  return a>0;
134  }
135 
136  inline int
138  assert((i>=0) && (i<n));
139  return vals[i];
140  }
141 
142  inline
144  delete [] vals;
145  }
146 
147  /*
148  * Tests with integer constraints
149  *
150  */
151  forceinline bool
152  Test::eqv(void) const {
153  return reified && ((rms & (1 << Gecode::RM_EQV)) != 0);
154  }
155  forceinline bool
156  Test::imp(void) const {
157  return reified && ((rms & (1 << Gecode::RM_IMP)) != 0);
158  }
159  forceinline bool
160  Test::pmi(void) const {
161  return reified && ((rms & (1 << Gecode::RM_PMI)) != 0);
162  }
163  inline
164  Test::Test(const std::string& p, const std::string& s,
165  int a, const Gecode::IntSet& d, bool r,
167  : Base(p+s), arity(a), dom(d),
168  reified(r), rms((1 << Gecode::RM_EQV) |
169  (1 << Gecode::RM_IMP) |
170  (1 << Gecode::RM_PMI)),
171  ipl(i), contest(ipl == Gecode::IPL_DOM ? CTL_DOMAIN : CTL_NONE),
172  testsearch(true), testfix(true) {}
173 
174  inline
175  Test::Test(const std::string& s,
176  int a, const Gecode::IntSet& d, bool r,
178  : Base("Int::"+s), arity(a), dom(d),
179  reified(r), rms((1 << Gecode::RM_EQV) |
180  (1 << Gecode::RM_IMP) |
181  (1 << Gecode::RM_PMI)),
183  testsearch(true), testfix(true) {}
184 
185  inline
186  Test::Test(const std::string& p, const std::string& s,
187  int a, int min, int max, bool r,
189  : Base(p+s), arity(a), dom(min,max),
190  reified(r), rms((1 << Gecode::RM_EQV) |
191  (1 << Gecode::RM_IMP) |
192  (1 << Gecode::RM_PMI)),
194  testsearch(true), testfix(true) {}
195 
196  inline
197  Test::Test(const std::string& s,
198  int a, int min, int max, bool r, Gecode::IntPropLevel i)
199  : Base("Int::"+s), arity(a), dom(min,max),
200  reified(r), rms((1 << Gecode::RM_EQV) |
201  (1 << Gecode::RM_IMP) |
202  (1 << Gecode::RM_PMI)),
204  testsearch(true), testfix(true) {}
205 
206  inline
207  std::string
209  using namespace Gecode;
210  std::stringstream s;
211  switch (vbd(ipl)) {
212  case IPL_VAL: s << "Val"; break;
213  case IPL_BND: s << "Bnd"; break;
214  case IPL_DOM: s << "Dom"; break;
215  default: s << "Def"; break;
216  }
217  if (ipl & IPL_BASIC) s << "+B";
218  if (ipl & IPL_ADVANCED) s << "+A";
219  return s.str();
220  }
221 
222  inline
223  std::string
225  using namespace Gecode;
226  switch (irt) {
227  case IRT_LQ: return "Lq";
228  case IRT_LE: return "Le";
229  case IRT_GQ: return "Gq";
230  case IRT_GR: return "Gr";
231  case IRT_EQ: return "Eq";
232  case IRT_NQ: return "Nq";
233  default: ;
234  }
235  GECODE_NEVER;
236  return "NONE";
237  }
238 
239  inline std::string
241  using namespace Gecode;
242  switch (bot) {
243  case BOT_AND: return "And";
244  case BOT_OR: return "Or";
245  case BOT_IMP: return "Imp";
246  case BOT_EQV: return "Eqv";
247  case BOT_XOR: return "Xor";
248  default: GECODE_NEVER;
249  }
250  GECODE_NEVER;
251  return "NONE";
252  }
253 
254  inline
255  std::string
256  Test::str(bool b) {
257  std::stringstream s;
258  if (b)
259  s << "+";
260  else
261  s << "-";
262  return s.str();
263  }
264 
265  inline
266  std::string
267  Test::str(int i) {
268  std::stringstream s;
269  s << i;
270  return s.str();
271  }
272 
273  inline
274  std::string
276  std::string s = "";
277  for (int i=0; i<x.size()-1; i++)
278  s += str(x[i]) + ",";
279  return "[" + s + str(x[x.size()-1]) + "]";
280  }
281 
282  template<class T>
283  inline bool
285  using namespace Gecode;
286  switch (r) {
287  case IRT_EQ: return x == y;
288  case IRT_NQ: return x != y;
289  case IRT_LQ: return x <= y;
290  case IRT_LE: return x < y;
291  case IRT_GR: return x > y;
292  case IRT_GQ: return x >= y;
293  default: ;
294  }
295  return false;
296  }
297 
298 
299 
300  inline
302  : i(sizeof(ipls)/sizeof(Gecode::IntPropLevel)-1) {}
303  inline bool
305  return i>=0;
306  }
307  inline void
309  i--;
310  }
311  inline Gecode::IntPropLevel
312  IntPropLevels::ipl(void) const {
313  return ipls[i];
314  }
315 
316 
317  inline
319  : i(sizeof(ipls)/sizeof(Gecode::IntPropLevel)-1) {}
320  inline bool
322  return i>=0;
323  }
324  inline void
326  i--;
327  }
328  inline Gecode::IntPropLevel
330  return ipls[i];
331  }
332 
333 
334  inline
336  : i(sizeof(irts)/sizeof(Gecode::IntRelType)-1) {}
337  inline void
339  i = sizeof(irts)/sizeof(Gecode::IntRelType)-1;
340  }
341  inline bool
343  return i>=0;
344  }
345  inline void
347  i--;
348  }
349  inline Gecode::IntRelType
350  IntRelTypes::irt(void) const {
351  return irts[i];
352  }
353 
354  inline
356  : i(sizeof(bots)/sizeof(Gecode::BoolOpType)-1) {}
357  inline bool
359  return i>=0;
360  }
361  inline void
363  i--;
364  }
365  inline Gecode::BoolOpType
366  BoolOpTypes::bot(void) const {
367  return bots[i];
368  }
369 
370 }}
371 
372 // STATISTICS: test-int
373 
Bounds propagation.
Definition: int.hh:978
RandomMixAssignment(int n0, const Gecode::IntSet &d0, int n1, const Gecode::IntSet &d1, int a0)
Initialize for a assignments for n0 variables and values d0.
Definition: int.hpp:121
IntPropLevel vbd(IntPropLevel ipl)
Extract value, bounds, or domain propagation from propagation level.
Definition: ipl.hpp:37
Gecode::IntPropLevel ipl(void) const
Return current level.
Definition: int.hpp:312
RandomAssignment(int n, const Gecode::IntSet &d, int a)
Initialize for a assignments for n0 variables and values d0.
Definition: int.hpp:88
static std::string str(Gecode::IntPropLevel ipl)
Map integer propagation level to string.
Definition: int.hpp:208
Inverse implication for reification.
Definition: int.hh:869
int size(void) const
Return size of array (number of elements)
Definition: array.hpp:1569
Range iterator for integer sets.
Definition: int.hh:292
const FloatNum max
Largest allowed float value.
Definition: float.hh:844
virtual int operator[](int i) const
Return value for variable i.
Definition: int.hpp:99
int size(void) const
Return number of variables.
Definition: int.hpp:46
bool operator()(void) const
Test whether iterator is done.
Definition: int.hpp:321
static Gecode::Support::RandomGenerator rand
Random number generator.
Definition: test.hh:134
int a
How many assigments still to be generated Generate new value according to domain. ...
Definition: int.hh:99
BoolOpType
Operation types for Booleans.
Definition: int.hh:950
static bool cmp(T x, Gecode::IntRelType r, T y)
Compare x and y with respect to r.
Definition: int.hpp:284
bool imp(void) const
Test whether implication as reification mode is supported.
Definition: int.hpp:156
Gecode::BoolOpType bot(void) const
Return current operation type.
Definition: int.hpp:366
Less or equal ( )
Definition: int.hh:928
Conjunction.
Definition: int.hh:951
bool operator()(void) const
Test whether iterator is done.
Definition: int.hpp:358
virtual ~RandomAssignment(void)
Destructor.
Definition: int.hpp:104
void dom(Home home, FloatVar x, FloatVal n)
Propagates .
Definition: dom.cpp:40
Gecode::IntSet dom
Domain of variables.
Definition: int.hh:228
Implication.
Definition: int.hh:953
void operator++(void)
Increment to next level.
Definition: int.hpp:325
Greater ( )
Definition: int.hh:931
#define forceinline
Definition: config.hpp:185
virtual int operator[](int i) const
Return value for variable i.
Definition: int.hpp:65
ConTestLevel contest
Whether to test for certain consistency.
Definition: int.hh:236
int rms
Which reification modes are supported.
Definition: int.hh:232
Greater or equal ( )
Definition: int.hh:930
virtual ~CpltAssignment(void)
Destructor.
Definition: int.hpp:70
int val(void) const
Return current value.
Exclusive or.
Definition: int.hh:955
void operator++(void)
Increment to next level.
Definition: int.hpp:308
int n
Number of variables.
Definition: int.hh:61
Gecode::IntSet d1(v1, 7)
Gecode::IntSet d(v, 7)
Gecode::IntSet d
Domain for each variable.
Definition: int.hh:62
int p
Number of positive literals for node type.
Definition: bool-expr.cpp:232
const FloatNum min
Smallest allowed float value.
Definition: float.hh:846
int n
Number of negative literals for node type.
Definition: bool-expr.cpp:234
Equality ( )
Definition: int.hh:926
Gecode::IntArgs i({1, 2, 3, 4})
No consistency-test.
Definition: int.hh:140
IntRelType
Relation types for integers.
Definition: int.hh:925
CpltAssignment(int n, const Gecode::IntSet &d)
Initialize assignments for n0 variables and values d0.
Definition: int.hpp:54
int a
How many assigments still to be generated.
Definition: int.hh:119
int * vals
The current values for the variables.
Definition: int.hh:118
Gecode::IntRelType irt(void) const
Return current relation type.
Definition: int.hpp:350
IntRelTypes(void)
Initialize iterator.
Definition: int.hpp:335
unsigned int size(void) const
Return size (cardinality) of set.
Definition: int-set-1.hpp:195
Use basic propagation algorithm.
Definition: int.hh:981
struct Gecode::@593::NNF::@62::@63 b
For binary nodes (and, or, eqv)
virtual bool operator()(void) const
Test whether all assignments have been iterated.
Definition: int.hpp:61
Value propagation.
Definition: int.hh:977
Base class for all tests to be run
Definition: test.hh:103
Gecode::IntSetValues * dsv
Iterator for each variable.
Definition: int.hh:81
Less ( )
Definition: int.hh:929
Integer sets.
Definition: int.hh:174
Test for domain-consistency.
Definition: int.hh:141
Use advanced propagation algorithm.
Definition: int.hh:982
int randval(const Gecode::IntSet &d)
Definition: int.hpp:109
virtual bool operator()(void) const
Test whether all assignments have been iterated.
Definition: int.hpp:95
Disjunction.
Definition: int.hh:952
Gecode::IntPropLevel ipl
Propagation level.
Definition: int.hh:234
IntPropBasicAdvanced(void)
Initialize iterator.
Definition: int.hpp:318
Passing integer arguments.
Definition: int.hh:628
void operator++(void)
Increment to next operation type.
Definition: int.hpp:362
bool testfix
Whether to perform fixpoint test.
Definition: int.hh:240
virtual ~RandomMixAssignment(void)
Destructor.
Definition: int.hpp:143
General test support.
Definition: afc.cpp:39
IntPropLevel
Propagation levels for integer propagators.
Definition: int.hh:974
Post propagator for SetVar SetOpType SetVar y
Definition: set.hh:767
Gecode::IntSet _d1
Domain for second set of variables Generate new value according to domain d.
Definition: int.hh:121
Node * x
Pointer to corresponding Boolean expression node.
Definition: bool-expr.cpp:249
Assignment(int n0, const Gecode::IntSet &d0)
Initialize assignments for n0 variables and values d0.
Definition: int.hpp:43
bool testsearch
Whether to perform search test.
Definition: int.hh:238
bool operator()(void) const
Test whether iterator is done.
Definition: int.hpp:304
virtual int operator[](int i) const
Return value for variable i.
Definition: int.hpp:137
Region r
Definition: region.cpp:65
Base class for assignments
Definition: int.hh:59
Domain propagation Options: basic versus advanced propagation.
Definition: int.hh:979
bool pmi(void) const
Test whether reverse implication as reification mode is supported.
Definition: int.hpp:160
Equivalence.
Definition: int.hh:954
bool eqv(void) const
Test whether equivalence as reification mode is supported.
Definition: int.hpp:152
void operator++(void)
Increment to next relation type.
Definition: int.hpp:346
IntPropLevels(void)
Initialize iterator.
Definition: int.hpp:301
BoolOpTypes(void)
Initialize iterator.
Definition: int.hpp:355
Gecode toplevel namespace
Implication for reification.
Definition: int.hh:862
Disequality ( )
Definition: int.hh:927
int arity
Number of variables.
Definition: int.hh:226
void reset(void)
Reset iterator.
Definition: int.hpp:338
virtual ~Assignment(void)
Destructor.
Definition: int.hpp:50
Gecode::IntPropLevel ipl(void) const
Return current level.
Definition: int.hpp:329
#define GECODE_NEVER
Assert that this command is never executed.
Definition: macros.hpp:56
struct Gecode::@593::NNF::@62::@64 a
For atomic nodes.
bool reified
Does the constraint also exist as reified constraint.
Definition: int.hh:230
virtual bool operator()(void) const
Test whether all assignments have been iterated.
Definition: int.hpp:132
Test(const std::string &p, const std::string &s, int a, const Gecode::IntSet &d, bool r=false, Gecode::IntPropLevel i=Gecode::IPL_DEF)
Constructor.
Definition: int.hpp:164
bool operator()(void) const
Test whether iterator is done.
Definition: int.hpp:342
Equivalence for reification (default)
Definition: int.hh:855
int * vals
The current values for the variables.
Definition: int.hh:98