Generated on Mon Sep 17 2012 22:20:41 for Gecode by doxygen 1.8.1.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  * Guido Tack <tack@gecode.org>
5  *
6  * Copyright:
7  * Guido Tack, 2005
8  *
9  * Last modified:
10  * $Date: 2011-08-09 02:04:53 +1000 (Tue, 09 Aug 2011) $ by $Author: schulte $
11  * $Revision: 12253 $
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 "test/set.hh"
39 
40 using namespace Gecode;
41 
42 namespace Test { namespace Set {
43 
45  namespace Sequence {
46 
52 
53  static IntSet ds_33(-1,2);
54 
56  class Sequence : public SetTest {
57  public:
59  Sequence(const char* t)
60  : SetTest(t,4,ds_33,false) {}
62  virtual bool solution(const SetAssignment& x) const {
63  int max = Gecode::Set::Limits::min - 1;
64  for (int i=0; i<4; i++) {
65  CountableSetRanges xir(x.lub, x[i]);
66  IntSet xi(xir);
67  if (xi.ranges() > 0) {
68  int oldMax = max;
69  max = xi.max();
70  if (xi.min() <= oldMax)
71  return false;
72  }
73  }
74  return true;
75  }
77  virtual void post(Space& home, SetVarArray& x, IntVarArray&) {
78  Gecode::sequence(home, x);
79  }
80  };
81  Sequence _sequence("Sequence::Sequence");
82 
84  class SeqU : public SetTest {
85  private:
86  int n;
87  public:
89  SeqU(int n0)
90  : SetTest("Sequence::SeqU"+str(n0),n0+1,ds_33,false), n(n0) {}
92  virtual bool solution(const SetAssignment& x) const {
93  int max = Gecode::Set::Limits::min - 1;
94  for (int i=0; i<n; i++) {
95  CountableSetRanges xir(x.lub, x[i]);
96  IntSet xi(xir);
97  if (xi.ranges() > 0) {
98  int oldMax = max;
99  max = xi.max();
100  if (xi.min() <= oldMax)
101  return false;
102  }
103  }
104  CountableSetRanges* isrs = new CountableSetRanges[n];
105  for (int i=n; i--; )
106  isrs[i].init(x.lub, x[i]);
107  FakeSpace* fs = new FakeSpace;
108  bool ret;
109  {
110  Region r(*fs);
111  Iter::Ranges::NaryUnion u(r, isrs, n);
112  CountableSetRanges xnr(x.lub, x[n]);
113  ret = Iter::Ranges::equal(u, xnr);
114  }
115  delete[] isrs;
116  delete fs;
117  return ret;
118  }
120  virtual void post(Space& home, SetVarArray& x, IntVarArray&) {
121  SetVarArgs xs(x.size()-1);
122  for (int i=x.size()-1; i--;)
123  xs[i]=x[i];
124  Gecode::sequence(home, xs, x[x.size()-1]);
125  }
126  };
127  SeqU _sequ0(0);
128  SeqU _sequ1(1);
129  SeqU _sequ3(3);
130 
131 }}}
132 
133 // STATISTICS: test-set