Generated on Wed Jul 21 2021 00:00:00 for Gecode by doxygen 1.9.1
rel.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  *
6  * Copyright:
7  * Guido Tack, 2005
8  *
9  * This file is part of Gecode, the generic constraint
10  * development environment:
11  * http://www.gecode.org
12  *
13  * Permission is hereby granted, free of charge, to any person obtaining
14  * a copy of this software and associated documentation files (the
15  * "Software"), to deal in the Software without restriction, including
16  * without limitation the rights to use, copy, modify, merge, publish,
17  * distribute, sublicense, and/or sell copies of the Software, and to
18  * permit persons to whom the Software is furnished to do so, subject to
19  * the following conditions:
20  *
21  * The above copyright notice and this permission notice shall be
22  * included in all copies or substantial portions of the Software.
23  *
24  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
28  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
29  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
30  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
31  *
32  */
33 
34 #include <gecode/minimodel.hh>
35 
36 #include "test/set.hh"
37 
38 using namespace Gecode;
39 
40 namespace Test { namespace Set {
41 
43  namespace Rel {
44 
50 
51  static IntSet ds_33(-3,3);
52  static IntSet ds_03(0,3);
53 
55  class RelBin : public SetTest {
56  private:
58  bool shared;
59  public:
61  RelBin(Gecode::SetRelType srt0, bool shared0)
62  : SetTest("Rel::Bin::"+str(srt0)+"::S"+(shared0 ? "1":"0"),
63  shared0 ? 1 : 2,ds_33,true)
64  , srt(srt0), shared(shared0){}
65  int minSymDiff(const SetAssignment& x) const {
66  int x1 = shared ? x[0] : x[1];
68  CountableSetRanges xr00(x.lub, x[0]);
69  CountableSetRanges xr10(x.lub, x1);
70  Diff a(xr00,xr10);
71  CountableSetRanges xr01(x.lub, x[0]);
72  CountableSetRanges xr11(x.lub, x1);
73  Diff b(xr11,xr01);
75  return u() ? u.min() : Gecode::Set::Limits::max+1;
76  }
77  bool in(int i, CountableSetRanges& c, bool eq=false) const {
78  if (eq && i==Gecode::Set::Limits::max+1)
79  return true;
81  return Iter::Ranges::subset(s,c);
82  }
84  bool solution(const SetAssignment& x) const {
85  int x1 = shared ? x[0] : x[1];
86  CountableSetRanges xr0(x.lub, x[0]);
87  CountableSetRanges xr1(x.lub, x1);
88  switch (srt) {
89  case SRT_EQ: return Iter::Ranges::equal(xr0, xr1);
90  case SRT_NQ: return !Iter::Ranges::equal(xr0, xr1);
91 
92  case SRT_LQ: return (!xr0()) || in(minSymDiff(x),xr1,true);
93  case SRT_LE: return xr0() ? in(minSymDiff(x),xr1) : xr1();
94  case SRT_GQ: return (!xr1()) || in(minSymDiff(x),xr0,true);
95  case SRT_GR: return xr1() ? in(minSymDiff(x),xr0) : xr0();
96 
97  case SRT_SUB: return Iter::Ranges::subset(xr0, xr1);
98  case SRT_SUP: return Iter::Ranges::subset(xr1, xr0);
99  case SRT_DISJ:
100  {
102  inter(xr0,xr1);
103  return !inter();
104  }
105  case SRT_CMPL:
106  {
108  return Iter::Ranges::equal(rc,xr1);
109  }
110  default:
111  GECODE_NEVER;
112  }
113  GECODE_NEVER;
114  return false;
115  }
117  void post(Space& home, SetVarArray& x, IntVarArray&) {
118  if (!shared)
119  Gecode::rel(home, x[0], srt, x[1]);
120  else
121  Gecode::rel(home, x[0], srt, x[0]);
122  }
124  void post(Space& home, SetVarArray& x, IntVarArray&, Reify r) {
125  if (!shared)
126  Gecode::rel(home, x[0], srt, x[1], r);
127  else
128  Gecode::rel(home, x[0], srt, x[0], r);
129  }
130  };
131 
133  class ITE : public SetTest {
134  public:
136  ITE(void)
137  : SetTest("ITE",3,ds_03,false,1) {}
139  virtual bool solution(const SetAssignment& x) const {
140  if ((x.intval() < 0) || (x.intval() > 1))
141  return false;
142  if (x.intval() == 1) {
143  CountableSetRanges xr0(x.lub, x[0]);
144  CountableSetRanges xr2(x.lub, x[2]);
145  return Iter::Ranges::equal(xr0,xr2);
146  } else {
147  CountableSetRanges xr1(x.lub, x[1]);
148  CountableSetRanges xr2(x.lub, x[2]);
149  return Iter::Ranges::equal(xr1,xr2);
150  }
151  }
153  void post(Space& home, SetVarArray& x, IntVarArray& y) {
154  Gecode::ite(home, Gecode::channel(home,y[0]), x[0], x[1], x[2]);
155  }
156  };
157 
178 
181 
182 }}}
183 
184 // STATISTICS: test-set
struct Gecode::@602::NNF::@65::@66 b
For binary nodes (and, or, eqv)
union Gecode::@602::NNF::@65 u
Union depending on nodetype t.
Node * x
Pointer to corresponding Boolean expression node.
Definition: bool-expr.cpp:249
struct Gecode::@602::NNF::@65::@67 a
For atomic nodes.
NNF * r
Right subtree.
Definition: bool-expr.cpp:242
Integer sets.
Definition: int.hh:174
Integer variable array.
Definition: int.hh:763
Range iterator for computing set difference.
Definition: ranges-diff.hpp:43
Range iterator for computing intersection (binary)
Range iterator for singleton range.
Range iterator for computing union (binary)
Reification specification.
Definition: int.hh:876
Set variable array
Definition: set.hh:570
A complement iterator spezialized for the BndSet limits.
Definition: var-imp.hpp:293
Computation spaces.
Definition: core.hpp:1742
Range iterator producing subsets of an IntSet.
Definition: set.hh:99
Test for if-then-else-constraint
Definition: rel.cpp:133
ITE(void)
Construct and register test.
Definition: rel.cpp:136
void post(Space &home, SetVarArray &x, IntVarArray &y)
Post constraint on x and y.
Definition: rel.cpp:153
virtual bool solution(const SetAssignment &x) const
Check whether x is a solution.
Definition: rel.cpp:139
Test for binary set relation constraint
Definition: rel.cpp:55
bool in(int i, CountableSetRanges &c, bool eq=false) const
Definition: rel.cpp:77
int minSymDiff(const SetAssignment &x) const
Definition: rel.cpp:65
void post(Space &home, SetVarArray &x, IntVarArray &, Reify r)
Post reified constraint on x for b.
Definition: rel.cpp:124
void post(Space &home, SetVarArray &x, IntVarArray &)
Post constraint on x.
Definition: rel.cpp:117
bool solution(const SetAssignment &x) const
Test whether x is solution
Definition: rel.cpp:84
RelBin(Gecode::SetRelType srt0, bool shared0)
Create and register test.
Definition: rel.cpp:61
Generate all set assignments.
Definition: set.hh:142
Base class for tests with set constraints
Definition: set.hh:273
void channel(Home home, FloatVar x0, IntVar x1)
Post propagator for channeling a float and an integer variable .
Definition: channel.cpp:41
Post propagator for SetVar SetOpType SetVar y
Definition: set.hh:767
void rel(Home home, FloatVar x0, FloatRelType frt, FloatVal n)
Propagates .
Definition: rel.cpp:43
void ite(Home home, BoolVar b, FloatVar x, FloatVar y, FloatVar z)
Post propagator for if-then-else constraint.
Definition: bool.cpp:39
SetRelType
Common relation types for sets.
Definition: set.hh:643
@ SRT_GQ
Greater or equal ( )
Definition: set.hh:652
@ SRT_CMPL
Complement.
Definition: set.hh:649
@ SRT_GR
Greater ( )
Definition: set.hh:653
@ SRT_LQ
Less or equal ( )
Definition: set.hh:650
@ SRT_NQ
Disequality ( )
Definition: set.hh:645
@ SRT_LE
Less ( )
Definition: set.hh:651
@ SRT_EQ
Equality ( )
Definition: set.hh:644
@ SRT_SUP
Superset ( )
Definition: set.hh:647
@ SRT_DISJ
Disjoint ( )
Definition: set.hh:648
@ SRT_SUB
Subset ( )
Definition: set.hh:646
bool shared(const IntSet &, VX)
Definition: view-base.hpp:118
bool subset(I &i, J &j)
Check whether range iterator i is subset of range iterator j.
bool equal(I &i, J &j)
Check whether range iterators i and j are equal.
const int max
Largest allowed integer in integer set.
Definition: set.hh:97
Gecode::IntArgs i({1, 2, 3, 4})
Create c
Definition: rel.cpp:621
RelBin _relbin_shared_nq(Gecode::SRT_NQ, true)
RelBin _relbin_shared_cmpl(Gecode::SRT_CMPL, true)
RelBin _relbin_shared_le(Gecode::SRT_LE, true)
RelBin _relbin_shared_gq(Gecode::SRT_GQ, true)
RelBin _relbin_gr(Gecode::SRT_GR, false)
RelBin _relbin_shared_disj(Gecode::SRT_DISJ, true)
RelBin _relbin_disj(Gecode::SRT_DISJ, false)
RelBin _relbin_le(Gecode::SRT_LE, false)
RelBin _relbin_eq(Gecode::SRT_EQ, false)
RelBin _relbin_shared_gr(Gecode::SRT_GR, true)
RelBin _relbin_cmpl(Gecode::SRT_CMPL, false)
RelBin _relbin_shared_eq(Gecode::SRT_EQ, true)
RelBin _relbin_shared_sub(Gecode::SRT_SUB, true)
RelBin _relbin_gq(Gecode::SRT_GQ, false)
RelBin _relbin_sub(Gecode::SRT_SUB, false)
RelBin _relbin_lq(Gecode::SRT_LQ, false)
RelBin _relbin_shared_sup(Gecode::SRT_SUP, true)
RelBin _relbin_shared_lq(Gecode::SRT_LQ, true)
RelBin _relbin_nq(Gecode::SRT_NQ, false)
RelBin _relbin_sup(Gecode::SRT_SUP, false)
General test support.
Definition: afc.cpp:39
SetExpr inter(const SetVarArgs &x)
Intersection of set variables.
Definition: set-expr.cpp:696
#define GECODE_NEVER
Assert that this command is never executed.
Definition: macros.hpp:56