Generated on Sat Feb 7 2015 02:01:25 for Gecode by doxygen 1.8.9.1
sequence.cpp
Go to the documentation of this file.
1 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
2 /*
3  * Main authors:
4  * David Rijsman <David.Rijsman@quintiq.com>
5  *
6  * Contributing authors:
7  * Christian Schulte <schulte@gecode.org>
8  *
9  * Copyright:
10  * David Rijsman, 2009
11  * Christian Schulte, 2009
12  *
13  * Last modified:
14  * $Date: 2010-04-08 12:35:31 +0200 (Thu, 08 Apr 2010) $
15  * $Revision: 10684 $
16  *
17  * This file is part of Gecode, the generic constraint
18  * development environment:
19  * http://www.gecode.org
20  *
21  * Permission is hereby granted, free of charge, to any person obtaining
22  * a copy of this software and associated documentation files (the
23  * "Software"), to deal in the Software without restriction, including
24  * without limitation the rights to use, copy, modify, merge, publish,
25  * distribute, sublicense, and/or sell copies of the Software, and to
26  * permit persons to whom the Software is furnished to do so, subject to
27  * the following conditions:
28  *
29  * The above copyright notice and this permission notice shall be
30  * included in all copies or substantial portions of the Software.
31  *
32  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
33  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
34  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
35  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
36  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
37  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
38  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
39  *
40  */
41 
42 #include "test/int.hh"
43 
44 #include <gecode/minimodel.hh>
45 #include <climits>
46 
47 namespace Test { namespace Int {
48 
50  namespace Sequence {
51 
57  class SequenceTest : public Test {
59  protected:
61  int q,l,u;
62  public:
64  SequenceTest(const std::string& s,
65  const Gecode::IntSet& s0, int q0, int l0, int u0,
66  int size, int min, int max)
67  : Test("Sequence::"+s,size,min,max), s(s0), q(q0), l(l0), u(u0) {
68  }
70  virtual bool solution(const Assignment& x) const {
71  for (int i=0; i< (x.size() - q + 1); i++ ) {
72  int total = 0;
73  for (int j=i; j < i + q; j++ ) {
74  if (s.in(x[j]))
75  total++;
76  if (total > u)
77  return false;
78  }
79  if ( total < l )
80  return false;
81  }
82  return true;
83  }
84  };
85 
86 
88  class SequenceBoolTest : public SequenceTest {
89  public:
91  SequenceBoolTest(const std::string& s, const Gecode::IntSet& s0,
92  int q0, int l0, int u0, int size)
93  : SequenceTest("Bool::"+s,s0,q0,l0,u0,size,0,1) {
94  }
95 
97  virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
99 
100  for (int i=0; i<x.size(); i++) {
101  c[i]=Gecode::channel(home,x[i]);
102  }
103 
104  Gecode::sequence(home,c,s,q,l,u);
105  }
106  };
107 
109  class SequenceIntTest : public SequenceTest {
110  public:
112  SequenceIntTest(const std::string& s, const Gecode::IntSet& s0,
113  int q0, int l0, int u0, int size, int min, int max)
114  : SequenceTest("Int::"+s,s0,q0,l0,u0,size,min,max) {
115  }
116 
118  virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
119  Gecode::sequence(home,x,s,q,l,u);
120  }
121  };
122 
124  class Create {
125  public:
126 
128  Create(void) {
129  using namespace Gecode;
130 
131  IntSet a(0,0);
132  IntSet b(1,1);
133  IntSet c(2,2);
134  IntSet d(0,1);
135  IntArgs ie(2, 0,2);
136  IntSet e(ie);
137 
138  (void) new SequenceBoolTest("A",a,3,2,2,6);
139  (void) new SequenceBoolTest("B",b,3,2,2,6);
140  (void) new SequenceBoolTest("C",b,6,2,2,6);
141  (void) new SequenceBoolTest("D",b,6,0,0,6);
142  (void) new SequenceBoolTest("E",b,6,6,6,6);
143 
144 
145  (void) new SequenceIntTest ("A",c,3,2,2,6,2,3);
146  (void) new SequenceIntTest ("B",c,3,2,2,6,2,4);
147  (void) new SequenceIntTest ("C",b,3,2,2,6,1,3);
148  (void) new SequenceIntTest ("D",c,3,0,0,3,1,3);
149  (void) new SequenceIntTest ("E",c,3,3,3,3,1,3);
150  (void) new SequenceIntTest ("F",c,3,2,2,10,2,3);
151 
152  (void) new SequenceIntTest ("G",d,3,2,2,6,0,3);
153  (void) new SequenceIntTest ("H",d,3,2,2,6,0,4);
154  (void) new SequenceIntTest ("I",d,3,2,2,6,1,3);
155  (void) new SequenceIntTest ("J",e,3,0,0,6,0,3);
156  (void) new SequenceIntTest ("K",e,3,3,3,6,0,3);
157  (void) new SequenceIntTest ("L",e,3,2,2,6,0,3);
158 
159  }
160  };
161 
164 
165  }
166 }}
167 
168 // STATISTICS: test-int
void channel(Home home, FloatVar x0, IntVar x1)
Post propagator for channeling a float and an integer variable .
Definition: arithmetic.cpp:218
const FloatNum max
Largest allowed float value.
Definition: float.hh:831
SequenceBoolTest(const std::string &s, const Gecode::IntSet &s0, int q0, int l0, int u0, int size)
Create and register test.
Definition: sequence.cpp:91
bool in(int n) const
Return whether n is included in the set.
Definition: int-set-1.hpp:140
Create(void)
Perform creation and registration.
Definition: sequence.cpp:128
Integer variable array.
Definition: int.hh:741
Computation spaces.
Definition: core.hpp:1362
SequenceTest(const std::string &s, const Gecode::IntSet &s0, int q0, int l0, int u0, int size, int min, int max)
Create and register test.
Definition: sequence.cpp:64
Gecode::IntSet d(v, 7)
void sequence(Home home, const IntVarArgs &x, const IntSet &s, int q, int l, int u, IntConLevel)
Post propagator for .
Definition: sequence.cpp:51
const FloatNum min
Smallest allowed float value.
Definition: float.hh:833
Gecode::IntArgs i(4, 1, 2, 3, 4)
virtual void post(Gecode::Space &home, Gecode::IntVarArray &x)
Post constraint on x.
Definition: sequence.cpp:118
unsigned int size(I &i)
Size of all ranges of range iterator i.
Test for sequence with boolean variables
Definition: sequence.cpp:109
Integer sets.
Definition: int.hh:171
Test for sequence with boolean variables
Definition: sequence.cpp:88
Passing integer arguments.
Definition: int.hh:607
Passing Boolean variables.
Definition: int.hh:690
General test support.
Definition: afc.cpp:43
Node * x
Pointer to corresponding Boolean expression node.
Definition: bool-expr.cpp:253
virtual bool solution(const Assignment &x) const
Test whether x is solutionin
Definition: sequence.cpp:70
Base class for assignments
Definition: int.hh:63
Help class to create and register tests.
Definition: sequence.cpp:124
virtual void post(Gecode::Space &home, Gecode::IntVarArray &x)
Post constraint on x.
Definition: sequence.cpp:97
struct Gecode::@518::NNF::@57::@58 b
For binary nodes (and, or, eqv)
Gecode toplevel namespace
int size(void) const
Return size of array (number of elements)
Definition: array.hpp:985
Base test for sequence
Definition: sequence.cpp:58
struct Gecode::@518::NNF::@57::@59 a
For atomic nodes.
int size(void) const
Return number of variables.
Definition: int.hpp:50
SequenceIntTest(const std::string &s, const Gecode::IntSet &s0, int q0, int l0, int u0, int size, int min, int max)
Create and register test.
Definition: sequence.cpp:112