1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
|
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Guido Tack <tack@gecode.org>
*
* Copyright:
* Guido Tack, 2005
*
* This file is part of Gecode, the generic constraint
* development environment:
* http://www.gecode.org
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
*/
#include "test/set.hh"
using namespace Gecode;
namespace Test { namespace Set {
/// %Tests for convexity constraints
namespace Convex {
/**
* \defgroup TaskTestSetConvex Convexity constraints
* \ingroup TaskTestSet
*/
//@{
static IntSet ds_33(-4,4);
/// %Test for convexity propagator
class Convex : public SetTest {
public:
/// Create and register test
Convex(const char* t)
: SetTest(t,1,ds_33,false) {}
/// %Test whether \a x is solution
virtual bool solution(const SetAssignment& x) const {
CountableSetRanges xr0(x.lub, x[0]);
if (!xr0())
return true;
++xr0;
if (!xr0())
return true;
return false;
}
/// Post constraint on \a x
virtual void post(Space& home, SetVarArray& x, IntVarArray&) {
Gecode::convex(home, x[0]);
}
};
Convex _convex("Convex::Convex");
/// %Test for convex hull propagator
class ConvexHull : public SetTest {
public:
/// Create and register test
ConvexHull(const char* t)
: SetTest(t,2,ds_33,false) {}
/// %Test whether \a x is solution
virtual bool solution(const SetAssignment& x) const {
CountableSetRanges xr0(x.lub, x[0]);
CountableSetRanges xr1(x.lub, x[1]);
if (!xr0())
return !xr1();
int x0min = xr0.min();
int x0max = xr0.max();
++xr0;
if (!xr0()) {
if (!xr1()) return false;
if (x0min != xr1.min()) return false;
int x1max = Gecode::Set::Limits::min;
while (xr1()) { x1max = xr1.max(); ++xr1;}
if (x0max != x1max) return false;
return true;
}
return false;
}
/// Post constraint on \a x
virtual void post(Space& home, SetVarArray& x, IntVarArray&) {
Gecode::convex(home, x[1], x[0]);
}
};
ConvexHull _convexhull("Convex::ConvexHull");
/// Sharing test for convex hull propagator
class ConvexHullS : public SetTest {
public:
/// Create and register test
ConvexHullS(const char* t)
: SetTest(t,1,ds_33,false) {}
/// %Test whether \a x is solution
virtual bool solution(const SetAssignment& x) const {
CountableSetRanges xr0(x.lub, x[0]);
if (!xr0())
return true;
++xr0;
if (!xr0())
return true;
return false;
}
/// Post constraint on \a x
virtual void post(Space& home, SetVarArray& x, IntVarArray&) {
Gecode::convex(home, x[0], x[0]);
}
};
ConvexHullS _convexhulls("Convex::Sharing::ConvexHullS");
//@}
}}}
// STATISTICS: test-set
|
