this repo has no description
dekker.one
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 "test/set.hh"
35
36using namespace Gecode;
37
38namespace Test { namespace Set {
39
40 /// %Tests for sequence constraints
41 namespace Sequence {
42
43 /**
44 * \defgroup TaskTestSetSequence Sequence constraints
45 * \ingroup TaskTestSet
46 */
47 //@{
48
49 static IntSet ds_33(-1,2);
50
51 /// %Test for sequence constraint
52 class Sequence : public SetTest {
53 public:
54 /// Create and register test
55 Sequence(const char* t)
56 : SetTest(t,4,ds_33,false) {}
57 /// %Test whether \a x is solution
58 virtual bool solution(const SetAssignment& x) const {
59 int max = Gecode::Set::Limits::min - 1;
60 for (int i=0; i<4; i++) {
61 CountableSetRanges xir(x.lub, x[i]);
62 IntSet xi(xir);
63 if (xi.ranges() > 0) {
64 int oldMax = max;
65 max = xi.max();
66 if (xi.min() <= oldMax)
67 return false;
68 }
69 }
70 return true;
71 }
72 /// Post constraint on \a x
73 virtual void post(Space& home, SetVarArray& x, IntVarArray&) {
74 Gecode::sequence(home, x);
75 }
76 };
77 Sequence _sequence("Sequence::Sequence");
78
79 /// %Test for sequential-union constraint
80 class SeqU : public SetTest {
81 private:
82 int n;
83 public:
84 /// Create and register test
85 SeqU(int n0)
86 : SetTest("Sequence::SeqU"+str(n0),n0+1,ds_33,false), n(n0) {}
87 /// %Test whether \a x is solution
88 virtual bool solution(const SetAssignment& x) const {
89 int max = Gecode::Set::Limits::min - 1;
90 for (int i=0; i<n; i++) {
91 CountableSetRanges xir(x.lub, x[i]);
92 IntSet xi(xir);
93 if (xi.ranges() > 0) {
94 int oldMax = max;
95 max = xi.max();
96 if (xi.min() <= oldMax)
97 return false;
98 }
99 }
100 CountableSetRanges* isrs = new CountableSetRanges[n];
101 for (int i=n; i--; )
102 isrs[i].init(x.lub, x[i]);
103 bool ret;
104 {
105 Region r;
106 Iter::Ranges::NaryUnion u(r, isrs, n);
107 CountableSetRanges xnr(x.lub, x[n]);
108 ret = Iter::Ranges::equal(u, xnr);
109 }
110 delete[] isrs;
111 return ret;
112 }
113 /// Post constraint on \a x
114 virtual void post(Space& home, SetVarArray& x, IntVarArray&) {
115 SetVarArgs xs(x.size()-1);
116 for (int i=x.size()-1; i--;)
117 xs[i]=x[i];
118 Gecode::sequence(home, xs, x[x.size()-1]);
119 }
120 };
121 SeqU _sequ0(0);
122 SeqU _sequ1(1);
123 SeqU _sequ3(3);
124
125}}}
126
127// STATISTICS: test-set