Generated on Thu Mar 7 2013 10:21:31 for Gecode by doxygen 1.8.3.1
member.cpp
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-23 00:03:51 +1000 (Tue, 23 Aug 2011) $ by $Author: schulte $
11  * $Revision: 12331 $
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/minimodel.hh>
39 #include "test/int.hh"
40 
41 namespace Test { namespace Int {
42 
44  namespace Member {
45 
51 
52  class Int : public Test {
53  public:
55  Int(int n) : Test("Member::Int::"+str(n),n+1,0,n,true) {}
57  virtual bool solution(const Assignment& x) const {
58  int n = x.size() - 1;
59  for (int i=n; i--; )
60  if (x[i] == x[n])
61  return true;
62  return false;
63  }
65  virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
66  using namespace Gecode;
67  int n = x.size() - 1;
68  IntVarArgs y(n);
69  for (int i=n; i--; )
70  y[i] = x[i];
71  member(home, y, x[n]);
72  }
74  virtual void post(Gecode::Space& home, Gecode::IntVarArray& x,
76  using namespace Gecode;
77  int n = x.size() - 1;
78  IntVarArgs y(n);
79  for (int i=n; i--; )
80  y[i] = x[i];
81  member(home, y, x[n], b);
82  }
83  };
84 
86  class Bool : public Test {
87  public:
89  Bool(int n) : Test("Member::Bool::"+str(n),n+1,0,1,true) {}
91  virtual bool solution(const Assignment& x) const {
92  int n = x.size() - 1;
93  for (int i=n; i--; )
94  if (x[i] == x[n])
95  return true;
96  return false;
97  }
99  virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
100  using namespace Gecode;
101  int n = x.size() - 1;
102  BoolVarArgs y(n);
103  for (int i=n; i--; )
104  y[i] = channel(home,x[i]);
105  member(home, y, channel(home,x[n]));
106  }
108  virtual void post(Gecode::Space& home, Gecode::IntVarArray& x,
109  Gecode::BoolVar b) {
110  using namespace Gecode;
111  int n = x.size() - 1;
112  BoolVarArgs y(n);
113  for (int i=n; i--; )
114  y[i] = channel(home,x[i]);
115  member(home, y, channel(home,x[n]), b);
116  }
117  };
118 
120  class Create {
121  public:
123  Create(void) {
124  for (int i=0; i<=4; i++) {
125  (void) new Int(i);
126  (void) new Bool(i);
127  }
128  }
129  };
130 
133 
134  }
135 }}
136 
137 // STATISTICS: test-int
138