Generated on Sat Feb 7 2015 02:01:30 for Gecode by doxygen 1.8.9.1
rel-op-const-vcv.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  * Contributing authors:
7  * Gabor Szokoli <szokoli@gecode.org>
8  *
9  * Copyright:
10  * Guido Tack, 2004, 2005
11  *
12  * Last modified:
13  * $Date: 2011-08-24 16:34:16 +0200 (Wed, 24 Aug 2011) $ by $Author: tack $
14  * $Revision: 12346 $
15  *
16  * This file is part of Gecode, the generic constraint
17  * development environment:
18  * http://www.gecode.org
19  *
20  * Permission is hereby granted, free of charge, to any person obtaining
21  * a copy of this software and associated documentation files (the
22  * "Software"), to deal in the Software without restriction, including
23  * without limitation the rights to use, copy, modify, merge, publish,
24  * distribute, sublicense, and/or sell copies of the Software, and to
25  * permit persons to whom the Software is furnished to do so, subject to
26  * the following conditions:
27  *
28  * The above copyright notice and this permission notice shall be
29  * included in all copies or substantial portions of the Software.
30  *
31  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
32  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
33  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
34  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
35  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
36  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
37  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
38  *
39  */
40 
41 #include <gecode/set.hh>
42 #include <gecode/set/rel.hh>
43 #include <gecode/set/rel-op.hh>
44 
45 namespace Gecode {
46  using namespace Gecode::Set;
47  using namespace Gecode::Set::Rel;
48  using namespace Gecode::Set::RelOp;
49 
50  void
51  rel(Home home, SetVar x, SetOpType op, const IntSet& y, SetRelType r,
52  SetVar z) {
53  Set::Limits::check(y, "Set::rel");
54  ConstSetView yv(home, y);
55 
56  if (op==SOT_MINUS) {
57  switch (r) {
58  case SRT_EQ:
59  {
62  IntSet yc(yrc);
63  ConstSetView cy(home, yc);
67  ::post(home,cy,x,z)));
68  }
69  break;
70  case SRT_LQ: case SRT_LE: case SRT_GQ: case SRT_GR:
71  {
74  IntSet yc(yrc);
75  ConstSetView cy(home, yc);
80  ::post(home,cy,x,tmp)));
81  rel(home,tmp,r,z);
82  }
83  break;
84  case SRT_NQ:
85  {
86  SetVar tmp(home);
89  ::post(home,z,tmp)));
92  IntSet yc(yrc);
93  ConstSetView cy(home, yc);
97  ::post(home,cy,x,tmp)));
98  }
99  break;
100  case SRT_SUB:
101  {
104  IntSet yc(yrc);
105  ConstSetView cy(home, yc);
108  ::post(home,cy,x,z)));
109 
110  }
111  break;
112  case SRT_SUP:
113  {
114  SetVar tmp(home);
116  (Subset<SetView,SetView>::post(home,z,tmp)));
117 
120  IntSet yc(yrc);
121  ConstSetView cy(home, yc);
122 
123  SetView xv(x);
127  ::post(home,cy,xv,tmp)));
128  }
129  break;
130  case SRT_DISJ:
131  {
132  SetVar tmp(home);
133  EmptyView emptyset;
135  ::post(home, z, tmp, emptyset)));
136 
139  IntSet yc(yrc);
140  ConstSetView cy(home, yc);
144  ::post(home,cy,x,tmp)));
145  }
146  break;
147  case SRT_CMPL:
148  {
149  SetView xv(x);
154  SetView>::post(home, yv, cx, z)));
155  }
156  break;
157  default:
158  throw UnknownRelation("Set::rel");
159  }
160  } else {
161  rel(home, y, op, x, r, z);
162  }
163  }
164 }
165 
166 // STATISTICS: set-post
Range iterator for greatest lower bound of constant set view
Definition: const.hpp:668
Propagator for negated equality
Definition: rel.hh:261
void check(int n, const char *l)
Check whether integer n is in range, otherwise throw overflow exception with information l...
Definition: limits.hpp:41
SetRelType
Common relation types for sets.
Definition: set.hh:644
void post(Home home, Term *t, int n, FloatRelType frt, FloatVal c)
Post propagator for linear constraint over floats.
Definition: post.cpp:228
const int min
Smallest allowed integer in integer set.
Definition: set.hh:101
Propagator for ternary union
Definition: rel-op.hh:156
Propagator for the subset constraint
Definition: rel.hh:64
SetOpType
Common operations for sets.
Definition: set.hh:661
Superset ( )
Definition: set.hh:648
Complement.
Definition: set.hh:650
const int max
Largest allowed integer in integer set.
Definition: set.hh:99
Difference.
Definition: set.hh:665
Exception: Unknown relation passed as argument
Definition: exception.hpp:91
NNF * r
Right subtree.
Definition: bool-expr.cpp:246
Less or equal ( )
Definition: set.hh:651
A complement iterator spezialized for the BndSet limits.
Definition: var-imp.hpp:296
Subset ( )
Definition: set.hh:647
Integer sets.
Definition: int.hh:171
Less ( )
Definition: set.hh:652
static const IntSet empty
Empty set.
Definition: int.hh:262
Standard set operation propagators.
Definition: common.hpp:81
Set view for set variables
Definition: view.hpp:60
Greater or equal ( )
Definition: set.hh:653
Constant view.
Definition: view.hpp:190
Node * x
Pointer to corresponding Boolean expression node.
Definition: bool-expr.cpp:253
Set variables
Definition: set.hh:129
Standard set relation propagators.
Definition: common.hpp:57
void rel(Home home, FloatVar x0, FloatRelType frt, FloatVal n)
Propagates .
Definition: rel.cpp:47
Propagator for the superset of intersection
Definition: rel-op.hh:65
Greater ( )
Definition: set.hh:654
Equality ( )
Definition: set.hh:645
Disjoint ( )
Definition: set.hh:649
Finite integer sets.
Definition: var-imp.hpp:115
Disequality ( )
Definition: set.hh:646
Complement set view.
Definition: view.hpp:754
Gecode toplevel namespace
Constant view for the empty set.
Definition: view.hpp:335
Home class for posting propagators
Definition: core.hpp:717
#define GECODE_ES_FAIL(es)
Check whether execution status es is failed, and fail space home.
Definition: macros.hpp:96
Propagator for ternary intersection
Definition: rel-op.hh:126